Michael Hoffmann

Cited by

	All	Since 2016
Citations	1021	449
h-index	18	11
i10-index	36	15

120

2001200220032004200520062007200820092010201120122013201420152016201720182019202020214 10 14 33 35 35 35 40 40 56 31 32 58 51 67 55 58 74 70 119 69

Public access

View all

41 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
Michael KaufmannProfessor of Computer Science, Tübingen UniversityVerified email at informatik.uni-tuebingen.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenVerified email at cs.rwth-aachen.de
Kevin BuchinAssociate Professor of Computer Science, Technical University EindhovenVerified email at tue.nl
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityVerified email at tufts.edu
Adam ShefferCUNY - Baruch CollegeVerified email at baruch.cuny.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
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
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
On temporal graph exploration T Erlebach, M Hoffmann, F Kammer Journal of Computer and System Sciences 119, 1-18, 2021	85	2021
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	53*	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	53*	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	53*	2006
An adaptable and extensible geometry kernel S Hert, M Hoffmann, L Kettner, S Pion, M Seel International Workshop on Algorithm Engineering, 79-90, 2001	53	2001
Pushing blocks is hard ED Demaine, ML Demaine, M Hoffmann, J O'Rourke Computational Geometry 26 (1), 21-36, 2003	37	2003
Segment endpoint visibility graphs are Hamiltonian M Hoffmann, CD Tóth Computational Geometry 26 (1), 47-68, 2003	37	2003
Chordless paths through three vertices R Haas, M Hoffmann Theoretical Computer Science 351 (3), 360-371, 2006	36	2006
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
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
Motion planning amidst movable square blocks: Push-* is NP-hard M Hoffmann Canadian Conference on Computational Geometry, 205-210, 2000	25	2000
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	24	2006
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	23	2014
Degree Bounds for Constrained Pseudo-Triangulations. O Aichholzer, M Hoffmann, B Speckmann, CD Tóth CCCG, 155-158, 2003	21	2003
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	20	2004
Alternating paths through disjoint line segments M Hoffmann, CD Tóth Information processing letters 87 (6), 287-294, 2003	20	2003
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	19	2013
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	18	2009

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