Optimal Dynamic Solutions for Fixed Windowing Problems. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (SCG, 1986)

Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse. - Rolf Klein (Angew. Inform., 1986)

On the Minimality of K, F and D or: Why Löten is Non-Trivial. - Anne Brüggemann-Klein; Rolf Klein (Computation Theory and Logic, 1987)

A Sweepcircle Algorithm for Voronoi Diagrams. - Frank K. H. A. Dehne; Rolf Klein (WG, 1987)

Priority Search Trees in Secondary Memory (Extended Abstract). - Christian Icking; Rolf Klein; Thomas Ottmann (WG, 1987)

The Node Visit Cost of Brother Trees - Rolf Klein; Derick Wood (Inf. Comput., 1987)

On the Maximum Path Length of AVL Trees. - Rolf Klein; Derick Wood (CAAP, 1988)

Abstract Voronoi Diagrams and their Applications. - Rolf Klein (Workshop on Computational Geometry, 1988)

Voronoi Diagrams Based on General Metrics in the Plane. - Rolf Klein; Derick Wood (STACS, 1988)

Voronoi Diagrams in the Moscow Metric (Extended Abstract). - Rolf Klein (WG, 1988)

Concrete and Abstract Voronoi Diagrams - Rolf Klein (Springer, 1989)

On Binary Trees. - Rolf Klein; Derick Wood (IFIP Congress, 1989)

Combinatorial Properties of Abstract Voronoi Diagrams. - Rolf Klein (WG, 1989)

A Dynamic Fixed Windowing Problem. - Rolf Klein; Otto Nurmi; Thomas Ottmann; Derick Wood (Algorithmica, 1989)

On the path length of binary trees. - Rolf Klein; Derick Wood (J. ACM, 1989)

On the Construction of Abstract Voronoi Diagrams, II. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (SIGAL International Symposium on Algorithms, 1990)

Binary Search Trees of Almost Optimal Height. - Arne Andersson; Christian Icking; Rolf Klein; Thomas Ottmann (Acta Informatica, 1990)

A Tight Upper Bound for the Path Length of AVL Trees. - Rolf Klein; Derick Wood (Theor. Comput. Sci., 1990)

Moving Along a Street. - Rolf Klein (Workshop on Computational Geometry, 1991)

Walking an Unknown Street with Bounded Detour. - Rolf Klein (Comput. Geom., 1991)

Randomized Incremental Construction of Abstract Voronoi Diagrams. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (Informatik, 1992)

The Two Guards Problem. - Christian Icking; Rolf Klein (Int. J. Comput. Geom. Appl., 1992)

How to Look Around a Corner. - Christian Icking; Rolf Klein; Lihong Ma 001 (CCCG, 1993)

A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. - Rolf Klein; Andrzej Lingas (CCCG, 1993)

Randomized Incremental Construction of Abstract Voronoi Diagrams. - Rolf Klein; Kurt Mehlhorn; Stefan Meiser (Comput. Geom., 1993)

Competitive Strategies for Autonomous Systems. - Christian Icking; Rolf Klein (Modelling and Planning for Sensor Based Intelligent Robot Systems, 1994)

Hamiltonian Abstract Voronoi Diagrams in Linear Time. - Rolf Klein; Andrzej Lingas (ISAAC, 1994)

Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (SCG, 1995)

Searching for the Kernel of a Polygon - A Competitive Strategy. - Christian Icking; Rolf Klein (SCG, 1995)

Fast Skeleton Construction. - Rolf Klein; Andrzej Lingas (ESA, 1995)

Convex Distance Functions in 3-Space are Different. - Christian Icking; Rolf Klein; Ngoc-Minh Lê; Lihong Ma 001 (Fundam. Informaticae, 1995)

Manhattonian proximity in a simple polygon. - Rolf Klein; Andrzej Lingas (Int. J. Comput. Geom. Appl., 1995)

Wrapping ellipses around a convex skeleton. - Rolf Klein; Lihong Ma 001 (Int. J. Comput. Math., 1995)

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. - Rolf Klein; Andrzej Lingas (Int. J. Comput. Geom. Appl., 1996)

