Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Rolf Klein
2010 – today
- 2013
[j43]Darius Geiß, Rolf Klein, Rainer Penninger, Günter Rote: Optimally solving a transportation problem using Voronoi diagrams. Comput. Geom. 46(8): 1009-1016 (2013)- [c65]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
- 2012
- [j42]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. Geometry Appl. 22(1): 45-60 (2012)
- [c64]Darius Geiß, Rolf Klein, Rainer Penninger: Optimally Solving a Transportation Problem Using Voronoi Diagrams. COCOON 2012: 264-274
- [i6]Alexander Gilbers, Rolf Klein: A New Upper Bound for the VC-Dimension of Visibility Regions. CoRR abs/1206.5689 (2012)
- 2011
- [j41]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 Med. Inf. & Decision Making 11: 30 (2011)
- [c63]Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe: Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains. Symposium on Computational Geometry 2011: 287-288
- [c62]Alexander Gilbers, Rolf Klein: A new upper bound for the VC-dimension of visibility regions. Symposium on Computational Geometry 2011: 380-386
- [c61]Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff: Tolerant Algorithms. ESA 2011: 736-747
- [p2]Rolf Klein, Tom Kamphans: Pledge's Algorithm - How to Escape from a Dark Maze. Algorithms Unplugged 2011: 69-75
- 2010
- [j40]Subir Kumar Ghosh, Rolf Klein: Online algorithms for searching and exploration in the plane. Computer Science Review 4(4): 189-201 (2010)
- [j39]Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx: Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geometry Appl. 20(2): 147-173 (2010)
- [j38]Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: The Tourist in the Shopping Arcade. J. UCS 16(5): 676-685 (2010)
- [c60]Florian Berger, Rolf Klein: A traveller's problem. Symposium on Computational Geometry 2010: 176-182
- [c59]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
- [i5]Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe: Exploring Grid Polygons Online. CoRR abs/1012.5240 (2010)
2000 – 2009
- 2009
- [j37]Florian Berger, Alexander Gilbers, Ansgar Grüne, Rolf Klein: How Many Lions Are Needed to Clear a Grid? Algorithms 2(3): 1069-1086 (2009)
- [j36]Rolf Klein, Elmar Langetepe, Zahra Nilforoushan: Abstract Voronoi diagrams revisited. Comput. Geom. 42(9): 885-902 (2009)
- [j35]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)
- [j34]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)
- [c58]
- 2008
- [j33]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)
- [j32]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)
- [c57]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
- [p1]Rolf Klein, Tom Kamphans: Der Pledge-Algorithmus: Wie man im Dunkeln aus einem Labyrinth entkommt. Taschenbuch der Algorithmen 2008: 75-81
- [r3]
- [r2]
- [r1]
- 2007
- [j31]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)
- [j30]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein: Geometric dilation of closed planar curves: New lower bounds. Comput. Geom. 37(3): 188-208 (2007)
- [j29]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)
- [c56]Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas: Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. AAIM 2007: 337-345
- [e4]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz (Eds.): Robot Navigation, 15.10. - 20.10.2006. Dagstuhl Seminar Proceedings 06421, Internationales Begegnungs- und Forschungszentrum fuer Informatik (IBFI), Schloss Dagstuhl, Germany 2007
- [e3]Joachim Gudmundsson, Rolf Klein, Giri Narasimhan, Michiel H. M. Smid, Alexander Wolff (Eds.): 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
- 2006
- [j28]Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein: The Geometric Dilation of Finite Point Sets. Algorithmica 44(2): 137-149 (2006)
- [j27]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)
- [j26]Sándor P. Fekete, Rolf Klein, Andreas Nüchter: Online searching with an autonomous robot. Comput. Geom. 34(2): 102-115 (2006)
- [c55]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
- [c54]Andrea Eubeler, Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: Competitive Online Searching for a Ray in the Plane. Robot Navigation 2006
- [c53]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Executive Summary -- Robot Navigation. Robot Navigation 2006
- [c52]Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz: 06421 Abstracts Collection -- Robot Navigation. Robot Navigation 2006
- [c51]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
- [c50]Rolf Klein, Martin Kutz: Computing Geometric Minimum-Dilation Graphs Is NP-Hard. Graph Drawing 2006: 196-207
- [i4]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
- [j25]
- [j24]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)
- [c49]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe: Exploring Simple Grid Polygons. COCOON 2005: 524-533
- [c48]Sándor P. Fekete, Rolf Klein, Andreas Nüchter: Searching with an Autonomous Robot. Algorithms for Optimization with Incomplete Information 2005
- [c47]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
- [c46]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
- [c45]Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote: On Geometric Dilation and Halving Chords. WADS 2005: 244-255
- [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
- [j23]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)
- [j22]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)
- [j21]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)
- [c44]Sándor P. Fekete, Rolf Klein, Andreas Nüchter: Searching with an autonomous robot. Symposium on Computational Geometry 2004: 449-450
- [c43]Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen: Competitive Online Approximation of the Optimal Search Ratio. ESA 2004: 335-346
- [i2]Sándor P. Fekete, Rolf Klein, Andreas Nüchter: Online Searching with an Autonomous Robot. CoRR cs.RO/0404036 (2004)
- 2003
- [j20]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)
- [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
- [e2]Rolf Klein, Hans-Werner Six, Lutz Michael Wegner (Eds.): Computer Science in Perspective, Essays Dedicated to Thomas Ottmann. Lecture Notes in Computer Science 2598, Springer 2003, ISBN 3-540-00579-X
- 2002
- [c39]Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel: Maximizing a Voronoi Region: The Convex Case. ISAAC 2002: 624-634
- [e1]Gregory D. Hager, Henrik I. Christensen, Horst Bunke, Rolf Klein (Eds.): 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
- 2001
- [j19]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)
- [j18]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)
- [j17]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel: The Polygon Exploration Problem. SIAM J. Comput. 31(2): 577-600 (2001)
- [c38]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
- [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
- [i1]Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe: Exploring an Unknown Cellular Environment. EuroCG 2000: 140-143
1990 – 1999
- 1999
- [j16]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)
- [j15]Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf: BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Content-Based Relations. D-Lib Magazine 5(11) (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. Symposium on Computational Geometry 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
- [b2]Rolf Klein: Algorithmische Geometrie. Addison-Wesley-Longman 1997, ISBN 978-3-8273-1111-5, pp. I-X, 1-388
- [j14]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)
- [j13]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)
- [c28]Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel: A Competitive Strategy for Learning a Polygon. SODA 1997: 166-174
- 1996
- [j12]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
- [j11]Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma: Convex Distance Functions in 3-Space are Different. Fundam. Inform. 22(4): 331-352 (1995)
- [j10]Rolf Klein, Andrzej Lingas: Manhattonian proximity in a simple polygon. Int. J. Comput. Geometry Appl. 5: 53-74 (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. Symposium on Computational Geometry 1995: 71-78
- [c26]Christian Icking, Rolf Klein: Searching for the Kernel of a Polygon - A Competitive Strategy. Symposium on Computational Geometry 1995: 258-266
- [c25]
- 1994
- [c24]Christian Icking, Rolf Klein: Competitive Strategies for Autonomous Systems. Modelling and Planning for Sensor Based Intelligent Robot Systems 1994: 23-40
- [c23]
- [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
- [j9]Rolf Klein, Kurt Mehlhorn, Stefan Meiser: Randomized Incremental Construction of Abstract Voronoi Diagrams. Comput. Geom. 3: 157-184 (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]
- [c19]Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma: Convex Distance Functions in 3-Space are Different. Symposium on Computational Geometry 1993: 116-123
- [c18]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
- 1992
- [j8]Christian Icking, Rolf Klein: The Two Guards Problem. Int. J. Comput. Geometry Appl. 2(3): 257-285 (1992)
- [c17]Rolf Klein, Andrzej Lingas: Manhattonian Proximity in a Simple Polygon. Symposium on Computational Geometry 1992: 312-319
- 1991
- [j7]
- [c16]
- [c15]Christian Icking, Rolf Klein: The Two Guards Problem. Symposium on Computational Geometry 1991: 166-175
- [c14]
- 1990
- [j6]Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann: Binary Search Trees of Almost Optimal Height. Acta Inf. 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)
- [c13]Rolf Klein, Kurt Mehlhorn, Stefan Meiser: On the Construction of Abstract Voronoi Diagrams, II. SIGAL International Symposium on Algorithms 1990: 138-154
1980 – 1989
- 1989
- [b1]Rolf Klein: Concrete and Abstract Voronoi Diagrams. Lecture Notes in Computer Science 400, Springer 1989, ISBN 3-540-52055-4
- [j4]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood: A Dynamic Fixed Windowing Problem. Algorithmica 4(4): 535-550 (1989)
- [j3]
- [c12]
- [c11]
- [c10]
- 1988
- [c9]
- [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]
- 1987
- [j2]
- [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]
- [c3]Christian Icking, Rolf Klein, Thomas Ottmann: Priority Search Trees in Secondary Memory (Extended Abstract). WG 1987: 84-93
- 1986
- [j1]Rolf Klein: Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse. Angewandte Informatik 28(1): 31-37 (1986)
- [c2]Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood: Optimal Dynamic Solutions for Fixed Windowing Problems. Symposium on Computational Geometry 1986: 109-115
- [c1]
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-10-02 11:03 CEST by the dblp team