Michael Hoffmann

Citée par

	Toutes	Depuis 2020
Citations	1498	600
indice h	21	11
indice i10	44	13

160

120

20012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202420255 9 16 34 37 41 36 43 39 55 35 36 48 49 74 64 64 73 92 142 115 97 120 104 20

Accès public

Tout afficher

46 articles

3 articles

disponibles

non disponibles

Sur la base des exigences liées au financement

Coauteurs

Vincent KustersETH ZurichAdresse e-mail validée de inf.ethz.ch
Yoshio OkamotoUniversity of Electro-CommunicationsAdresse e-mail validée de uec.ac.jp
Erik DemaineProfessor of Electrical Engineering and Computer Science, Massachusetts Institute of TechnologyAdresse e-mail validée de mit.edu
Jean CardinalUniversité libre de Bruxelles (ULB)Adresse e-mail validée de ulb.be
Sylvain Pionex-INRIAAdresse e-mail validée de normalesup.org
Michael KaufmannProfessor of Computer Science, Tübingen UniversityAdresse e-mail validée de uni-tuebingen.de
Martin DemaineMITAdresse e-mail validée de mit.edu
Marc van KreveldProfessor of Computer Science, Utrecht UniversityAdresse e-mail validée de uu.nl
Tillmann MiltzowUtrecht UniversityAdresse e-mail validée de uu.nl
Kevin BuchinProfessor of Computer Science, Technical University DortmundAdresse e-mail validée de tu-dortmund.de
Gerhard WoegingerProfessor of Computer Science, RWTH AachenAdresse e-mail validée de cs.rwth-aachen.de
Diane SouvaineProfessor of Computer Science & Vice Provost for Research, Tufts UniversityAdresse e-mail validée de tufts.edu
Robert HaasIBM ResearchAdresse e-mail validée de zurich.ibm.com
Robert HearnAdresse e-mail validée de hearn.to
Francisco SantosProfessor of Mathematics, Universidad de CantabriaAdresse e-mail validée de unican.es
Takeaki UnoNational Institute of Informatics, JapanAdresse e-mail validée de nii.jp
Clemens HuemerUniversitat Politècnica de CatalunyaAdresse e-mail validée de upc.edu
Adam ShefferCUNY - Baruch CollegeAdresse e-mail validée de baruch.cuny.edu
Joseph O'RourkeProfessor of Computer Science, Smith CollegeAdresse e-mail validée de smith.edu
Andre SchulzProfessor of CSAdresse e-mail validée de fernuni-hagen.de

Suivre

Michael Hoffmann

ETH Zürich

Adresse e-mail validée de inf.ethz.ch - Page d'accueil

Geometry Graphs Algorithms Complexity


Titre Trier par citations Trier par année Trier par titre	Citée par Citée par	Année
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	195	2018
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	83	2015
The traveling salesman problem with few inner points VG Deı, M Hoffmann, Y Okamoto, GJ Woeginger Operations Research Letters 34 (1), 106-110, 2006	62*	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	51	2001
Chordless paths through three vertices R Haas, M Hoffmann Theoretical Computer Science 351 (3), 360-371, 2006	49	2006
Segment endpoint visibility graphs are Hamiltonian M Hoffmann, CD Tóth Computational Geometry 26 (1), 47-68, 2003	44	2003
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	42	2012
Pushing blocks is hard ED Demaine, ML Demaine, M Hoffmann, J O'Rourke Computational Geometry 26 (1), 21-36, 2003	42	2003
Push-2-f is pspace-complete. ED Demaine, RA Hearn, M Hoffmann CCCG, 31-35, 2002	36	2002
Motion planning amidst movable square blocks: Push-* is NP-hard M Hoffmann Canadian Conference on Computational Geometry, 205-210, 2000	31	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	30	2014
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	28	2020
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	28	2013
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	26	2020
Arc diagrams, flip distances, and Hamiltonian triangulations J Cardinal, M Hoffmann, V Kusters, CD Tóth, M Wettstein Computational Geometry 68, 206-225, 2018	26	2018
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Computational Geometry 34 (3), 149-158, 2006	26	2006
PushPush-k is PSPACE-complete ED Demaine, M Hoffmann, M Holzer Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004	24	2004
Alternating paths through disjoint line segments M Hoffmann, CD Tóth Information processing letters 87 (6), 287-294, 2003	24	2003
The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto Parameterized and Exact Computation: First International Workshop, IWPEC …, 2004	23	2004
A simple linear algorithm for computing rectilinear 3-centers M Hoffmann Computational Geometry 31 (3), 150-165, 2005	22	2005

Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.

Articles 1–20

Nombre de citations par an

Citations en double

Citations fusionnées

Ajouter les coauteursCoauteurs

Suivre

Citée par

Coauteurs