Algorithmische Geometrie. - Rolf Klein (Addison-Wesley-Longman, 1997)

A Competitive Strategy for Learning a Polygon. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SODA, 1997)

"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. - Frank K. H. A. Dehne; Rolf Klein (Algorithmica, 1997)

A Combinatorial Property of Convex Sets. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (Discret. Comput. Geom., 1997)

A Component Architecture for Cross-media Formatters. - Thomas Bretthauer; Anne Brüggemann-Klein; Stefan Hermann; Rolf Klein (EP, 1998)

Moving an Angle Around a Region. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SWAT, 1998)

On bisectors for convex distance functions in 3-space. - Christian Icking; Rolf Klein; Ngoc-Minh Lê; Lihong Ma 001; Francisco Santos (CCCG, 1999)

An Optimal Competitive Strategy for Walking in Streets. - Christian Icking; Rolf Klein; Elmar Langetepe (STACS, 1999)

How to Find a Point on a Line Within a Fixed Distance. - Christoph A. Hipke; Christian Icking; Rolf Klein; Elmar Langetepe (Discret. Appl. Math., 1999)

BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Content-Based Relations. - Anne Brüggemann-Klein; Rolf Klein; Britta Landgraf (D Lib Mag., 1999)

Voronoi Diagrams. - Franz Aurenhammer; Rolf Klein (Handbook of Computational Geometry, 2000)

On the Competitive Complexity of Navigation Tasks. - Christian Icking; Thomas Kamphans; Rolf Klein; Elmar Langetepe (Sensor Based Intelligent Robots, 2000)

Exploring an Unknown Cellular Environment. - Christian Icking; Thomas Kamphans; Rolf Klein; Elmar Langetepe (EuroCG, 2000)

BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations. - Anne Brüggemann-Klein; Rolf Klein; Britta Landgraf (IV, 2000)

Solving Nonconvex Planar Location Problems by Finite Dominating Sets. - Emilio Carrizosa; Horst W. Hamacher; Rolf Klein; Stefan Nickel (J. Glob. Optim., 2000)

Smallest Color-Spanning Objects. - Manuel Abellanas; Ferran Hurtado; Christian Icking; Rolf Klein; Elmar Langetepe; Lihong Ma 001; Belén Palop; Vera Sacristán (ESA, 2001)

Generalized self-approaching curves. - Oswin Aichholzer; Franz Aurenhammer; Christian Icking; Rolf Klein; Elmar Langetepe; Günter Rote (Discret. Appl. Math., 2001)

On bisectors for different distance functions. - Christian Icking; Rolf Klein; Lihong Ma 001; Stefan Nickel; Ansgar Weißler (Discret. Appl. Math., 2001)

The Polygon Exploration Problem. - Frank Hoffmann 002; Christian Icking; Rolf Klein; Klaus Kriegel (SIAM J. Comput., 2001)

On the Pagination of Complex Documents. - Anne Brüggemann-Klein; Rolf Klein; Stefan Wohlfeil (Computer Science in Perspective, 2003)

Java Applets for the Dynamic Visualization of Voronoi Diagrams. - Christian Icking; Rolf Klein; Peter Köllner; Lihong Ma 001 (Computer Science in Perspective, 2003)

Voronoi Diagram for services neighboring a highway. - Manuel Abellanas; Ferran Hurtado; Vera Sacristán; Christian Icking; Lihong Ma 001; Rolf Klein; Elmar Langetepe; Belén Palop (Inf. Process. Lett., 2003)

Searching with an autonomous robot. - Sándor P. Fekete; Rolf Klein; Andreas Nüchter (SCG, 2004)

A fast algorithm for approximating the detour of a polygonal chain. - Annette Ebbers-Baumann; Rolf Klein; Elmar Langetepe; Andrzej Lingas (Comput. Geom., 2004)

The weighted farthest color Voronoi diagram on trees and graphs. - Ferran Hurtado; Rolf Klein; Elmar Langetepe; Vera Sacristán (Comput. Geom., 2004)

