Rolf Klein

According to our database1, Rolf Klein
  • authored at least 150 papers between 1986 and 2016.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2016
Well Separated Pair Decomposition.
Encyclopedia of Algorithms, 2016

Voronoi Diagrams and Delaunay Triangulations.
Encyclopedia of Algorithms, 2016

Geometric Dilation of Geometric Networks.
Encyclopedia of Algorithms, 2016

Dilation of Geometric Networks.
Encyclopedia of Algorithms, 2016

Abstract Voronoi Diagrams.
Encyclopedia of Algorithms, 2016

Computational Geometry Column 63.
SIGACT News, 2016

An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
A local strategy for cleaning expanding cellular domains by simple robots.
Theor. Comput. Sci., 2015

Most Finite Point Sets in the Plane have Dilation > 1.
Discrete & Computational Geometry, 2015

A local strategy for cleaning expanding cellular domains by simple robots.
CoRR, 2015

Guest Editor's foreword.
Comput. Geom., 2015

On the complexity of higher order abstract Voronoi diagrams.
Comput. Geom., 2015

A Fire Fighter's Problem.
Proceedings of the 31st International Symposium on Computational Geometry, 2015

2014
Editors' Foreword.
Int. J. Comput. Geometry Appl., 2014

Abstract Voronoi Diagrams with Disconnected regions.
Int. J. Comput. Geometry Appl., 2014

Guest Editors' Foreword.
Discrete & Computational Geometry, 2014

A Fire Fighter's Problem.
CoRR, 2014

A new upper bound for the VC-dimension of visibility regions.
Comput. Geom., 2014

Reprint of: Optimally solving a transportation problem using Voronoi diagrams.
Comput. Geom., 2014

Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems.
Proceedings of the LATIN 2014: Theoretical Informatics - 11th Latin American Symposium, Montevideo, Uruguay, March 31, 2014

Forest-Like Abstract Voronoi Diagrams in Linear Time.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

2013
Optimally solving a transportation problem using Voronoi diagrams.
Comput. Geom., 2013

Abstract Voronoi Diagrams with Disconnected Regions.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

On the Complexity of Higher Order Abstract Voronoi Diagrams.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

Voronoi Diagrams and Delaunay Triangulations.
World Scientific, ISBN: 978-981-4447-63-8, 2013

2012
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space.
Int. J. Comput. Geometry Appl., 2012

A New Upper Bound for the VC-Dimension of Visibility Regions
CoRR, 2012

Optimally Solving a Transportation Problem Using Voronoi Diagrams.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

2011
Genotypic tropism testing by massively parallel sequencing: qualitative and quantitative analysis.
BMC Med. Inf. & Decision Making, 2011

Tolerant Algorithms.
Proceedings of the Algorithms - ESA 2011, 2011

A new upper bound for the VC-dimension of visibility regions.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains.
Proceedings of the 27th ACM Symposium on Computational Geometry, 2011

Pledge's Algorithm - How to Escape from a Dark Maze.
Proceedings of the Algorithms Unplugged, 2011

2010
The Tourist in the Shopping Arcade.
J. UCS, 2010

Computing Geometric Minimum-Dilation Graphs is NP-Hard.
Int. J. Comput. Geometry Appl., 2010

Online algorithms for searching and exploration in the plane.
Computer Science Review, 2010

Exploring Grid Polygons Online
CoRR, 2010

Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane.
Proceedings of the Algorithms and Computation - 21st International Symposium, 2010

A traveller's problem.
Proceedings of the 26th ACM Symposium on Computational Geometry, 2010

2009
A meeting scheduling problem respecting time and space.
GeoInformatica, 2009

Abstract Voronoi diagrams revisited.
Comput. Geom., 2009

On the dilation spectrum of paths, cycles, and trees.
Comput. Geom., 2009

How Many Lions Are Needed to Clear a Grid?
Algorithms, 2009

New Results on Visibility in Simple Polygons.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining.
Proceedings of the Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11., 2009

09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms.
Proceedings of the Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04., 2009

2008
Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt.
Proceedings of the Taschenbuch der Algorithmen, 2008

Well Separated Pair Decomposition for Unit-Disk Graph.
Proceedings of the Encyclopedia of Algorithms, 2008

Geometric Dilation of Geometric Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Dilation of Geometric Networks.
Proceedings of the Encyclopedia of Algorithms, 2008

Competitive Online Approximation of the Optimal Search Ratio.
SIAM J. Comput., 2008

Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D.
Discrete & Computational Geometry, 2008

