Michael Hoffmann

Cited by

	All	Since 2017
Citations	940	327
h-index	18	10
i10-index	34	11

100

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120224 11 13 34 36 34 35 40 39 55 32 31 59 45 70 46 47 63 45 95 60 16

Public access

View all

44 articles

1 article

available

not available

Based on funding mandates

Co-authors

Vincent KustersETH ZurichVerified email at inf.ethz.ch
Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyVerified email at mit.edu
Jean CardinalUniversité libre de Bruxelles (ULB)Verified email at ulb.ac.be
Sylvain PionINRIAVerified email at inria.fr
Martin DemaineMITVerified email at mit.edu
Marc van KreveldProfessor of Computer Science, Utrecht UniversityVerified email at uu.nl
Kevin BuchinProfessor of Computer Science, Technical University DortmundVerified email at tu-dortmund.de
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityVerified email at tufts.edu
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Adam ShefferCUNY - Baruch CollegeVerified email at baruch.cuny.edu
Robert HearnVerified email at hearn.to
Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerified email at informatik.uni-tuebingen.de
Robert HaasIBM ResearchVerified email at zurich.ibm.com
Francisco SantosProfessor of Mathematics, Universidad de CantabriaVerified email at unican.es
Tillmann MiltzowUtrecht UniversityVerified email at uu.nl
Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
Clemens HuemerUniversitat Politècnica de CatalunyaVerified email at upc.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeVerified email at smith.edu
Irina KostitsynaTU EindhovenVerified email at tue.nl

Michael Hoffmann

ETH Zürich

Verified email at inf.ethz.ch - Homepage

Geometry Graphs Algorithms Complexity


Title Sort by citations Sort by year Sort by title	Cited by Cited by	Year
An adaptable and extensible geometry kernel S Hert, M Hoffmann, L Kettner, S Pion, M Seel International Workshop on Algorithm Engineering, 79-90, 2001	52	2001
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	49*	2006
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	49*	2006
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	49*	2006
Pushing blocks is hard ED Demaine, ML Demaine, M Hoffmann, J O'Rourke Computational Geometry 26 (1), 21-36, 2003	38	2003
Chordless paths through three vertices R Haas, M Hoffmann Theoretical Computer Science 351 (3), 360-371, 2006	36	2006
Segment endpoint visibility graphs are Hamiltonian M Hoffmann, CD Tóth Computational Geometry 26 (1), 47-68, 2003	36	2003
Push-2-f is pspace-complete. ED Demaine, RA Hearn, M Hoffmann CCCG, 31-35, 2002	35	2002
Counting plane graphs: flippability and its applications M Hoffmann, A Schulz, M Sharir, A Sheffer, CD Tóth, E Welzl Thirty Essays on Geometric Graph Theory, 303-325, 2013	32	2013
Motion planning amidst movable square blocks: Push-* is NP-hard M Hoffmann Canadian Conference on Computational Geometry, 205-210, 2000	27	2000
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	25	2006
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto International Workshop on Parameterized and Exact Computation, 200-212, 2004	25	2004
Travel-time maps: Linear cartograms with fixed vertex locations K Buchin, A Goethem, M Hoffmann, M Kreveld, B Speckmann International Conference on Geographic Information Science, 18-33, 2014	24	2014
An adaptable and extensible geometry kernel S Hert, M Hoffmann, L Kettner, S Pion, M Seel Computational Geometry 38 (1-2), 16-36, 2007	22	2007
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles A Asinowski, J Cardinal, N Cohen, S Collette, T Hackl, M Hoffmann, ... Workshop on Algorithms and Data Structures, 73-84, 2013	21	2013
PushPush-k is PSPACE-complete ED Demaine, M Hoffmann, M Holzer Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004	21	2004
Alternating paths through disjoint line segments M Hoffmann, CD Tóth Information processing letters 87 (6), 287-294, 2003	21	2003
Degree Bounds for Constrained Pseudo-Triangulations. O Aichholzer, M Hoffmann, B Speckmann, CD Tóth CCCG, 155-158, 2003	21	2003
Arc diagrams, flip distances, and Hamiltonian triangulations J Cardinal, M Hoffmann, V Kusters, CD Tóth, M Wettstein Computational Geometry 68, 206-225, 2018	19	2018
Counting plane graphs: Flippability and its applications M Hoffmann, M Sharir, A Sheffer, CD Tóth, E Welzl Workshop on Algorithms and Data Structures, 524-535, 2011	18	2011

The system can't perform the operation now. Try again later.

Articles 1–20

Citations per year

Duplicate citations

Merged citations

Add co-authorsCo-authors

Follow this author

Cited by

Co-authors