An Optimal Competitive Strategy for Walking in Streets. - Christian Icking; Rolf Klein; Elmar Langetepe; Sven Schuierer; Ines Semrau (SIAM J. Comput., 2004)

Exploring Simple Grid Polygons. - Christian Icking; Thomas Kamphans; Rolf Klein; Elmar Langetepe (COCOON, 2005)

Competitive online searching for a ray in the plane. - Andrea Eubeler; Rudolf Fleischer; Tom Kamphans; Rolf Klein; Elmar Langetepe; Gerhard Trippen (EuroCG, 2005)

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. - Rolf Klein; Christian Knauer; Giri Narasimhan; Michiel H. M. Smid (ISAAC, 2005)

On Geometric Dilation and Halving Chords. - Adrian Dumitrescu; Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Günter Rote (WADS, 2005)

Foreword. - Rolf Klein (Comput. Geom., 2005)

Maximizing a Voronoi Region: the Convex Case. - Frank K. H. A. Dehne; Rolf Klein; Raimund Seidel (Int. J. Comput. Geom. Appl., 2005)

How to Fit In Another Meeting. - Rolf Klein; Doron Nussbaum; Jörg-Rüdiger Sack; Jiehua Yi (CollaborateCom, 2006)

The density of iterated crossing points and a gap result for triangulations of finite point sets. - Rolf Klein; Martin Kutz (SCG, 2006)

06421 Executive Summary – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

06421 Abstracts Collection – Robot Navigation. - Sándor P. Fekete; Rudolf Fleischer; Rolf Klein; Alejandro López-Ortiz (Robot Navigation, 2006)

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. - Joachim Gudmundsson; Rolf Klein; Giri Narasimhan; Michiel H. M. Smid; Alexander Wolff 001 (Geometric Networks and Metric Space Embeddings, 2006)

Computing Geometric Minimum-Dilation Graphs Is NP-Hard. - Rolf Klein; Martin Kutz (GD, 2006)

The Geometric Dilation of Finite Point Sets. - Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein (Algorithmica, 2006)

Online searching with an autonomous robot. - Sándor P. Fekete; Rolf Klein; Andreas Nüchter (Comput. Geom., 2006)

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation. - Rolf Klein; Christos Levcopoulos; Andrzej Lingas (Comput. Geom., 2006)

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. - Xin Han; Kazuo Iwama; Rolf Klein; Andrzej Lingas (AAIM, 2007)

On the geometric dilation of closed curves, graphs, and point sets. - Adrian Dumitrescu; Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Günter Rote (Comput. Geom., 2007)

Geometric dilation of closed planar curves: New lower bounds. - Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein (Comput. Geom., 2007)

Embedding Point Sets into Plane Graphs of Small Dilation. - Annette Ebbers-Baumann; Ansgar Grüne; Rolf Klein; Marek Karpinski; Christian Knauer; Andrzej Lingas (Int. J. Comput. Geom. Appl., 2007)

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. - Pankaj K. Agarwal; Rolf Klein; Christian Knauer; Stefan Langerman; Pat Morin; Micha Sharir; Michael A. Soss (Discret. Comput. Geom., 2008)

Competitive Online Approximation of the Optimal Search Ratio. - Rudolf Fleischer; Thomas Kamphans; Rolf Klein; Elmar Langetepe; Gerhard Trippen (SIAM J. Comput., 2008)

Dilation of Geometric Networks. - Rolf Klein (Encyclopedia of Algorithms, 2008)

Geometric Dilation of Geometric Networks. - Rolf Klein (Encyclopedia of Algorithms, 2008)

Well Separated Pair Decomposition for Unit-Disk Graph. - Rolf Klein (Encyclopedia of Algorithms, 2008)

Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt. - Rolf Klein; Tom Kamphans (Taschenbuch der Algorithmen, 2008)

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. - Jérémy Barbay; Rolf Klein; Alejandro López-Ortiz; Rolf Niedermeier (Adaptive, Output Sensitive, Online and Parameterized Algorithms, 2009)

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. - Jérémy Barbay; Rolf Klein; Alejandro López-Ortiz; Rolf Niedermeier (Adaptive, Output Sensitive, Online and Parameterized Algorithms, 2009)

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. - Gautam Das 001; Joachim Gudmundsson; Rolf Klein; Christian Knauer; Michiel H. M. Smid (Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 2009)

