Herman J. Haverkort Home Page Coauthor index DBLP Vis pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2010
43Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort: Recursive tilings and space-filling curves with little fragmentation CoRR abs/1002.1843: (2010)
2009
42Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Freek van Walderveen: Four-Dimensional Hilbert Curves for R-Trees. ALENEX 2009: 63-73
41Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJeremy Fishman, Herman J. Haverkort, Laura Toma: Improved visibility computation on massive grid terrains. GIS 2009: 121-130
40Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Herman J. Haverkort, Constantinos P. Tsirogiannis: Visibility maps of realistic terrains have linear smoothed complexity. Symposium on Computational Geometry 2009: 163-168
39Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Arge, Mark de Berg, Herman J. Haverkort: Cache-Oblivious R-Trees. Algorithmica 53(1): 50-68 (2009)
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-oriented range searching with DOP-trees. Comput. Geom. 42(3): 250-267 (2009)
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg: Algorithms for Multi-Criteria Boundary Labeling. J. Graph Algorithms Appl. 13(3): 289-317 (2009)
2008
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. ESA 2008: 515-527
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Laura Toma, Yi Zhuang: Computing visibility on terrains in external memory. ACM Journal of Experimental Algorithmics 13: (2008)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars 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)
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Freek van Walderveen: Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves CoRR abs/0806.4787: (2008)
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing minimum-interference networks. Comput. Geom. 40(3): 179-194 (2008)
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris 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)
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOtfried Cheong, Herman J. Haverkort, Mira Lee: Computing a minimum-dilation spanning tree is NP-hard. Comput. Geom. 41(3): 188-205 (2008)
2007
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Laura Toma, Yi Zhuang: Computing Visibility on Terrains in External Memory. ALENEX 2007
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOtfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard. CATS 2007: 15-24
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Benkert, Herman J. Haverkort, Moritz Kroll, Martin Nöllenburg: Algorithms for Multi-criteria One-Sided Boundary Labeling. Graph Drawing 2007: 243-254
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark 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
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma: I/O-Efficient Flow Modeling on Fat Terrains. WADS 2007: 239-250
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris 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)
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLOtfried Cheong, Herman J. Haverkort, Mira Lee: Computing a Minimum-Dilation Spanning Tree is NP-hard CoRR abs/cs/0703023: (2007)
2006
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLSergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann: Algorithmic Aspects of Proportional Symbol Maps. ESA 2006: 720-731
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Laura Toma: I/O-Efficient Algorithms on Near-Planar Graphs. LATIN 2006: 580-591
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing Interference-Minimal Networks. SOFSEM 2006: 166-176
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJae-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
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Herman J. Haverkort, Micha Streppel: Efficient c-Oriented Range Searching with DOP-Trees. ESA 2005: 508-519
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff: Constructing interference-minimal networks. EuroCG 2005: 203-206
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBoris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron: Sparse Geometric Graphs with Small Dilation. ISAAC 2005: 50-59
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMirela Tanase, Remco C. Veltkamp, Herman J. Haverkort: Multiple Polyline to Polygon Matching. ISAAC 2005: 60-70
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars Arge, Mark de Berg, Herman J. Haverkort: Cache-oblivious r-trees. Symposium on Computational Geometry 2005: 170-179
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLTetsuo 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)
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld: Constrained higher order Delaunay triangulations. Comput. Geom. 30(3): 271-277 (2005)
2004
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars 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
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLLars 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
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim 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)
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Comput. Geom. 28(2-3): 113-135 (2004)
2003
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJae-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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMark de Berg, Herman J. Haverkort: Significant-Presence Range Queries in Categorical Data. WADS 2003: 462-473
2002
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLJoachim 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
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Mark de Berg, Joachim Gudmundsson: Box-trees for collision checking in industrial installations. Symposium on Computational Geometry 2002: 53-62
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj 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
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPankaj 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
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHerman J. Haverkort, Hans L. Bodlaender: Finding a minimal tree in a polygon with its medial axis. CCCG 1999

Coauthor Index

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

Colors in the list of coauthors

Copyright © Fri Mar 12 12:56:28 2010 by Michael Ley (ley@uni-trier.de)