A Meeting Scheduling Problem Respecting Time and Space.
Proceedings of the Algorithmic Aspects in Information and Management, 2008

2007
Embedding Point Sets into Plane Graphs of Small Dilation.
Int. J. Comput. Geometry Appl., 2007

Geometric dilation of closed planar curves: New lower bounds.
Comput. Geom., 2007

On the geometric dilation of closed curves, graphs, and point sets.
Comput. Geom., 2007

Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs.
Proceedings of the Algorithmic Aspects in Information and Management, 2007

2006
The density of iterated crossing points and a gap result for triangulations of finite point sets
CoRR, 2006

A PTAS for minimum vertex dilation triangulation of a simple polygon with a constant number of sources of dilation.
Comput. Geom., 2006

Online searching with an autonomous robot.
Comput. Geom., 2006

The Geometric Dilation of Finite Point Sets.
Algorithmica, 2006

Computing Geometric Minimum-Dilation Graphs Is NP-Hard.
Proceedings of the Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, 2006

06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings.
Proceedings of the Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006, 2006

06421 Abstracts Collection -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

06421 Executive Summary -- Robot Navigation.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

Competitive Online Searching for a Ray in the Plane.
Proceedings of the Robot Navigation, 15.10. - 20.10.2006, 2006

The density of iterated crossing points and a gap result for triangulations of finite point sets.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

How to Fit In Another Meeting.
Proceedings of the 2nd International ICST Conference on Collaborative Computing: Networking, 2006

2005
Maximizing a Voronoi Region: the Convex Case.
Int. J. Comput. Geometry Appl., 2005

Foreword.
Comput. Geom., 2005

On Geometric Dilation and Halving Chords.
Proceedings of the Algorithms and Data Structures, 9th International Workshop, 2005

Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Embedding Point Sets into Plane Graphs of Small Dilation.
Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Competitive online searching for a ray in the plane.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Searching with an Autonomous Robot.
Proceedings of the Algorithms for Optimization with Incomplete Information, 2005

Exploring Simple Grid Polygons.
Proceedings of the Computing and Combinatorics, 11th Annual International Conference, 2005

2004
An Optimal Competitive Strategy for Walking in Streets.
SIAM J. Comput., 2004

Online Searching with an Autonomous Robot
CoRR, 2004

The weighted farthest color Voronoi diagram on trees and graphs.
Comput. Geom., 2004

A fast algorithm for approximating the detour of a polygonal chain.
Comput. Geom., 2004

Online Searching with an Autonomous Robot.
Proceedings of the Algorithmic Foundations of Robotics VI, 2004

Competitive Online Approximation of the Optimal Search Ratio.
Proceedings of the Algorithms, 2004

Searching with an autonomous robot.
Proceedings of the 20th ACM Symposium on Computational Geometry, 2004

2003
Voronoi Diagram for services neighboring a highway.
Inf. Process. Lett., 2003

On the Geometric Dilation of Finite Point Sets.
Proceedings of the Algorithms and Computation, 14th International Symposium, 2003

Java Applets for the Dynamic Visualization of Voronoi Diagrams.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

On the Pagination of Complex Documents.
Proceedings of the Computer Science in Perspective, Essays Dedicated to Thomas Ottmann, 2003

2002
Maximizing a Voronoi Region: The Convex Case.
Proceedings of the Algorithms and Computation, 13th International Symposium, 2002

2001
The Polygon Exploration Problem.
SIAM J. Comput., 2001

On bisectors for different distance functions.
Discrete Applied Mathematics, 2001

Generalized self-approaching curves.
Discrete Applied Mathematics, 2001

A Fast Algorithm for Approximating the Detour of a Polygonal Chain.
Proceedings of the Algorithms, 2001

Smallest Color-Spanning Objects.
Proceedings of the Algorithms, 2001

2000
Solving Nonconvex Planar Location Problems by Finite Dominating Sets.
J. Global Optimization, 2000

BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations.
Proceedings of the International Conference on Information Visualisation, 2000

Exploring an Unknown Cellular Environment.
EuroCG, 2000

On the Competitive Complexity of Navigation Tasks.
Proceedings of the Sensor Based Intelligent Robots, 2000

1999
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Content-Based Relations.
D-Lib Magazine, 1999

How to Find a Point on a Line Within a Fixed Distance.
Discrete Applied Mathematics, 1999

An Optimal Competitive Strategy for Walking in Streets.
Proceedings of the STACS 99, 1999

On Bisectors for Different Distance Functions.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

On bisectors for convex distance functions in 3-space.
Proceedings of the 11th Canadian Conference on Computational Geometry, 1999