New Results on Visibility in Simple Polygons. - Alexander Gilbers; Rolf Klein (WADS, 2009)

How Many Lions Are Needed to Clear a Grid? - Florian Berger; Alexander Gilbers; Ansgar Grüne; Rolf Klein (Algorithms, 2009)

On the dilation spectrum of paths, cycles, and trees. - Rolf Klein; Christian Knauer; Giri Narasimhan; Michiel H. M. Smid (Comput. Geom., 2009)

Abstract Voronoi diagrams revisited. - Rolf Klein; Elmar Langetepe; Zahra Nilforoushan (Comput. Geom., 2009)

A meeting scheduling problem respecting time and space. - Florian Berger; Rolf Klein; Doron Nussbaum; Jörg-Rüdiger Sack; Jiehua Yi (GeoInformatica, 2009)

A traveller's problem. - Florian Berger; Rolf Klein (SCG, 2010)

Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. - Ansgar Grüne; Tien-Ching Lin; Teng-Kai Yu; Rolf Klein; Elmar Langetepe; D. T. Lee; Sheung-Hung Poon (ISAAC (2), 2010)

Exploring Grid Polygons Online - Christian Icking; Tom Kamphans; Rolf Klein; Elmar Langetepe (CoRR, 2010)

Online algorithms for searching and exploration in the plane. - Subir Kumar Ghosh; Rolf Klein (Comput. Sci. Rev., 2010)

Computing Geometric Minimum-Dilation Graphs is NP-Hard. - Panos Giannopoulos; Rolf Klein; Christian Knauer; Martin Kutz; Dániel Marx (Int. J. Comput. Geom. Appl., 2010)

The Tourist in the Shopping Arcade. - Rudolf Fleischer; Tom Kamphans; Rolf Klein; Elmar Langetepe; Gerhard Trippen (J. Univers. Comput. Sci., 2010)

Pledge's Algorithm - How to Escape from a Dark Maze. - Rolf Klein; Tom Kamphans (Algorithms Unplugged, 2011)

Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains. - Thilo Beckmann; Rolf Klein; David Kriesel; Elmar Langetepe (SCG, 2011)

Tolerant Algorithms. - Rolf Klein; Rainer Penninger; Christian Sohler; David P. Woodruff (ESA, 2011)

Genotypic tropism testing by massively parallel sequencing: qualitative and quantitative analysis. - Martin Däumer; Rolf Kaiser; Rolf Klein; Thomas Lengauer; Bernhard Thiele; Alexander Thielen (BMC Medical Informatics Decis. Mak., 2011)

Optimally Solving a Transportation Problem Using Voronoi Diagrams. - Darius Geiß; Rolf Klein; Rainer Penninger (COCOON, 2012)

Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. - Christian Wulff-Nilsen; Ansgar Grüne; Rolf Klein; Elmar Langetepe; D. T. Lee; Tien-Ching Lin; Sheung-Hung Poon; Teng-Kai Yu (Int. J. Comput. Geom. Appl., 2012)

Voronoi Diagrams and Delaunay Triangulations. - Franz Aurenhammer; Rolf Klein; Der-Tsai Lee (World Scientific, 2013)

Optimally solving a transportation problem using Voronoi diagrams. - Darius Geiß; Rolf Klein; Rainer Penninger; Günter Rote (Comput. Geom., 2013)

Forest-Like Abstract Voronoi Diagrams in Linear Time. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (CCCG, 2014)

Reprint of: Optimally solving a transportation problem using Voronoi diagrams. - Darius Geiß; Rolf Klein; Rainer Penninger; Günter Rote (Comput. Geom., 2014)

A new upper bound for the VC-dimension of visibility regions. - Alexander Gilbers; Rolf Klein (Comput. Geom., 2014)

Guest Editors' Foreword. - Timothy M. Chan; Rolf Klein (Discret. Comput. Geom., 2014)

