The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Herman J. Haverkort: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility Location and the Geometric Minimum-Diameter Spanning Tree. [Citation Graph (0, 0)][DBLP]
    APPROX, 2002, pp:146-160 [Conf]
  2. Herman J. Haverkort, Hans L. Bodlaender
    Finding a minimal tree in a polygon with its medial axis. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  3. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-trees and R-trees with near-optimal query time. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2001, pp:124-133 [Conf]
  4. Lars Arge, Mark de Berg, Herman J. Haverkort
    Cache-oblivious r-trees. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2005, pp:170-179 [Conf]
  5. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2002, pp:53-62 [Conf]
  6. Mark de Berg, Herman J. Haverkort, Micha Streppel
    Efficient c-Oriented Range Searching with DOP-Trees. [Citation Graph (0, 0)][DBLP]
    ESA, 2005, pp:508-519 [Conf]
  7. Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann
    Algorithmic Aspects of Proportional Symbol Maps. [Citation Graph (0, 0)][DBLP]
    ESA, 2006, pp:720-731 [Conf]
  8. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Antoine Vigneron
    Sparse Geometric Graphs with Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:50-59 [Conf]
  9. Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
    On Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:260-269 [Conf]
  10. Mirela Tanase, Remco C. Veltkamp, Herman J. Haverkort
    Multiple Polyline to Polygon Matching. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:60-70 [Conf]
  11. Herman J. Haverkort, Laura Toma
    I/O-Efficient Algorithms on Near-Planar Graphs. [Citation Graph (0, 0)][DBLP]
    LATIN, 2006, pp:580-591 [Conf]
  12. Lars Arge, Mark de Berg, Herman J. Haverkort, Ke Yi
    The Priority R-Tree: A Practically Efficient and Worst-Case Optimal R-Tree. [Citation Graph (0, 0)][DBLP]
    SIGMOD Conference, 2004, pp:347-358 [Conf]
  13. Marc Benkert, Joachim Gudmundsson, Herman J. Haverkort, Alexander Wolff
    Constructing Interference-Minimal Networks. [Citation Graph (0, 0)][DBLP]
    SOFSEM, 2006, pp:166-176 [Conf]
  14. Mark de Berg, Herman J. Haverkort
    Significant-Presence Range Queries in Categorical Data. [Citation Graph (0, 0)][DBLP]
    WADS, 2003, pp:462-473 [Conf]
  15. Jae-Sook Cheong, Herman J. Haverkort, A. Frank van der Stappen
    Computing All Immobilizing Grasps of a Simple Polygon with Few Contacts. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:117-136 [Journal]
  16. Tetsuo Asano, Mark de Berg, Otfried Cheong, Hazel Everett, Herman J. Haverkort, Naoki Katoh, Alexander Wolff
    Optimal spanners for axis-aligned rectangles. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:1, pp:59-77 [Journal]
  17. Joachim Gudmundsson, Herman J. Haverkort, Marc J. van Kreveld
    Constrained higher order Delaunay triangulations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:3, pp:271-277 [Journal]
  18. Joachim Gudmundsson, Herman J. Haverkort, Sang-Min Park, Chan-Su Shin, Alexander Wolff
    Facility location and the geometric minimum-diameter spanning tree. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:87-106 [Journal]
  19. Herman J. Haverkort, Mark de Berg, Joachim Gudmundsson
    Box-trees for collision checking in industrial installations. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:28, n:2-3, pp:113-135 [Journal]
  20. Pankaj K. Agarwal, Mark de Berg, Joachim Gudmundsson, Mikael Hammar, Herman J. Haverkort
    Box-Trees and R-Trees with Near-Optimal Query Time. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 2002, v:28, n:3, pp:291-312 [Journal]
  21. Herman J. Haverkort, Laura Toma, Yi Zhuang
    Computing Visibility on Terrains in External Memory. [Citation Graph (0, 0)][DBLP]
    ALENEX, 2007, pp:- [Conf]
  22. Mark de Berg, Otfried Cheong, Herman J. Haverkort, Jung Gun Lim, Laura Toma
    I/O-Efficient Flow Modeling on Fat Terrains. [Citation Graph (0, 0)][DBLP]
    WADS, 2007, pp:239-250 [Conf]
  23. Boris Aronov, Mark de Berg, Otfried Cheong, Joachim Gudmundsson, Herman J. Haverkort, Michiel H. M. Smid, Antoine Vigneron
    Sparse geometric graphs with small dilation [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]
  24. Otfried Cheong, Herman J. Haverkort, Mira Lee
    Computing a Minimum-Dilation Spanning Tree is NP-hard [Citation Graph (0, 0)][DBLP]
    CoRR, 2007, v:0, n:, pp:- [Journal]

  25. Four-Dimensional Hilbert Curves for R-Trees. [Citation Graph (, )][DBLP]


  26. Computing a Minimum-Dilation Spanning Tree is NP-hard. [Citation Graph (, )][DBLP]


  27. Visibility maps of realistic terrains have linear smoothed complexity. [Citation Graph (, )][DBLP]


  28. The Priority R-Tree: A Practically Efficient and Worst-Case-Optimal R-Tree. [Citation Graph (, )][DBLP]


  29. Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves. [Citation Graph (, )][DBLP]


  30. Constructing interference-minimal networks. [Citation Graph (, )][DBLP]


  31. Algorithms for Multi-criteria One-Sided Boundary Labeling. [Citation Graph (, )][DBLP]


  32. Improved visibility computation on massive grid terrains. [Citation Graph (, )][DBLP]


  33. I/O-Efficient Map Overlay and Point Location in Low-Density Subdivisions. [Citation Graph (, )][DBLP]


  34. Cache-Oblivious R-Trees. [Citation Graph (, )][DBLP]


  35. Constructing minimum-interference networks. [Citation Graph (, )][DBLP]


  36. Sparse geometric graphs with small dilation. [Citation Graph (, )][DBLP]


  37. Computing a minimum-dilation spanning tree is NP-hard. [Citation Graph (, )][DBLP]


  38. Efficient c-oriented range searching with DOP-trees. [Citation Graph (, )][DBLP]


  39. Locality and bounding-box quality of two-dimensional space-filling curves. [Citation Graph (, )][DBLP]


  40. Star-quadtrees and guard-quadtrees: I/O-efficient indexes for fat triangulations and low-density planar subdivisions. [Citation Graph (, )][DBLP]


  41. The complexity of flow on fat terrains and its i/o-efficient computation. [Citation Graph (, )][DBLP]


  42. Locality and Bounding-Box Quality of Two-Dimensional Space-Filling Curves [Citation Graph (, )][DBLP]


  43. Recursive tilings and space-filling curves with little fragmentation [Citation Graph (, )][DBLP]


Search in 0.004secs, Finished in 0.006secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002