| 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 | 212 | 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 | 87 | 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 | 63* | 2006 |
| Chordless paths through three vertices R Haas, M Hoffmann Theoretical Computer Science 351 (3), 360-371, 2006 | 54 | 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 |
| The minimum weight triangulation problem with few inner points M Hoffmann, Y Okamoto International Workshop on Parameterized and Exact Computation, 200-212, 2004 | 48 | 2004 |
| Pushing blocks is hard ED Demaine, ML Demaine, M Hoffmann, J O'Rourke Computational Geometry 26 (1), 21-36, 2003 | 43 | 2003 |
| Segment endpoint visibility graphs are Hamiltonian M Hoffmann, CD Tóth Computational Geometry 26 (1), 47-68, 2003 | 43 | 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 | 41 | 2012 |
| Push-2-f is pspace-complete. ED Demaine, RA Hearn, M Hoffmann CCCG, 31-35, 2002 | 38 | 2002 |
| Query-competitive algorithms for cheapest set problems under uncertainty T Erlebach, M Hoffmann, F Kammer Theoretical Computer Science 613, 51-64, 2016 | 37 | 2016 |
| Motion planning amidst movable square blocks: Push-* is NP-hard M Hoffmann Canadian Conference on Computational Geometry, 205-210, 2000 | 32 | 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 | 31 | 2014 |
| 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 (1), 2020 | 30 | 2020 |
| 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 | 30 | 2013 |
| 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 | 29 | 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 | 28 | 2018 |
| PushPush-k is PSPACE-complete ED Demaine, M Hoffmann, M Holzer Proceedings of the 3rd International Conference on FUN with Algorithms, 159-170, 2004 | 26 | 2004 |
| Network discovery and verification with distance queries T Erlebach, A Hall, M Hoffmann, M Mihaľák Italian Conference on Algorithms and Complexity, 69-80, 2006 | 23 | 2006 |
| Alternating paths through disjoint line segments M Hoffmann, CD Tóth Information processing letters 87 (6), 287-294, 2003 | 23 | 2003 |
Vincent KustersETH ZurichVerified email at inf.ethz.ch
