Michael Hoffmann
Michael Hoffmann
Geverifieerd e-mailadres voor inf.ethz.ch - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
An adaptable and extensible geometry kernel
S Hert, M Hoffmann, L Kettner, S Pion, M Seel
International Workshop on Algorithm Engineering, 79-90, 2001
512001
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
342006
Pushing blocks is hard
ED Demaine, ML Demaine, M Hoffmann, J O'Rourke
Computational Geometry 26 (1), 21-36, 2003
342003
Segment endpoint visibility graphs are Hamiltonian
M Hoffmann, CD Tóth
Computational Geometry 26 (1), 47-68, 2003
342003
Push-2-f is pspace-complete.
ED Demaine, RA Hearn, M Hoffmann
CCCG, 31-35, 2002
342002
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
292013
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
Computational Geometry 34 (3), 149-158, 2006
252006
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
International Workshop on Parameterized and Exact Computation, 200-212, 2004
242004
Motion planning amidst movable square blocks: Push-* is NP-hard
M Hoffmann
Canadian Conference on Computational Geometry, 205-210, 2000
232000
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
212014
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
202011
An adaptable and extensible geometry kernel
S Hert, M Hoffmann, L Kettner, S Pion, M Seel
Computational Geometry 38 (1-2), 16-36, 2007
202007
PushPush-k is PSPACE-complete
ED Demaine, M Hoffmann, M Holzer
Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004
192004
Alternating paths through disjoint line segments
M Hoffmann, CD Tóth
Information processing letters 87 (6), 287-294, 2003
192003
Degree Bounds for Constrained Pseudo-Triangulations.
O Aichholzer, M Hoffmann, B Speckmann, CD Tóth
CCCG, 155-158, 2003
192003
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
172009
A simple linear algorithm for computing rectilinear 3-centers
M Hoffmann
Computational Geometry 31 (3), 150-165, 2005
172005
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20