Herman J. Haverkort

Herman J. Haverkort, Mark McGranaghan, Laura Toma: An Edge Quadtree for External Memory. SEA 2013: 115-126

Martin Fink, Herman J. Haverkort, Martin Nöllenburg, Maxwell Roberts, Julian Schuhmann, Alexander Wolff: Drawing Metro Maps Using Bézier Curves. Graph Drawing 2012: 463-474

Lars Arge, Herman J. Haverkort, Constantinos Tsirogiannis: Fast generation of multiple resolution instances of raster data sets. SIGSPATIAL/GIS 2012: 52-60

Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort: Efficient external-memory bisimulation on DAGs. SIGMOD Conference 2012: 553-564

Herman J. Haverkort: Harmonious Hilbert curves and other extradimensional space-filling curves. CoRR abs/1211.0175 (2012)

Herman J. Haverkort: I/O-optimal algorithms on grid graphs. CoRR abs/1211.2066 (2012)

Herman J. Haverkort, Freek van Walderveen: Four-dimensional hilbert curves for R-trees. ACM Journal of Experimental Algorithmics 16 (2011)

Herman J. Haverkort, Laura Toma: I/O-Efficient Algorithms on Near-Planar Graphs. J. Graph Algorithms Appl. 15(4): 503-532 (2011)

Herman J. Haverkort: Recursive tilings and space-filling curves with little fragmentation. JoCG 2(1): 92-127 (2011)

Tal Milea, Okke Schrijvers, Kevin Buchin, Herman J. Haverkort: Shortest-Paths Preserving Metro Maps. Graph Drawing 2011: 445-446

Herman J. Haverkort, Constantinos P. Tsirogiannis: Flow on noisy terrains: an experimental evaluation. GIS 2011: 84-91

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Implicit Flow Routing on Terrains with Applications to Surface Networks and Drainage Structures. SODA 2011: 285-296

Anne Driemel, Herman J. Haverkort, Maarten Löffler, Rodrigo I. Silveira: Flow Computations on Imprecise Terrains. WADS 2011: 350-361

Herman J. Haverkort: An inventory of three-dimensional Hilbert space-filling curves. CoRR abs/1109.2323 (2011)

Anne Driemel, Herman J. Haverkort, Maarten Löffler: Flow Computations on Imprecise Terrains. CoRR abs/1111.1651 (2011)

Jelle Hellings, George H. L. Fletcher, Herman J. Haverkort: I/O efficient bisimulation partitioning on very large directed acyclic graphs. CoRR abs/1112.0857 (2011)

Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. Algorithmica 58(3): 543-565 (2010)

Herman J. Haverkort, Freek van Walderveen: Locality and bounding-box quality of two-dimensional space-filling curves. Comput. Geom. 43(2): 131-147 (2010)

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma: The complexity of flow on fat terrains and its i/o-efficient computation. Comput. Geom. 43(4): 331-356 (2010)

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma: Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. Comput. Geom. 43(5): 493-513 (2010)

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Visibility Maps of Realistic Terrains have Linear Smoothed Complexity. JoCG 1(1): 57-71 (2010)

Herman J. Haverkort: Recursive tilings and space-filling curves with little fragmentation. CoRR abs/1002.1843 (2010)

Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)

Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009)

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg: Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. 13(3): 289-317 (2009)

Herman J. Haverkort, Freek van Walderveen: Four-Dimensional Hilbert Curves for R-Trees. ALENEX 2009: 63-73

Mark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Visibility maps of realistic terrains have linear smoothed complexity. Symposium on Computational Geometry 2009: 163-168

Jeremy Fishman, Herman J. Haverkort, Laura Toma: Improved visibility computation on massive grid terrains. GIS 2009: 121-130

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008)

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. Comput. Geom. 40(3): 207-219 (2008)

Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008)

Herman J. Haverkort, Laura Toma, Yi Zhuang: Computing visibility on terrains in external memory. ACM Journal of Experimental Algorithmics 13 (2008)

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The priority R-tree: A practically efficient and worst-case optimal R-tree. ACM Transactions on Algorithms 4(1) (2008)

Herman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. ESA 2008: 515-527

Herman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. CoRR abs/0806.4787 (2008)

Herman J. Haverkort, Laura Toma, Yi Zhuang: Computing Visibility on Terrains in External Memory. ALENEX 2007

Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24

Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg: Algorithms for Multi-criteria One-Sided Boundary Labeling. Graph Drawing 2007: 243-254

Mark de Berg, Herman J. Haverkort, Shripad Thite, Laura Toma: I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. ISAAC 2007: 500-511

Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma: I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron: Sparse geometric graphs with small dilation. CoRR abs/cs/0702080 (2007)

Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard. CoRR abs/cs/0703023 (2007)

Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen: Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. Algorithmica 44(2): 117-136 (2006)

Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731

Herman J. Haverkort, Laura Toma: I/O-Efficient Algorithms on Near-Planar Graphs. LATIN 2006: 580-591

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176

Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff: Optimal spanners for axis-aligned rectangles. Comput. Geom. 30(1): 59-77 (2005)

Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005)

Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179

Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519

Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59

Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort: Multiple Polyline to Polygon Matching. ISAAC 2005: 60-70

Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing interference-minimal networks. EuroCG 2005: 203-206

Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility location and the geometric minimum-diameter spanning tree. Comput. Geom. 27(1): 87-106 (2004)

Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. Cache-Oblivious and Cache-Aware Algorithms 2004

Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi: The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. SIGMOD Conference 2004: 347-358

Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen: On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. ISAAC 2003: 260-269

Mark de Berg, Herman J. Haverkort: Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473

Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-Trees and R-Trees with Near-Optimal Query Time. Discrete & Computational Geometry 28(3): 291-312 (2002)

Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff: Facility Location and the Geometric Minimum-Diameter Spanning Tree. APPROX 2002: 146-160

Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62

Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort: Box-trees and R-trees with near-optimal query time. Symposium on Computational Geometry 2001: 124-133

Herman J. Haverkort, Hans L. Bodlaender: Finding a minimal tree in a polygon with its medial axis. CCCG 1999