1998
Moving an Angle Around a Region.
Proceedings of the Algorithm Theory, 1998

Generalized Self-Approaching Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

A Component Architecture for Cross-media Formatters.
Proceedings of the Electronic Publishing, 1998

1997
A Combinatorial Property of Convex Sets.
Discrete & Computational Geometry, 1997

"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
Algorithmica, 1997

A Competitive Strategy for Learning a Polygon.
Proceedings of the Eighth Annual ACM-SIAM Symposium on Discrete Algorithms, 1997

Algorithmische Geometrie.
Addison-Wesley-Longman, ISBN: 978-3-8273-1111-5, 1997

1996
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Int. J. Comput. Geometry Appl., 1996

1995
Manhattonian proximity in a simple polygon.
Int. J. Comput. Geometry Appl., 1995

Convex Distance Functions in 3-Space are Different.
Fundam. Inform., 1995

Fast Skeleton Construction.
Proceedings of the Algorithms, 1995

Searching for the Kernel of a Polygon - A Competitive Strategy.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams.
Proceedings of the Mathematical Foundations of Computer Science 1994, 1994

Hamiltonian Abstract Voronoi Diagrams in Linear Time.
Proceedings of the Algorithms and Computation, 5th International Symposium, 1994

Competitive Strategies for Autonomous Systems.
Proceedings of the Modelling and Planning for Sensor Based Intelligent Robot Systems [Dagstuhl Workshop, 1994

1993
Randomized Incremental Construction of Abstract Voronoi Diagrams.
Comput. Geom., 1993

A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

Convex Distance Functions in 3-Space are Different.
Proceedings of the Ninth Annual Symposium on Computational GeometrySan Diego, 1993

A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

How to Look Around a Corner.
Proceedings of the 5th Canadian Conference on Computational Geometry, 1993

1992
The Two Guards Problem.
Int. J. Comput. Geometry Appl., 1992

Manhattonian Proximity in a Simple Polygon.
Proceedings of the Eighth Annual Symposium on Computational Geometry, 1992

1991
Walking an Unknown Street with Bounded Detour.
Comput. Geom., 1991

Walking an Unknown Street with Bounded Detour
Proceedings of the 32nd Annual Symposium on Foundations of Computer Science, 1991

The Two Guards Problem.
Proceedings of the Seventh Annual Symposium on Computational Geometry, 1991

Moving Along a Street.
Proceedings of the Computational Geometry, 1991

1990
A Tight Upper Bound for the Path Length of AVL Trees.
Theor. Comput. Sci., 1990

Binary Search Trees of Almost Optimal Height.
Acta Inf., 1990

On the Construction of Abstract Voronoi Diagrams, II.
Proceedings of the Algorithms, 1990

1989
On the path length of binary trees.
J. ACM, 1989

A Dynamic Fixed Windowing Problem.
Algorithmica, 1989

Combinatorial Properties of Abstract Voronoi Diagrams.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1989

On Binary Trees.
IFIP Congress, 1989

The Path Length of Binary Trees.
Proceedings of the Foundations of Data Organization and Algorithms, 1989

Concrete and Abstract Voronoi Diagrams
Lecture Notes in Computer Science 400, Springer, ISBN: 3-540-52055-4, 1989

1988
Voronoi Diagrams in the Moscow Metric (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, 1988

Voronoi Diagrams Based on General Metrics in the Plane.
Proceedings of the STACS 88, 1988

Abstract Voronoi Diagrams and their Applications.
Proceedings of the Computational Geometry and its Applications, 1988

On the Maximum Path Length of AVL Trees.
Proceedings of the CAAP '88, 1988

1987
The Node Visit Cost of Brother Trees
Inf. Comput., November, 1987

Priority Search Trees in Secondary Memory (Extended Abstract).
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

A Sweepcircle Algorithm for Voronoi Diagrams.
Proceedings of the Graph-Theoretic Concepts in Computer Science, International Workshop, 1987

On the Minimality of K, F and D or: Why Löten is Non-Trivial.
Proceedings of the Computation Theory and Logic, In Memory of Dieter Rödding, 1987

1986
Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse.
Angewandte Informatik, 1986

The Node Visit Cost of Brother Trees.
Proceedings of the Graphtheoretic Concepts in Computer Science, International Workshop, 1986

Optimal Dynamic Solutions for Fixed Windowing Problems.
Proceedings of the Second Annual ACM SIGACT/SIGGRAPH Symposium on Computational Geometry, 1986


  Loading...