Michael Hoffmann

Cited by

	All	Since 2015
Citations	835	344
h-index	17	11
i10-index	31	13

200120022003200420052006200720082009201020112012201320142015201620172018201920204 9 14 31 35 40 32 38 39 55 31 33 55 49 66 44 42 64 47 77

Co-authors

Yoshio OkamotoUniversity of Electro-CommunicationsVerified email at uec.ac.jp
Vincent KustersETH ZurichVerified email at inf.ethz.ch
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
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerified email at informatik.uni-tuebingen.de
Marc van KreveldProfessor of Computer Science, Utrecht UniversityVerified email at uu.nl
Kevin BuchinAssociate Professor of Computer Science, Technical University EindhovenVerified email at tue.nl
Adam ShefferCUNY - Baruch CollegeVerified email at baruch.cuny.edu
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityVerified email at tufts.edu
Robert HearnVerified email at hearn.to
Robert HaasIBM ResearchVerified email at zurich.ibm.com
Francisco SantosProfessor of Mathematics, Universidad de CantabriaVerified email at unican.es
Takeaki UnoNational Institute of Informatics, JapanVerified email at nii.jp
Vladimir Deineko, PhD, DScAssociate Professor (Reader) Warwick Business SchoolVerified email at wbs.ac.uk
Joseph O'RourkeProfessor of Computer Science, Smith CollegeVerified email at smith.edu
Clemens HuemerUniversitat Politècnica de CatalunyaVerified email at upc.edu
Andre SchulzProfessor of CSVerified email at fernuni-hagen.de

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	51	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	50*	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	50*	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	50*	2006
Chordless paths through three vertices R Haas, M Hoffmann Theoretical Computer Science 351 (3), 360-371, 2006	34	2006
Pushing blocks is hard ED Demaine, ML Demaine, M Hoffmann, J O'Rourke Computational Geometry 26 (1), 21-36, 2003	34	2003
Segment endpoint visibility graphs are Hamiltonian M Hoffmann, CD Tóth Computational Geometry 26 (1), 47-68, 2003	34	2003
Push-2-f is pspace-complete. ED Demaine, RA Hearn, M Hoffmann CCCG, 31-35, 2002	34	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	29	2013
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	24	2004
Motion planning amidst movable square blocks: Push-* is NP-hard M Hoffmann Canadian Conference on Computational Geometry, 205-210, 2000	24	2000
Travel-time maps: Linear cartograms with fixed vertex locations K Buchin, A van Goethem, M Hoffmann, M van Kreveld, B Speckmann International Conference on Geographic Information Science, 18-33, 2014	21	2014
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	20	2011
An adaptable and extensible geometry kernel S Hert, M Hoffmann, L Kettner, S Pion, M Seel Computational Geometry 38 (1-2), 16-36, 2007	20	2007
PushPush-k is PSPACE-complete ED Demaine, M Hoffmann, M Holzer Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004	19	2004
Alternating paths through disjoint line segments M Hoffmann, CD Tóth Information processing letters 87 (6), 287-294, 2003	19	2003
Degree Bounds for Constrained Pseudo-Triangulations. O Aichholzer, M Hoffmann, B Speckmann, CD Tóth CCCG, 155-158, 2003	19	2003
The Euclidean degree-4 minimum spanning tree problem is NP-hard A Francke, M Hoffmann Proceedings of the twenty-fifth annual symposium on Computational geometry …, 2009	17	2009
A simple linear algorithm for computing rectilinear 3-centers M Hoffmann Computational Geometry 31 (3), 150-165, 2005	17	2005

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

Upload PDF

Follow this author

Cited by

Co-authors