Herman J. Haverkort

2009
38	EE	Herman J. Haverkort, Freek van Walderveen: Four-Dimensional Hilbert Curves for R-Trees. ALENEX 2009: 63-73
37	EE	Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)
36	EE	Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009)
2008
35	EE	Herman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. ESA 2008: 515-527
34	EE	Herman J. Haverkort, Laura Toma, Yi Zhuang: Computing visibility on terrains in external memory. ACM Journal of Experimental Algorithmics 13: (2008)
33	EE	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)
32	EE	Herman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves CoRR abs/0806.4787: (2008)
31	EE	Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008)
30	EE	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)
29	EE	Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008)
2007
28	EE	Herman J. Haverkort, Laura Toma, Yi Zhuang: Computing Visibility on Terrains in External Memory. ALENEX 2007
27	EE	Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24
26	EE	Marc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg: Algorithms for Multi-criteria One-Sided Boundary Labeling. Graph Drawing 2007: 243-254
25	EE	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
24	EE	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
23	EE	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)
22	EE	Otfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard CoRR abs/cs/0703023: (2007)
2006
21	EE	Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731
20	EE	Herman J. Haverkort, Laura Toma: I/O-Efficient Algorithms on Near-Planar Graphs. LATIN 2006: 580-591
19	EE	Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176
18	EE	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)
2005
17	EE	Mark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519
16	EE	Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59
15	EE	Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort: Multiple Polyline to Polygon Matching. ISAAC 2005: 60-70
14	EE	Lars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179
13	EE	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)
12	EE	Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005)
2004
11	EE	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
10	EE	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
9	EE	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)
8	EE	Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)
2003
7	EE	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
6	EE	Mark de Berg, Herman J. Haverkort: Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473
2002
5	EE	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
4	EE	Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62
3	EE	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)
2001
2	EE	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
1999
1	EE	Herman J. Haverkort, Hans L. Bodlaender: Finding a minimal tree in a polygon with its medial axis. CCCG 1999

Coauthor Index

1	Pankaj K. Agarwal	[2] [3]
2	Lars Arge	[10] [11] [14] [33] [37]
3	Boris Aronov	[16] [23] [30]
4	Tetsuo Asano	[13]
5	Marc Benkert	[19] [26] [31]
6	Mark de Berg	[2] [3] [4] [6] [8] [10] [11] [13] [14] [16] [17] [23] [24] [25] [30] [33] [36] [37]
7	Hans L. Bodlaender	[1]
8	Sergio Cabello	[21]
9	Jae-Sook Cheong	[7] [18]
10	Otfried Cheong (Otfried Schwarzkopf)	[13] [16] [22] [23] [24] [27] [29] [30]
11	Hazel Everett	[13]
12	Joachim Gudmundsson	[2] [3] [4] [5] [8] [9] [12] [16] [19] [23] [30] [31]
13	Mikael Hammar	[2] [3]
14	Naoki Katoh	[13]
15	Marc J. van Kreveld	[12] [21]
16	Moritz Kroll	[26]
17	Mira Lee	[22] [27] [29]
18	Jung Gun Lim	[24]
19	Martin Nöllenburg	[26]
20	Sang-Min Park	[5] [9]
21	Chan-Su Shin	[5] [9]
22	Michiel H. M. Smid	[23] [30]
23	Bettina Speckmann	[21]
24	A. Frank van der Stappen	[7] [18]
25	Micha Streppel	[17] [36]
26	Mirela Tanase	[15]
27	Shripad Thite	[25]
28	Laura Toma	[20] [24] [25] [28] [34]
29	Remco C. Veltkamp	[15]
30	Antoine Vigneron	[16] [23] [30]
31	Freek van Walderveen	[32] [35] [38]
32	Alexander Wolff	[5] [9] [13] [19] [31]
33	Ke Yi	[10] [11] [33]
34	Yi Zhuang	[28] [34]

Colors in the list of coauthors