 | 2009 |
|---|
| 104 |       | Alexander Gilbers,
Rolf Klein:
New Results on Visibility in Simple Polygons.
WADS 2009: 327-338 |
| 103 | | Florian Berger,
Rolf Klein,
Doron Nussbaum,
Jörg-Rüdiger Sack,
Jiehua Yi:
A meeting scheduling problem respecting time and space.
GeoInformatica 13(4): 453-481 (2009) |
| 2008 |
|---|
| 102 | | Florian Berger,
Rolf Klein,
Doron Nussbaum,
Jörg-Rüdiger Sack,
Jiehua Yi:
A Meeting Scheduling Problem Respecting Time and Space.
AAIM 2008: 50-59 |
| 101 | | Rolf Klein:
Dilation of Geometric Networks.
Encyclopedia of Algorithms 2008 |
| 100 | | Rolf Klein:
Geometric Dilation of Geometric Networks.
Encyclopedia of Algorithms 2008 |
| 99 | | Rolf Klein:
Well Separated Pair Decomposition for Unit-Disk Graph.
Encyclopedia of Algorithms 2008 |
| 98 | | Rolf Klein,
Tom Kamphans:
Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt.
Taschenbuch der Algorithmen 2008: 75-81 |
| 97 | | Pankaj K. Agarwal,
Rolf Klein,
Christian Knauer,
Stefan Langerman,
Pat Morin,
Micha Sharir,
Michael A. Soss:
Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry 39(1-3): 17-37 (2008) |
| 96 | | Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput. 38(3): 881-898 (2008) |
| 2007 |
|---|
| 95 |  | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 94 | | Joachim Gudmundsson,
Rolf Klein,
Giri Narasimhan,
Michiel H. M. Smid,
Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006
Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 |
| 93 | | Xin Han,
Kazuo Iwama,
Rolf Klein,
Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
AAIM 2007: 337-345 |
| 92 | | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom. 36(1): 16-38 (2007) |
| 91 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein:
Geometric dilation of closed planar curves: New lower bounds.
Comput. Geom. 37(3): 188-208 (2007) |
| 90 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Marek Karpinski,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geometry Appl. 17(3): 201-230 (2007) |
| 2006 |
|---|
| 89 | | Joachim Gudmundsson,
Rolf Klein,
Giri Narasimhan,
Michiel H. M. Smid,
Alexander Wolff:
06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Geometric Networks and Metric Space Embeddings 2006 |
| 88 | | Rolf Klein,
Martin Kutz:
Computing Geometric Minimum-Dilation Graphs Is NP-Hard.
Graph Drawing 2006: 196-207 |
| 87 | | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation.
Robot Navigation 2006 |
| 86 | | Sándor P. Fekete,
Rudolf Fleischer,
Rolf Klein,
Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation.
Robot Navigation 2006 |
| 85 | | Andrea Eubeler,
Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane.
Robot Navigation 2006 |
| 84 | | Rolf Klein,
Martin Kutz:
The density of iterated crossing points and a gap result for triangulations of finite point sets.
Symposium on Computational Geometry 2006: 264-272 |
| 83 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein:
The Geometric Dilation of Finite Point Sets.
Algorithmica 44(2): 137-149 (2006) |
| 82 | | Rolf Klein,
Martin Kutz:
The density of iterated crossing points and a gap result for triangulations of finite point sets
CoRR abs/cs/0601033: (2006) |
| 81 | | Rolf Klein,
Christos Levcopoulos,
Andrzej Lingas:
A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom. 34(1): 28-34 (2006) |
| 80 | | Sándor P. Fekete,
Rolf Klein,
Andreas Nüchter:
Online searching with an autonomous robot.
Comput. Geom. 34(2): 102-115 (2006) |
| 2005 |
|---|
| 79 | | Sándor P. Fekete,
Rolf Klein,
Andreas Nüchter:
Searching with an Autonomous Robot.
Algorithms for Optimization with Incomplete Information 2005 |
| 78 | | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring Simple Grid Polygons.
COCOON 2005: 524-533 |
| 77 | | Andrea Eubeler,
Rudolf Fleischer,
Tom Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive online searching for a ray in the plane.
EuroCG 2005: 107-110 |
| 76 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Marek Karpinski,
Rolf Klein,
Christian Knauer,
Andrzej Lingas:
Embedding Point Sets into Plane Graphs of Small Dilation.
ISAAC 2005: 5-16 |
| 75 | | Rolf Klein,
Christian Knauer,
Giri Narasimhan,
Michiel H. M. Smid:
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
ISAAC 2005: 849-858 |
| 74 | | Adrian Dumitrescu,
Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein,
Günter Rote:
On Geometric Dilation and Halving Chords.
WADS 2005: 244-255 |
| 73 | | Rolf Klein:
Foreword.
Comput. Geom. 30(2): 79- (2005) |
| 72 | | Frank K. H. A. Dehne,
Rolf Klein,
Raimund Seidel:
Maximizing a Voronoi Region: the Convex Case.
Int. J. Comput. Geometry Appl. 15(5): 463-476 (2005) |
| 2004 |
|---|
| 71 | | Rudolf Fleischer,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe,
Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio.
ESA 2004: 335-346 |
| 70 | | Sándor P. Fekete,
Rolf Klein,
Andreas Nüchter:
Searching with an autonomous robot.
Symposium on Computational Geometry 2004: 449-450 |
| 69 | | Sándor P. Fekete,
Rolf Klein,
Andreas Nüchter:
Online Searching with an Autonomous Robot
CoRR cs.RO/0404036: (2004) |
| 68 | | Ferran Hurtado,
Rolf Klein,
Elmar Langetepe,
Vera Sacristan:
The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom. 27(1): 13-26 (2004) |
| 67 | | Annette Ebbers-Baumann,
Rolf Klein,
Elmar Langetepe,
Andrzej Lingas:
A fast algorithm for approximating the detour of a polygonal chain.
Comput. Geom. 27(2): 123-134 (2004) |
| 66 | | Christian Icking,
Rolf Klein,
Elmar Langetepe,
Sven Schuierer,
Ines Semrau:
An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput. 33(2): 462-486 (2004) |
| 2003 |
|---|
| 65 | | Rolf Klein,
Hans-Werner Six,
Lutz Michael Wegner:
Computer Science in Perspective, Essays Dedicated to Thomas Ottmann
Springer 2003 |
| 64 | | Christian Icking,
Rolf Klein,
Peter Köllner,
Lihong Ma:
Java Applets for the Dynamic Visualization of Voronoi Diagrams.
Computer Science in Perspective 2003: 191-205 |
| 63 | | Anne Brüggemann-Klein,
Rolf Klein,
Stefan Wohlfeil:
On the Pagination of Complex Documents.
Computer Science in Perspective 2003: 49-68 |
| 62 | | Annette Ebbers-Baumann,
Ansgar Grüne,
Rolf Klein:
On the Geometric Dilation of Finite Point Sets.
ISAAC 2003: 250-259 |
| 61 | | Manuel Abellanas,
Ferran Hurtado,
Vera Sacristan,
Christian Icking,
Lihong Ma,
Rolf Klein,
Elmar Langetepe,
Belén Palop:
Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett. 86(5): 283-288 (2003) |
| 2002 |
|---|
| 60 | | Gregory D. Hager,
Henrik I. Christensen,
Horst Bunke,
Rolf Klein:
Sensor Based Intelligent Robots, International Workshop, Dagstuhl Castle, Germany, October 15-20, 2000, Selected Revised Papers
Springer 2002 |
| 59 | | Frank K. H. A. Dehne,
Rolf Klein,
Raimund Seidel:
Maximizing a Voronoi Region: The Convex Case.
ISAAC 2002: 624-634 |
| 2001 |
|---|
| 58 | | Manuel Abellanas,
Ferran Hurtado,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Lihong Ma,
Belén Palop,
Vera Sacristan:
Smallest Color-Spanning Objects.
ESA 2001: 278-289 |
| 57 | | Annette Ebbers-Baumann,
Rolf Klein,
Elmar Langetepe,
Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain.
ESA 2001: 321-332 |
| 56 | | Christian Icking,
Rolf Klein,
Lihong Ma,
Stefan Nickel,
Ansgar Weißler:
On bisectors for different distance functions.
Discrete Applied Mathematics 109(1-2): 139-161 (2001) |
| 55 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized self-approaching curves.
Discrete Applied Mathematics 109(1-2): 3-24 (2001) |
| 54 | | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
The Polygon Exploration Problem.
SIAM J. Comput. 31(2): 577-600 (2001) |
| 2000 |
|---|
| 53 | | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
Exploring an Unknown Cellular Environment.
EuroCG 2000: 140-143 |
| 52 | | Anne Brüggemann-Klein,
Rolf Klein,
Britta Landgraf:
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations.
IV 2000: 19-24 |
| 51 | | Christian Icking,
Thomas Kamphans,
Rolf Klein,
Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks.
Sensor Based Intelligent Robots 2000: 245-258 |
| 1999 |
|---|
| 50 | | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma,
Francisco Santos:
On bisectors for convex distance functions in 3-space.
CCCG 1999 |
| 49 | | Christian Icking,
Rolf Klein,
Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets.
STACS 1999: 110-120 |
| 48 | | Christian Icking,
Rolf Klein,
Lihong Ma,
Stefan Nickel,
Ansgar Weißler:
On Bisectors for Different Distance Functions.
Symposium on Computational Geometry 1999: 291-299 |
| 47 | | Christoph A. Hipke,
Christian Icking,
Rolf Klein,
Elmar Langetepe:
How to Find a Point on a Line Within a Fixed Distance.
Discrete Applied Mathematics 93(1): 67-73 (1999) |
| 1998 |
|---|
| 46 | | Thomas Bretthauer,
Anne Brüggemann-Klein,
Stefan Hermann,
Rolf Klein:
A Component Architecture for Cross-media Formatters.
EP 1998: 444-453 |
| 45 | | Oswin Aichholzer,
Franz Aurenhammer,
Christian Icking,
Rolf Klein,
Elmar Langetepe,
Günter Rote:
Generalized Self-Approaching Curves.
ISAAC 1998: 317-326 |
| 44 | | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
Moving an Angle Around a Region.
SWAT 1998: 71-82 |
| 1997 |
|---|
| 43 | | Frank Hoffmann,
Christian Icking,
Rolf Klein,
Klaus Kriegel:
A Competitive Strategy for Learning a Polygon.
SODA 1997: 166-174 |
| 42 | | Frank K. H. A. Dehne,
Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
Algorithmica 17(1): 19-32 (1997) |
| 41 | | Manuel Abellanas,
Gregorio Hernández-Peñalver,
Rolf Klein,
Victor Neumann-Lara,
Jorge Urrutia:
A Combinatorial Property of Convex Sets.
Discrete & Computational Geometry 17(3): 307-318 (1997) |
| 1996 |
|---|
| 40 | | Rolf Klein,
Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Int. J. Comput. Geometry Appl. 6(3): 263-278 (1996) |
| 1995 |
|---|
| 39 | | Rolf Klein,
Andrzej Lingas:
Fast Skeleton Construction.
ESA 1995: 582-595 |
| 38 | | Christian Icking,
Rolf Klein:
Searching for the Kernel of a Polygon - A Competitive Strategy.
Symposium on Computational Geometry 1995: 258-266 |
| 37 | | Manuel Abellanas,
Gregorio Hernández-Peñalver,
Rolf Klein,
Victor Neumann-Lara,
Jorge Urrutia:
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.
Symposium on Computational Geometry 1995: 71-78 |
| 36 | | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma:
Convex Distance Functions in 3-Space are Different.
Fundam. Inform. 22(4): 331-352 (1995) |
| 35 | | Rolf Klein,
Andrzej Lingas:
Manhattonian proximity in a simple polygon.
Int. J. Comput. Geometry Appl. 5: 53-74 (1995) |
| 1994 |
|---|
| 34 | | Rolf Klein,
Andrzej Lingas:
Hamiltonian Abstract Voronoi Diagrams in Linear Time.
ISAAC 1994: 11-19 |
| 33 | | Frank K. H. A. Dehne,
Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
MFCS 1994: 296-305 |
| 32 | | Christian Icking,
Rolf Klein:
Competitive Strategies for Autonomous Systems.
Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 23-40 |
| 1993 |
|---|
| 31 | | Rolf Klein,
Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
CCCG 1993: 370-374 |
| 30 | | Christian Icking,
Rolf Klein,
Lihong Ma:
How to Look Around a Corner.
CCCG 1993: 443-448 |
| 29 | | Christian Icking,
Rolf Klein,
Ngoc-Minh Lê,
Lihong Ma:
Convex Distance Functions in 3-Space are Different.
Symposium on Computational Geometry 1993: 116-123 |
| 28 | | Rolf Klein,
Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Symposium on Computational Geometry 1993: 124-132 |
| 27 | | Rolf Klein,
Kurt Mehlhorn,
Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams.
Comput. Geom. 3: 157-184 (1993) |
| 1992 |
|---|
| 26 | | Rolf Klein,
Andrzej Lingas:
Manhattonian Proximity in a Simple Polygon.
Symposium on Computational Geometry 1992: 312-319 |
| 25 | | Christian Icking,
Rolf Klein:
The Two Guards Problem.
Int. J. Comput. Geometry Appl. 2(3): 257-285 (1992) |
| 1991 |
|---|
| 24 | | Rolf Klein:
Walking an Unknown Street with Bounded Detour
FOCS 1991: 304-313 |
| 23 | | Christian Icking,
Rolf Klein:
The Two Guards Problem.
Symposium on Computational Geometry 1991: 166-175 |
| 22 | | Rolf Klein:
Moving Along a Street.
Workshop on Computational Geometry 1991: 123-140 |
| 21 | | Rolf Klein:
Walking an Unknown Street with Bounded Detour.
Comput. Geom. 1: 325-351 (1991) |
| 1990 |
|---|
| 20 | | Rolf Klein,
Kurt Mehlhorn,
Stefan Meiser:
On the Construction of Abstract Voronoi Diagrams, II.
SIGAL International Symposium on Algorithms 1990: 138-154 |
| 19 | | Arne Andersson,
Christian Icking,
Rolf Klein,
Thomas Ottmann:
Binary Search Trees of Almost Optimal Height.
Acta Inf. 28(2): 165-178 (1990) |
| 18 | | Rolf Klein,
Derick Wood:
A Tight Upper Bound for the Path Length of AVL Trees.
Theor. Comput. Sci. 72(2&3): 251-264 (1990) |
| 1989 |
|---|
| 17 | | Rolf Klein:
Concrete and Abstract Voronoi Diagrams
Springer 1989 |
| 16 | | Rolf Klein,
Derick Wood:
The Path Length of Binary Trees.
FODO 1989: 128-136 |
| 15 | | Rolf Klein,
Derick Wood:
On Binary Trees.
IFIP Congress 1989: 449-454 |
| 14 | | Rolf Klein:
Combinatorial Properties of Abstract Voronoi Diagrams.
WG 1989: 356-369 |
| 13 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
A Dynamic Fixed Windowing Problem.
Algorithmica 4(4): 535-550 (1989) |
| 12 | | Rolf Klein,
Derick Wood:
On the path length of binary trees.
J. ACM 36(2): 280-289 (1989) |
| 1988 |
|---|
| 11 | | Rolf Klein,
Derick Wood:
On the Maximum Path Length of AVL Trees.
CAAP 1988: 16-27 |
| 10 | | Rolf Klein,
Derick Wood:
Voronoi Diagrams Based on General Metrics in the Plane.
STACS 1988: 281-291 |
| 9 | | Rolf Klein:
Voronoi Diagrams in the Moscow Metric (Extended Abstract).
WG 1988: 434-441 |
| 8 | | Rolf Klein:
Abstract Voronoi Diagrams and their Applications.
Workshop on Computational Geometry 1988: 148-157 |
| 1987 |
|---|
| 7 | | Anne Brüggemann-Klein,
Rolf Klein:
On the Minimality of K, F and D or: Why Löten is Non-Trivial.
Computation Theory and Logic 1987: 59-66 |
| 6 | | Frank K. H. A. Dehne,
Rolf Klein:
A Sweepcircle Algorithm for Voronoi Diagrams.
WG 1987: 59-83 |
| 5 | | Christian Icking,
Rolf Klein,
Thomas Ottmann:
Priority Search Trees in Secondary Memory (Extended Abstract).
WG 1987: 84-93 |
| 4 | | Rolf Klein,
Derick Wood:
The Node Visit Cost of Brother Trees
Inf. Comput. 75(2): 107-129 (1987) |
| 1986 |
|---|
| 3 | | Rolf Klein,
Otto Nurmi,
Thomas Ottmann,
Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems.
Symposium on Computational Geometry 1986: 109-115 |
| 2 | | Rolf Klein,
Derick Wood:
The Node Visit Cost of Brother Trees.
WG 1986: 106-117 |
| 1 | | Rolf Klein:
Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse.
Angewandte Informatik 28(1): 31-37 (1986) |
