Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Haverkort, Herman"
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Drawing metro maps using Bézier curves
Martin Fink
,
Herman Haverkort
,
Martin Nöllenburg
,
Maxwell Roberts
,
Julian Schuhmann
,
Alexander Wolff
Lecture Notes in Computer Science
7704
, 2013, pp. 463-474
Shortest-paths preserving metro maps
Tal Milea
,
Okke Schrijvers
,
Kevin Buchin
,
Herman Haverkort
Lecture Notes in Computer Science
7034
, 2012, pp. 445-446
Flow computations on imprecise terrains
Anne Driemel
,
Herman Haverkort
,
Maarten Löffler
,
Rodrigo I. Silveira
Lecture Notes in Computer Science
6844
, 2011, pp. 350-361
Algorithmic aspects of proportional symbol maps
Sergio Cabello
,
Herman Haverkort
,
Marc van Kreveld
,
Bettina Speckmann
Algorithmica
58
(3), 2010, pp. 543-565
Cache-oblivious R-trees
Lars Arge
,
Mark de Berg
,
Herman Haverkort
Algorithmica
53
(1), 2009, pp. 50-68
Algorithms for multi-criteria one-sided boundary labeling
Marc Benkert
,
Herman Haverkort
,
Moritz Kroll
,
Martin Nöllenburg
Lecture Notes in Computer Science
4875
, 2008, pp. 243-254
Locality and bounding-box quality of two-dimensional space-filling curves
Herman Haverkort
,
Freek van Walderveen
Lecture Notes in Computer Science
5193
, 2008, pp. 515-527
I/O-efficient flow modeling on fat terrains
Mark de Berg
,
Otfried Cheong
,
Herman Haverkort
,
Jung Gun Lim
,
Laura Toma
Lecture Notes in Computer Science
4619
, 2007, pp. 239-250
I/O-efficient map overlay and point location in low-density subdivisions
Mark de Berg
,
Herman Haverkort
,
Shripad Thite
,
Laura Toma
Lecture Notes in Computer Science
4835
, 2007, pp. 500-511
Computing all immobilizing grasps of a simple polygon with few contacts
Jae-Sook Cheong
,
Herman J. Haverkort
,
A. Frank van der Stappen
Algorithmica
44
(2), 2006, pp. 117-136
Sparse geometric graphs with small dilation
Boris Aronov
,
Mark de Berg
,
Otfried Cheong
,
Joachim Gudmundsson
,
Herman Haverkort
,
Antoine Vigneron
Lecture Notes in Computer Science
3827
, 2005, pp. 50-59
Multiple polyline to polygon matching
Mirela Tȃnase
,
Remco C. Veltkamp
,
Herman Haverkort
Lecture Notes in Computer Science
3827
, 2005, pp. 60-70
Efficient
c
-oriented range searching with DOP-trees
Mark de Berg
,
Herman Haverkort
,
Micha Streppel
Lecture Notes in Computer Science
3669
, 2005, pp. 508-519
On computing all immobilizing grasps of a simple polygon with few contacts
Jae-Sook Cheong
,
Herman J. Haverkort
,
A. Frank van der Stappen
Lecture Notes in Computer Science
2906
, 2003, pp. 260-269
Significant-presence range queries in categorical data
Mark de Berg
,
Herman J. Haverkort
Lecture Notes in Computer Science
2748
, 2003, pp. 462-473