Abstract Voronoi Diagrams with Disconnected regions. - Cecilia Bohler; Rolf Klein (Int. J. Comput. Geom. Appl., 2014)

Editors' Foreword. - José Miguel Díaz-Báñez; Rolf Klein; Jorge Urrutia (Int. J. Comput. Geom. Appl., 2014)

A Fire Fighter's Problem. - Rolf Klein; Elmar Langetepe; Christos Levcopoulos (SoCG, 2015)

On the complexity of higher order abstract Voronoi diagrams. - Cecilia Bohler; Panagiotis Cheilaris; Rolf Klein; Chih-Hung Liu 001; Evanthia Papadopoulou; Maksym Zavershynskyi (Comput. Geom., 2015)

Guest Editor's foreword. - Timothy M. Chan; Rolf Klein (Comput. Geom., 2015)

Most Finite Point Sets in the Plane have Dilation > 1. - Rolf Klein; Martin Kutz; Rainer Penninger (Discret. Comput. Geom., 2015)

A local strategy for cleaning expanding cellular domains by simple robots. - Rolf Klein; David Kriesel; Elmar Langetepe (Theor. Comput. Sci., 2015)

Computational Geometry Column 63. - Rolf Klein; Elmar Langetepe (SIGACT News, 2016)

Abstract Voronoi Diagrams. - Rolf Klein (Encyclopedia of Algorithms, 2016)

Dilation of Geometric Networks. - Rolf Klein (Encyclopedia of Algorithms, 2016)

Geometric Dilation of Geometric Networks. - Rolf Klein (Encyclopedia of Algorithms, 2016)

Voronoi Diagrams and Delaunay Triangulations. - Rolf Klein (Encyclopedia of Algorithms, 2016)

Well Separated Pair Decomposition. - Rolf Klein (Encyclopedia of Algorithms, 2016)

Abstract Voronoi Diagrams from Closed Bisecting Curves. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (Int. J. Comput. Geom. Appl., 2017)

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. - Rolf Klein; Christos Levcopoulos; Andrzej Lingas (Algorithms, 2018)

Forest-like abstract Voronoi diagrams in linear time. - Cecilia Bohler; Rolf Klein; Andrzej Lingas; Chih-Hung Liu 001 (Comput. Geom., 2018)

Reversibility properties of the fire-fighting problem in graphs. - Rolf Klein (Comput. Geom., 2018)

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. - Cecilia Bohler; Rolf Klein; Chih-Hung Liu 001 (Algorithmica, 2019)

Partially walking a polygon. - Franz Aurenhammer; Michael Steinkogler; Rolf Klein (Comput. Geom., 2019)

On a Fire Fighter's Problem. - Rolf Klein; Elmar Langetepe; Barbara Schwarzwald; Christos Levcopoulos; Andrzej Lingas (Int. J. Found. Comput. Sci., 2019)

The geometric dilation of three points. - Annette Ebbers-Baumann; Rolf Klein; Christian Knauer; Günter Rote (J. Comput. Geom., 2019)

A New Model in Firefighting Theory. - Rolf Klein; David Kübel; Elmar Langetepe; Jörg-Rüdiger Sack; Barbara Schwarzwald (CALDAM, 2020)

Geometric firefighting in the half-plane. - Sang-Sub Kim 003; Rolf Klein; David Kübel; Elmar Langetepe; Barbara Schwarzwald (Comput. Geom., 2021)

Hyperbolae are the locus of constant angle difference. - Herman J. Haverkort; Rolf Klein (CoRR, 2021)

The limit of Lp Voronoi diagrams as p→0 is the bounding-box-area Voronoi diagram. - Herman J. Haverkort; Rolf Klein (CoRR, 2022)

A new model and algorithms in firefighting theory. - Rolf Klein; David Kübel; Elmar Langetepe; Jörg-Rüdiger Sack; Barbara Schwarzwald (Discret. Appl. Math., 2022)

The Limit of $$L_p$$ Voronoi Diagrams as $$p rightarrow 0$$ is the Bounding-Box-Area Voronoi Diagram. - Herman J. Haverkort; Rolf Klein (Discret. Comput. Geom., 2024)