| The priority R-tree: A practically efficient and worst-case optimal R-tree L Arge, M Berg, H Haverkort, K Yi ACM Transactions on Algorithms (TALG) 4 (1), 1-30, 2008 | 336 | 2008 |
| Box-trees and R-trees with near-optimal query time M Hammar, HJ Haverkort Discrete & Computational Geometry 28 (3), 291-312, 2002 | 109 | 2002 |
| Locality and bounding-box quality of two-dimensional space-filling curves H Haverkort, F van Walderveen Computational Geometry 43 (2), 131-147, 2010 | 97 | 2010 |
| Computing visibility on terrains in external memory H Haverkort, L Toma, Y Zhuang Journal of Experimental Algorithmics (JEA) 13, 1.5-1.23, 2009 | 76 | 2009 |
| Drawing metro maps using Bézier curves M Fink, H Haverkort, M Nöllenburg, M Roberts, J Schuhmann, A Wolff International Symposium on Graph Drawing, 463-474, 2012 | 67 | 2012 |
| Algorithms for Multi-Criteria Boundary Labeling. M Benkert, HJ Haverkort, M Kroll, M Nöllenburg J. Graph Algorithms Appl. 13 (3), 289-317, 2009 | 57* | 2009 |
| Results on geometric networks and data structures HJ Haverkort | 52* | 2004 |
| Sparse geometric graphs with small dilation B Aronov, M De Berg, O Cheong, J Gudmundsson, H Haverkort, M Smid, ... Computational Geometry 40 (3), 207-219, 2008 | 46 | 2008 |
| Algorithmic aspects of proportional symbol maps S Cabello, H Haverkort, M Van Kreveld, B Speckmann Algorithmica 58 (3), 543-565, 2010 | 44* | 2010 |
| Improved visibility computation on massive grid terrains J Fishman, H Haverkort, L Toma Proceedings of the 17th ACM SIGSPATIAL international conference on advances …, 2009 | 40 | 2009 |
| Constrained higher order Delaunay triangulations J Gudmundsson, HJ Haverkort, M Van Kreveld Computational Geometry 30 (3), 271-277, 2005 | 39 | 2005 |
| Four-dimensional Hilbert curves for R-trees H Haverkort, FV Walderveen Journal of Experimental Algorithmics (JEA) 16, 3.1-3.19, 2008 | 38 | 2008 |
| Computing all immobilizing grasps of a simple polygon with few contacts JS Cheong, HJ Haverkort, AF van der Stappen Algorithmica 44 (2), 117-136, 2006 | 38* | 2006 |
| Computing a minimum-dilation spanning tree is NP-hard O Cheong, H Haverkort, M Lee Computational Geometry 41 (3), 188-205, 2008 | 35 | 2008 |
| Constructing minimum-interference networks M Benkert, J Gudmundsson, H Haverkort, A Wolff Computational Geometry 40 (3), 179-194, 2008 | 35* | 2008 |
| Multiple polyline to polygon matching M Tănase, RC Veltkamp, H Haverkort International Symposium on Algorithms and Computation, 60-70, 2005 | 33 | 2005 |
| Box-trees for collision checking in industrial installations HJ Haverkort, M De Berg, J Gudmundsson Computational Geometry 28 (2-3), 113-135, 2004 | 33 | 2004 |
| An inventory of three-dimensional Hilbert space-filling curves H Haverkort arXiv preprint arXiv:1109.2323, 2011 | 30 | 2011 |
| Cache-oblivious R-trees L Arge, M de Berg, H Haverkort Algorithmica 53 (1), 50-68, 2009 | 30 | 2009 |
| Efficient external-memory bisimulation on DAGs J Hellings, GHL Fletcher, H Haverkort Proceedings of the 2012 ACM SIGMOD International Conference on Management of …, 2012 | 29 | 2012 |
