Остановите войну!
for scientists:
default search action
Rolf Klein
Person information
- affiliation: University of Bonn, Germany
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Books and Theses
- 2013
- [b3]Franz Aurenhammer, Rolf Klein, Der-Tsai Lee:
Voronoi Diagrams and Delaunay Triangulations. World Scientific 2013, ISBN 978-981-4447-63-8, pp. I-VIII, 1-337 - 1997
- [b2]Rolf Klein:
Algorithmische Geometrie. Addison-Wesley-Longman 1997, ISBN 978-3-8273-1111-5, pp. I-X, 1-388 - 1989
- [b1]Rolf Klein:
Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science 400, Springer 1989, ISBN 3-540-52055-4
Journal Articles
- 2022
- [j65]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A new model and algorithms in firefighting theory. Discret. Appl. Math. 319: 296-309 (2022) - 2021
- [j64]Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
Geometric firefighting in the half-plane. Comput. Geom. 95: 101728 (2021) - 2019
- [j63]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. Algorithmica 81(6): 2317-2345 (2019) - [j62]Franz Aurenhammer, Michael Steinkogler, Rolf Klein:
Partially walking a polygon. Comput. Geom. 84: 3-11 (2019) - [j61]Rolf Klein, Elmar Langetepe, Barbara Schwarzwald, Christos Levcopoulos, Andrzej Lingas:
On a Fire Fighter's Problem. Int. J. Found. Comput. Sci. 30(2): 231-246 (2019) - [j60]Annette Ebbers-Baumann, Rolf Klein, Christian Knauer, Günter Rote:
The geometric dilation of three points. J. Comput. Geom. 10(1): 532-549 (2019) - 2018
- [j59]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. Algorithms 11(4): 45 (2018) - [j58]Rolf Klein:
Reversibility properties of the fire-fighting problem in graphs. Comput. Geom. 67: 38-41 (2018) - [j57]Cecilia Bohler, Rolf Klein, Andrzej Lingas, Chih-Hung Liu:
Forest-like abstract Voronoi diagrams in linear time. Comput. Geom. 68: 134-145 (2018) - 2017
- [j56]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
Abstract Voronoi Diagrams from Closed Bisecting Curves. Int. J. Comput. Geom. Appl. 27(3): 221-240 (2017) - 2016
- [j55]Rolf Klein, Elmar Langetepe:
Computational Geometry Column 63. SIGACT News 47(2): 34-39 (2016) - 2015
- [j54]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the complexity of higher order abstract Voronoi diagrams. Comput. Geom. 48(8): 539-551 (2015) - [j53]Timothy M. Chan, Rolf Klein:
Guest Editor's foreword. Comput. Geom. 48(8): 552-553 (2015) - [j52]Rolf Klein, Martin Kutz, Rainer Penninger:
Most Finite Point Sets in the Plane have Dilation > 1. Discret. Comput. Geom. 53(1): 80-106 (2015) - [j51]Rolf Klein, David Kriesel, Elmar Langetepe:
A local strategy for cleaning expanding cellular domains by simple robots. Theor. Comput. Sci. 605: 80-94 (2015) - 2014
- [j50]Alexander Gilbers, Rolf Klein:
A new upper bound for the VC-dimension of visibility regions. Comput. Geom. 47(1): 61-74 (2014) - [j49]Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Reprint of: Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. 47(3): 499-506 (2014) - [j48]Timothy M. Chan, Rolf Klein:
Guest Editors' Foreword. Discret. Comput. Geom. 52(3): 425-426 (2014) - [j47]José Miguel Díaz-Báñez, Rolf Klein, Jorge Urrutia:
Editors' Foreword. Int. J. Comput. Geom. Appl. 24(3): 173-176 (2014) - [j46]Cecilia Bohler, Rolf Klein:
Abstract Voronoi Diagrams with Disconnected regions. Int. J. Comput. Geom. Appl. 24(4): 347-372 (2014) - 2013
- [j45]Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote:
Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. 46(8): 1009-1016 (2013) - 2012
- [j44]Christian Wulff-Nilsen, Ansgar Grüne, Rolf Klein, Elmar Langetepe, D. T. Lee, Tien-Ching Lin, Sheung-Hung Poon, Teng-Kai Yu:
Computing the Stretch factor and Maximum Detour of Paths, Trees, and cycles in the normed Space. Int. J. Comput. Geom. Appl. 22(1): 45-60 (2012) - 2011
- [j43]Martin Däumer, Rolf Kaiser, Rolf Klein, Thomas Lengauer, Bernhard Thiele, Alexander Thielen:
Genotypic tropism testing by massively parallel sequencing: qualitative and quantitative analysis. BMC Medical Informatics Decis. Mak. 11: 30 (2011) - 2010
- [j42]Subir Kumar Ghosh, Rolf Klein:
Online algorithms for searching and exploration in the plane. Comput. Sci. Rev. 4(4): 189-201 (2010) - [j41]Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx:
Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geom. Appl. 20(2): 147-173 (2010) - [j40]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
The Tourist in the Shopping Arcade. J. Univers. Comput. Sci. 16(5): 676-685 (2010) - 2009
- [j39]Florian Berger, Alexander Gilbers, Ansgar Grüne, Rolf Klein:
How Many Lions Are Needed to Clear a Grid? Algorithms 2(3): 1069-1086 (2009) - [j38]Rolf Klein, Elmar Langetepe, Zahra Nilforoushan:
Abstract Voronoi diagrams revisited. Comput. Geom. 42(9): 885-902 (2009) - [j37]Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid:
On the dilation spectrum of paths, cycles, and trees. Comput. Geom. 42(9): 923-933 (2009) - [j36]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
- [j35]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. Discret. Comput. Geom. 39(1-3): 17-37 (2008) - [j34]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
- [j33]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) - [j32]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein:
Geometric dilation of closed planar curves: New lower bounds. Comput. Geom. 37(3): 188-208 (2007) - [j31]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. Geom. Appl. 17(3): 201-230 (2007) - 2006
- [j30]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein:
The Geometric Dilation of Finite Point Sets. Algorithmica 44(2): 137-149 (2006) - [j29]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) - [j28]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online searching with an autonomous robot. Comput. Geom. 34(2): 102-115 (2006) - 2005
- [j27]Rolf Klein:
Foreword. Comput. Geom. 30(2): 79 (2005) - [j26]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: the Convex Case. Int. J. Comput. Geom. Appl. 15(5): 463-476 (2005) - 2004
- [j25]Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán:
The weighted farthest color Voronoi diagram on trees and graphs. Comput. Geom. 27(1): 13-26 (2004) - [j24]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) - [j23]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
- [j22]Manuel Abellanas, Ferran Hurtado, Vera Sacristán, 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) - 2001
- [j21]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized self-approaching curves. Discret. Appl. Math. 109(1-2): 3-24 (2001) - [j20]Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler:
On bisectors for different distance functions. Discret. Appl. Math. 109(1-2): 139-161 (2001) - [j19]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
The Polygon Exploration Problem. SIAM J. Comput. 31(2): 577-600 (2001) - 2000
- [j18]Emilio Carrizosa, Horst W. Hamacher, Rolf Klein, Stefan Nickel:
Solving Nonconvex Planar Location Problems by Finite Dominating Sets. J. Glob. Optim. 18(2): 195-210 (2000) - 1999
- [j17]Christoph A. Hipke, Christian Icking, Rolf Klein, Elmar Langetepe:
How to Find a Point on a Line Within a Fixed Distance. Discret. Appl. Math. 93(1): 67-73 (1999) - [j16]Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf:
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Content-Based Relations. D Lib Mag. 5(11) (1999) - 1997
- [j15]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) - [j14]Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia:
A Combinatorial Property of Convex Sets. Discret. Comput. Geom. 17(3): 307-318 (1997) - 1996
- [j13]Rolf Klein, Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. Int. J. Comput. Geom. Appl. 6(3): 263-278 (1996) - 1995
- [j12]Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma:
Convex Distance Functions in 3-Space are Different. Fundam. Informaticae 22(4): 331-352 (1995) - [j11]Rolf Klein, Andrzej Lingas:
Manhattonian proximity in a simple polygon. Int. J. Comput. Geom. Appl. 5: 53-74 (1995) - [j10]Rolf Klein, Lihong Ma:
Wrapping ellipses around a convex skeleton. Int. J. Comput. Math. 55(3-4): 173-181 (1995) - 1993
- [j9]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. 3: 157-184 (1993) - 1992
- [j8]Christian Icking, Rolf Klein:
The Two Guards Problem. Int. J. Comput. Geom. Appl. 2(3): 257-285 (1992) - 1991
- [j7]Rolf Klein:
Walking an Unknown Street with Bounded Detour. Comput. Geom. 1: 325-351 (1991) - 1990
- [j6]Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann:
Binary Search Trees of Almost Optimal Height. Acta Informatica 28(2): 165-178 (1990) - [j5]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
- [j4]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989) - [j3]Rolf Klein, Derick Wood:
On the path length of binary trees. J. ACM 36(2): 280-289 (1989) - 1987
- [j2]Rolf Klein, Derick Wood:
The Node Visit Cost of Brother Trees. Inf. Comput. 75(2): 107-129 (1987) - 1986
- [j1]Rolf Klein:
Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse. Angew. Inform. 28(1): 31-37 (1986)
Conference and Workshop Papers
- 2020
- [c70]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CALDAM 2020: 371-383 - 2019
- [c69]Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
Geometric Firefighting in the Half-Plane. WADS 2019: 481-494 - 2018
- [c68]Franz Aurenhammer, Michael Steinkogler, Rolf Klein:
Partially Walking a Polygon. ISAAC 2018: 60:1-60:9 - 2016
- [c67]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams. SoCG 2016: 21:1-21:15 - 2015
- [c66]Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. SoCG 2015: 768-780 - 2014
- [c65]Cecilia Bohler, Rolf Klein, Chih-Hung Liu:
Forest-Like Abstract Voronoi Diagrams in Linear Time. CCCG 2014 - [c64]Rolf Klein, Christos Levcopoulos, Andrzej Lingas:
Approximation Algorithms for the Geometric Firefighter and Budget Fence Problems. LATIN 2014: 261-272 - 2013
- [c63]Cecilia Bohler, Panagiotis Cheilaris, Rolf Klein, Chih-Hung Liu, Evanthia Papadopoulou, Maksym Zavershynskyi:
On the Complexity of Higher Order Abstract Voronoi Diagrams. ICALP (1) 2013: 208-219 - [c62]Cecilia Bohler, Rolf Klein:
Abstract Voronoi Diagrams with Disconnected Regions. ISAAC 2013: 306-316 - 2012
- [c61]Darius Geiß, Rolf Klein, Rainer Penninger:
Optimally Solving a Transportation Problem Using Voronoi Diagrams. COCOON 2012: 264-274 - 2011
- [c60]Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe:
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains. SCG 2011: 287-288 - [c59]Alexander Gilbers, Rolf Klein:
A new upper bound for the VC-dimension of visibility regions. SCG 2011: 380-386 - [c58]Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff:
Tolerant Algorithms. ESA 2011: 736-747 - 2010
- [c57]Florian Berger, Rolf Klein:
A traveller's problem. SCG 2010: 176-182 - [c56]Ansgar Grüne, Tien-Ching Lin, Teng-Kai Yu, Rolf Klein, Elmar Langetepe, D. T. Lee, Sheung-Hung Poon:
Spanning Ratio and Maximum Detour of Rectilinear Paths in the L1 Plane. ISAAC (2) 2010: 121-131 - 2009
- [c55]Alexander Gilbers, Rolf Klein:
New Results on Visibility in Simple Polygons. WADS 2009: 327-338 - 2008
- [c54]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 - 2007
- [c53]Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas:
Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345 - 2006
- [c52]Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi:
How to Fit In Another Meeting. CollaborateCom 2006 - [c51]Rolf Klein, Martin Kutz:
The density of iterated crossing points and a gap result for triangulations of finite point sets. SCG 2006: 264-272 - [c50]Rolf Klein, Martin Kutz:
Computing Geometric Minimum-Dilation Graphs Is NP-Hard. GD 2006: 196-207 - 2005
- [c49]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Simple Grid Polygons. COCOON 2005: 524-533 - [c48]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 - [c47]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 - [c46]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote:
On Geometric Dilation and Halving Chords. WADS 2005: 244-255 - 2004
- [c45]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an autonomous robot. SCG 2004: 449-450 - [c44]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346 - [c43]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online Searching with an Autonomous Robot. WAFR 2004: 139-154 - 2003
- [c42]Anne Brüggemann-Klein, Rolf Klein, Stefan Wohlfeil:
On the Pagination of Complex Documents. Computer Science in Perspective 2003: 49-68 - [c41]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 - [c40]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein:
On the Geometric Dilation of Finite Point Sets. ISAAC 2003: 250-259 - 2002
- [c39]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel:
Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634 - 2001
- [c38]Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán:
Smallest Color-Spanning Objects. ESA 2001: 278-289 - [c37]Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas:
A Fast Algorithm for Approximating the Detour of a Polygonal Chain. ESA 2001: 321-332 - 2000
- [c36]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
On the Competitive Complexity of Navigation Tasks. Sensor Based Intelligent Robots 2000: 245-258 - [c35]Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf:
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations. IV 2000: 19-24 - 1999
- [c34]Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos:
On bisectors for convex distance functions in 3-space. CCCG 1999 - [c33]Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler:
On Bisectors for Different Distance Functions. SCG 1999: 291-299 - [c32]Christian Icking, Rolf Klein, Elmar Langetepe:
An Optimal Competitive Strategy for Walking in Streets. STACS 1999: 110-120 - 1998
- [c31]Thomas Bretthauer, Anne Brüggemann-Klein, Stefan Hermann, Rolf Klein:
A Component Architecture for Cross-media Formatters. EP 1998: 444-453 - [c30]Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote:
Generalized Self-Approaching Curves. ISAAC 1998: 317-326 - [c29]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
Moving an Angle Around a Region. SWAT 1998: 71-82 - 1997
- [c28]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel:
A Competitive Strategy for Learning a Polygon. SODA 1997: 166-174 - 1995
- [c27]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. SCG 1995: 71-78 - [c26]Christian Icking, Rolf Klein:
Searching for the Kernel of a Polygon - A Competitive Strategy. SCG 1995: 258-266 - [c25]Rolf Klein, Andrzej Lingas:
Fast Skeleton Construction. ESA 1995: 582-595 - 1994
- [c24]Christian Icking, Rolf Klein:
Competitive Strategies for Autonomous Systems. Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 23-40 - [c23]Rolf Klein, Andrzej Lingas:
Hamiltonian Abstract Voronoi Diagrams in Linear Time. ISAAC 1994: 11-19 - [c22]Frank K. H. A. Dehne, Rolf Klein:
"The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. MFCS 1994: 296-305 - 1993
- [c21]Rolf Klein, Andrzej Lingas:
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. CCCG 1993: 370-374 - [c20]Christian Icking, Rolf Klein, Lihong Ma:
How to Look Around a Corner. CCCG 1993: 443-448 - [c19]Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma:
Convex Distance Functions in 3-Space are Different. SCG 1993: 116-123 - [c18]Rolf Klein, Andrzej Lingas:
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. SCG 1993: 124-132 - 1992
- [c17]Rolf Klein, Andrzej Lingas:
Manhattonian Proximity in a Simple Polygon. SCG 1992: 312-319 - 1991
- [c16]Rolf Klein:
Moving Along a Street. Workshop on Computational Geometry 1991: 123-140 - [c15]Christian Icking, Rolf Klein:
The Two Guards Problem. SCG 1991: 166-175 - [c14]Rolf Klein:
Walking an Unknown Street with Bounded Detour. FOCS 1991: 304-313 - 1990
- [c13]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms 1990: 138-154 - 1989
- [c12]Rolf Klein, Derick Wood:
The Path Length of Binary Trees. FODO 1989: 128-136 - [c11]Rolf Klein, Derick Wood:
On Binary Trees. IFIP Congress 1989: 449-454 - [c10]Rolf Klein:
Combinatorial Properties of Abstract Voronoi Diagrams. WG 1989: 356-369 - 1988
- [c9]Rolf Klein, Derick Wood:
On the Maximum Path Length of AVL Trees. CAAP 1988: 16-27 - [c8]Rolf Klein:
Abstract Voronoi Diagrams and their Applications. Workshop on Computational Geometry 1988: 148-157 - [c7]Rolf Klein, Derick Wood:
Voronoi Diagrams Based on General Metrics in the Plane. STACS 1988: 281-291 - [c6]Rolf Klein:
Voronoi Diagrams in the Moscow Metric (Extended Abstract). WG 1988: 434-441 - 1987
- [c5]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 - [c4]Frank K. H. A. Dehne, Rolf Klein:
A Sweepcircle Algorithm for Voronoi Diagrams. WG 1987: 59-83 - [c3]Christian Icking, Rolf Klein, Thomas Ottmann:
Priority Search Trees in Secondary Memory (Extended Abstract). WG 1987: 84-93 - 1986
- [c2]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood:
Optimal Dynamic Solutions for Fixed Windowing Problems. SCG 1986: 109-115 - [c1]Rolf Klein, Derick Wood:
The Node Visit Cost of Brother Trees. WG 1986: 106-117
Parts in Books or Collections
- 2011
- [p4]Rolf Klein, Tom Kamphans:
Pledge's Algorithm - How to Escape from a Dark Maze. Algorithms Unplugged 2011: 69-75 - 2008
- [p3]Rolf Klein, Tom Kamphans:
Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt. Taschenbuch der Algorithmen 2008: 75-81 - 2000
- [p2]Franz Aurenhammer, Rolf Klein:
Voronoi Diagrams. Handbook of Computational Geometry 2000: 201-290 - 1992
- [p1]Rolf Klein, Kurt Mehlhorn, Stefan Meiser:
Randomized Incremental Construction of Abstract Voronoi Diagrams. Informatik 1992: 283-308
Editorship
- 2013
- [e7]Guilherme Dias da Fonseca, Thomas Lewiner, Luis Mariano Peñaranda, Timothy M. Chan, Rolf Klein:
Symposium on Computational Geometry 2013, SoCG '13, Rio de Janeiro, Brazil, June 17-20, 2013. ACM 2013, ISBN 978-1-4503-2031-3 [contents] - 2009
- [e6]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
Adaptive, Output Sensitive, Online and Parameterized Algorithms, 19.04. - 24.04.2009. Dagstuhl Seminar Proceedings 09171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - [e5]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
Geometric Networks, Metric Space Embeddings and Spatial Data Mining, 01.11. - 06.11.2009. Dagstuhl Seminar Proceedings 09451, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2009 [contents] - 2007
- [e4]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - [e3]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff:
Geometric Networks and Metric Space Embeddings, 26.11. - 01.12.2006. Dagstuhl Seminar Proceedings 06481, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007 [contents] - 2003
- [e2]Rolf Klein, Hans-Werner Six, Lutz M. Wegner:
Computer Science in Perspective, Essays Dedicated to Thomas Ottmann. Lecture Notes in Computer Science 2598, Springer 2003, ISBN 3-540-00579-X [contents] - 2002
- [e1]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. Lecture Notes in Computer Science 2238, Springer 2002, ISBN 3-540-43399-6 [contents]
Reference Works
- 2016
- [r8]Rolf Klein:
Abstract Voronoi Diagrams. Encyclopedia of Algorithms 2016: 5-8 - [r7]Rolf Klein:
Dilation of Geometric Networks. Encyclopedia of Algorithms 2016: 547-549 - [r6]Rolf Klein:
Geometric Dilation of Geometric Networks. Encyclopedia of Algorithms 2016: 834-837 - [r5]Rolf Klein:
Voronoi Diagrams and Delaunay Triangulations. Encyclopedia of Algorithms 2016: 2340-2344 - [r4]Rolf Klein:
Well Separated Pair Decomposition. Encyclopedia of Algorithms 2016: 2368-2371 - 2008
- [r3]Rolf Klein:
Dilation of Geometric Networks. Encyclopedia of Algorithms 2008 - [r2]Rolf Klein:
Geometric Dilation of Geometric Networks. Encyclopedia of Algorithms 2008 - [r1]Rolf Klein:
Well Separated Pair Decomposition for Unit-Disk Graph. Encyclopedia of Algorithms 2008
Informal and Other Publications
- 2022
- [i20]Herman J. Haverkort, Rolf Klein:
The limit of Lp Voronoi diagrams as p→0 is the bounding-box-area Voronoi diagram. CoRR abs/2207.07377 (2022) - 2021
- [i19]Herman J. Haverkort, Rolf Klein:
Hyperbolae are the locus of constant angle difference. CoRR abs/2112.00454 (2021) - 2019
- [i18]Sang-Sub Kim, Rolf Klein, David Kübel, Elmar Langetepe, Barbara Schwarzwald:
Geometric Firefighting in the Half-plane. CoRR abs/1905.02067 (2019) - [i17]Rolf Klein, David Kübel, Elmar Langetepe, Jörg-Rüdiger Sack, Barbara Schwarzwald:
A New Model in Firefighting Theory. CoRR abs/1911.10341 (2019) - 2015
- [i16]Rolf Klein, David Kriesel, Elmar Langetepe:
A local strategy for cleaning expanding cellular domains by simple robots. CoRR abs/1502.03985 (2015) - 2014
- [i15]Rolf Klein, Elmar Langetepe, Christos Levcopoulos:
A Fire Fighter's Problem. CoRR abs/1412.6065 (2014) - 2012
- [i14]Alexander Gilbers, Rolf Klein:
A New Upper Bound for the VC-Dimension of Visibility Regions. CoRR abs/1206.5689 (2012) - 2010
- [i13]Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe:
Exploring Grid Polygons Online. CoRR abs/1012.5240 (2010) - 2009
- [i12]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Abstracts Collection - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i11]Jérémy Barbay, Rolf Klein, Alejandro López-Ortiz, Rolf Niedermeier:
09171 Executive Summary - Adaptive, Output Sensitive, Online and Parameterized Algorithms. Adaptive, Output Sensitive, Online and Parameterized Algorithms 2009 - [i10]Gautam Das, Joachim Gudmundsson, Rolf Klein, Christian Knauer, Michiel H. M. Smid:
09451 Abstracts Collection - Geometric Networks, Metric Space Embeddings and Spatial Data Mining. Geometric Networks, Metric Space Embeddings and Spatial Data Mining 2009 - 2006
- [i9]Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen:
Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006 - [i8]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Executive Summary -- Robot Navigation. Robot Navigation 2006 - [i7]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz:
06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006 - [i6]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 - [i5]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) - 2005
- [i4]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Searching with an Autonomous Robot. Algorithms for Optimization with Incomplete Information 2005 - [i3]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 - 2004
- [i2]Sándor P. Fekete, Rolf Klein, Andreas Nüchter:
Online Searching with an Autonomous Robot. CoRR cs.RO/0404036 (2004) - 2000
- [i1]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe:
Exploring an Unknown Cellular Environment. EuroCG 2000: 140-143
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2023-09-27 22:50 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint