Urmăriți
Michael Hoffmann
Michael Hoffmann
ETH Zürich
Adresă de e-mail confirmată pe inf.ethz.ch - Pagina de pornire
Titlu
Citat de
Citat de
Anul
Rivaroxaban or aspirin for patent foramen ovale and embolic stroke of undetermined source: a prespecified subgroup analysis from the NAVIGATE ESUS trial
SE Kasner, B Swaminathan, P Lavados, M Sharma, K Muir, R Veltkamp, ...
The Lancet Neurology 17 (12), 1053-1060, 2018
1952018
Genetic analysis for a shared biological basis between migraine and coronary artery disease
BS Winsvold, CP Nelson, R Malik, P Gormley, V Anttila, J Vander Heiden, ...
Neurology: Genetics 1 (1), e10, 2015
832015
The traveling salesman problem with few inner points
VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger
Operations Research Letters 34 (1), 106-110, 2006
61*2006
An adaptable and extensible geometry kernel
S Hert, M Hoffmann, L Kettner, S Pion, M Seel
Algorithm Engineering: 5th International Workshop, WAE 2001 Århus, Denmark …, 2001
512001
Chordless paths through three vertices
R Haas, M Hoffmann
Theoretical Computer Science 351 (3), 360-371, 2006
492006
Segment endpoint visibility graphs are Hamiltonian
M Hoffmann, CD Tóth
Computational Geometry 26 (1), 47-68, 2003
442003
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, 2012
422012
Pushing blocks is hard
ED Demaine, ML Demaine, M Hoffmann, J O'Rourke
Computational Geometry 26 (1), 21-36, 2003
422003
Push-2-f is pspace-complete.
ED Demaine, RA Hearn, M Hoffmann
CCCG, 31-35, 2002
362002
Motion planning amidst movable square blocks: Push-* is NP-hard
M Hoffmann
Canadian Conference on Computational Geometry, 205-210, 2000
312000
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
302014
Simple k-planar graphs are simple (k+ 1)-quasiplanar
P Angelini, MA Bekos, FJ Brandenburg, G Da Lozzo, G Di Battista, ...
Journal of Combinatorial Theory, Series B 142, 1-35, 2020
282020
Coloring hypergraphs induced by dynamic point sets and bottomless rectangles
A Asinowski, J Cardinal, N Cohen, S Collette, T Hackl, M Hoffmann, ...
Algorithms and Data Structures: 13th International Symposium, WADS 2013 …, 2013
282013
2D and 3D linear geometry kernel
H Brönnimann, A Fabri, GJ Giezeman, S Hert, M Hoffmann, L Kettner, ...
CGAL User and Reference Manual 5 (2), 2020
262020
Arc diagrams, flip distances, and Hamiltonian triangulations
J Cardinal, M Hoffmann, V Kusters, CD Tóth, M Wettstein
Computational Geometry 68, 206-225, 2018
262018
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
Computational Geometry 34 (3), 149-158, 2006
262006
PushPush-k is PSPACE-complete
ED Demaine, M Hoffmann, M Holzer
Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004
242004
Alternating paths through disjoint line segments
M Hoffmann, CD Tóth
Information processing letters 87 (6), 287-294, 2003
242003
The minimum weight triangulation problem with few inner points
M Hoffmann, Y Okamoto
Parameterized and Exact Computation: First International Workshop, IWPEC …, 2004
232004
A simple linear algorithm for computing rectilinear 3-centers
M Hoffmann
Computational Geometry 31 (3), 150-165, 2005
222005
Sistemul nu poate realiza operația în acest moment. Încercați din nou mai târziu.
Articole 1–20