| 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 | 380 | 2008 |
| Box-trees and R-trees with near-optimal query time PK Agarwal, M de Berg, J Gudmundsson, M Hammar, HJ Haverkort Proceedings of the seventeenth annual symposium on Computational geometry …, 2001 | 118 | 2001 |
| Locality and bounding-box quality of two-dimensional space-filling curves H Haverkort, F van Walderveen Computational Geometry 43 (2), 131-147, 2010 | 109 | 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 | 83 | 2009 |
| Drawing metro maps using Bézier curves M Fink, H Haverkort, M Nöllenburg, M Roberts, J Schuhmann, A Wolff Graph Drawing: 20th International Symposium, GD 2012, Redmond, WA, USA …, 2013 | 74 | 2013 |
| Algorithms for multi-criteria boundary labeling M Benkert, H Haverkort, M Kroll, M Nöllenburg Journal of Graph Algorithms and Applications 13 (3), 289-317, 2009 | 62* | 2009 |
| Results on geometric networks and data structures HJ Haverkort | 59* | 2004 |
| Algorithmic aspects of proportional symbol maps S Cabello, H Haverkort, M Van Kreveld, B Speckmann Algorithmica 58, 543-565, 2010 | 50* | 2010 |
| 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 | 50 | 2008 |
| Improved visibility computation on massive grid terrains J Fishman, H Haverkort, L Toma Proceedings of the 17th ACM SIGSPATIAL international conference on advances …, 2009 | 46 | 2009 |
| Constrained higher order Delaunay triangulations J Gudmundsson, HJ Haverkort, M Van Kreveld Computational Geometry 30 (3), 271-277, 2005 | 45 | 2005 |
| Four-dimensional Hilbert curves for R-trees H Haverkort, FV Walderveen Journal of Experimental Algorithmics (JEA) 16, 3.1-3.19, 2008 | 42 | 2008 |
| Computing a minimum-dilation spanning tree is NP-hard O Cheong, H Haverkort, M Lee Computational Geometry 41 (3), 188-205, 2008 | 41 | 2008 |
| Computing all immobilizing grasps of a simple polygon with few contacts JS Cheong, HJ Haverkort, AF van der Stappen Algorithmica 44, 117-136, 2006 | 41* | 2006 |
| An inventory of three-dimensional Hilbert space-filling curves H Haverkort arXiv preprint arXiv:1109.2323, 2011 | 37 | 2011 |
| Constructing minimum-interference networks M Benkert, J Gudmundsson, H Haverkort, A Wolff Computational Geometry 40 (3), 179-194, 2008 | 37* | 2008 |
| Efficient external-memory bisimulation on DAGs J Hellings, GHL Fletcher, H Haverkort Proceedings of the 2012 ACM SIGMOD International Conference on Management of …, 2012 | 34 | 2012 |
| Box-trees for collision checking in industrial installations HJ Haverkort, M De Berg, J Gudmundsson Proceedings of the eighteenth annual symposium on Computational geometry, 53-62, 2002 | 34 | 2002 |
| Multiple polyline to polygon matching M Tănase, RC Veltkamp, H Haverkort Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya …, 2005 | 32 | 2005 |
| Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions M de Berg, H Haverkort, S Thite, L Toma Computational Geometry 43 (5), 493-513, 2010 | 27* | 2010 |
