The SCEAS System
Navigation Menu
Introduction
Collection Based
Clustering
Ranking
Paper Based
Journals
Conferences
DB Status
Statistics
Search

Search the dblp DataBase

Title:
Author:
Rolf Klein: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Christian Icking, Rolf Klein, Thomas Ottmann
    Priority Search Trees in Secondary Memory (Extended Abstract). [Citation Graph (2, 0)][DBLP]
    WG, 1987, pp:84-93 [Conf]
  2. Anne Brüggemann-Klein, Rolf Klein
    On the Minimality of K, F and D or: Why Löten is Non-Trivial. [Citation Graph (0, 0)][DBLP]
    Computation Theory and Logic, 1987, pp:59-66 [Conf]
  3. Anne Brüggemann-Klein, Rolf Klein, Stefan Wohlfeil
    On the Pagination of Complex Documents. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:49-68 [Conf]
  4. Christian Icking, Rolf Klein, Peter Köllner, Lihong Ma
    Java Applets for the Dynamic Visualization of Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Computer Science in Perspective, 2003, pp:191-205 [Conf]
  5. Rolf Klein, Derick Wood
    On the Maximum Path Length of AVL Trees. [Citation Graph (0, 0)][DBLP]
    CAAP, 1988, pp:16-27 [Conf]
  6. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos
    On bisectors for convex distance functions in 3-space. [Citation Graph (0, 0)][DBLP]
    CCCG, 1999, pp:- [Conf]
  7. Christian Icking, Rolf Klein, Lihong Ma
    How to Look Around a Corner. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:443-448 [Conf]
  8. Rolf Klein, Andrzej Lingas
    A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon. [Citation Graph (0, 0)][DBLP]
    CCCG, 1993, pp:370-374 [Conf]
  9. Rolf Klein
    Abstract Voronoi Diagrams and their Applications. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1988, pp:148-157 [Conf]
  10. Rolf Klein
    Moving Along a Street. [Citation Graph (0, 0)][DBLP]
    Workshop on Computational Geometry, 1991, pp:123-140 [Conf]
  11. Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    Exploring Simple Grid Polygons. [Citation Graph (0, 0)][DBLP]
    COCOON, 2005, pp:524-533 [Conf]
  12. 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. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:71-78 [Conf]
  13. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Searching with an autonomous robot. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2004, pp:449-450 [Conf]
  14. Christian Icking, Rolf Klein
    The Two Guards Problem. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1991, pp:166-175 [Conf]
  15. Christian Icking, Rolf Klein
    Searching for the Kernel of a Polygon - A Competitive Strategy. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:258-266 [Conf]
  16. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
    Convex Distance Functions in 3-Space are Different. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:116-123 [Conf]
  17. Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
    On Bisectors for Different Distance Functions. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1999, pp:291-299 [Conf]
  18. Rolf Klein, Martin Kutz
    The density of iterated crossing points and a gap result for triangulations of finite point sets. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 2006, pp:264-272 [Conf]
  19. Rolf Klein, Andrzej Lingas
    Manhattonian Proximity in a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1992, pp:312-319 [Conf]
  20. Rolf Klein, Andrzej Lingas
    A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1993, pp:124-132 [Conf]
  21. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
    Optimal Dynamic Solutions for Fixed Windowing Problems. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1986, pp:109-115 [Conf]
  22. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Searching with an Autonomous Robot. [Citation Graph (0, 0)][DBLP]
    Algorithms for Optimization with Incomplete Information, 2005, pp:- [Conf]
  23. Christian Icking, Rolf Klein
    Competitive Strategies for Autonomous Systems. [Citation Graph (0, 0)][DBLP]
    Modelling and Planning for Sensor Based Intelligent Robot Systems, 1994, pp:23-40 [Conf]
  24. Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    On the Competitive Complexity of Navigation Tasks. [Citation Graph (0, 0)][DBLP]
    Sensor Based Intelligent Robots, 2000, pp:245-258 [Conf]
  25. Thomas Bretthauer, Anne Brüggemann-Klein, Stefan Hermann, Rolf Klein
    A Component Architecture for Cross-media Formatters. [Citation Graph (0, 0)][DBLP]
    EP, 1998, pp:444-453 [Conf]
  26. Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristan
    Smallest Color-Spanning Objects. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:278-289 [Conf]
  27. Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
    A Fast Algorithm for Approximating the Detour of a Polygonal Chain. [Citation Graph (0, 0)][DBLP]
    ESA, 2001, pp:321-332 [Conf]
  28. Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
    Competitive Online Approximation of the Optimal Search Ratio. [Citation Graph (0, 0)][DBLP]
    ESA, 2004, pp:335-346 [Conf]
  29. Rolf Klein, Andrzej Lingas
    Fast Skeleton Construction. [Citation Graph (0, 0)][DBLP]
    ESA, 1995, pp:582-595 [Conf]
  30. Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
    Exploring an Unknown Cellular Environment. [Citation Graph (0, 0)][DBLP]
    EWCG, 2000, pp:140-143 [Conf]
  31. Rolf Klein
    Walking an Unknown Street with Bounded Detour [Citation Graph (0, 0)][DBLP]
    FOCS, 1991, pp:304-313 [Conf]
  32. Rolf Klein, Derick Wood
    The Path Length of Binary Trees. [Citation Graph (0, 0)][DBLP]
    FODO, 1989, pp:128-136 [Conf]
  33. Rolf Klein, Martin Kutz
    Computing Geometric Minimum-Dilation Graphs Is NP-Hard. [Citation Graph (0, 0)][DBLP]
    Graph Drawing, 2006, pp:196-207 [Conf]
  34. Rolf Klein, Derick Wood
    On Binary Trees. [Citation Graph (0, 0)][DBLP]
    IFIP Congress, 1989, pp:449-454 [Conf]
  35. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized Self-Approaching Curves. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1998, pp:317-326 [Conf]
  36. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: The Convex Case. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2002, pp:624-634 [Conf]
  37. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
    On the Geometric Dilation of Finite Point Sets. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2003, pp:250-259 [Conf]
  38. Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
    Embedding Point Sets into Plane Graphs of Small Dilation. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:5-16 [Conf]
  39. Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel H. M. Smid
    Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles. [Citation Graph (0, 0)][DBLP]
    ISAAC, 2005, pp:849-858 [Conf]
  40. Rolf Klein, Andrzej Lingas
    Hamiltonian Abstract Voronoi Diagrams in Linear Time. [Citation Graph (0, 0)][DBLP]
    ISAAC, 1994, pp:11-19 [Conf]
  41. Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf
    BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations. [Citation Graph (0, 0)][DBLP]
    IV, 2000, pp:19-24 [Conf]
  42. Frank K. H. A. Dehne, Rolf Klein
    "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    MFCS, 1994, pp:296-305 [Conf]
  43. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    On the Construction of Abstract Voronoi Diagrams, II. [Citation Graph (0, 0)][DBLP]
    SIGAL International Symposium on Algorithms, 1990, pp:138-154 [Conf]
  44. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    A Competitive Strategy for Learning a Polygon. [Citation Graph (0, 0)][DBLP]
    SODA, 1997, pp:166-174 [Conf]
  45. Christian Icking, Rolf Klein, Elmar Langetepe
    An Optimal Competitive Strategy for Walking in Streets. [Citation Graph (0, 0)][DBLP]
    STACS, 1999, pp:110-120 [Conf]
  46. Rolf Klein, Derick Wood
    Voronoi Diagrams Based on General Metrics in the Plane. [Citation Graph (0, 0)][DBLP]
    STACS, 1988, pp:281-291 [Conf]
  47. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    Moving an Angle Around a Region. [Citation Graph (0, 0)][DBLP]
    SWAT, 1998, pp:71-82 [Conf]
  48. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
    On Geometric Dilation and Halving Chords. [Citation Graph (0, 0)][DBLP]
    WADS, 2005, pp:244-255 [Conf]
  49. Frank K. H. A. Dehne, Rolf Klein
    A Sweepcircle Algorithm for Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WG, 1987, pp:59-83 [Conf]
  50. Rolf Klein
    Voronoi Diagrams in the Moscow Metric (Extended Abstract). [Citation Graph (0, 0)][DBLP]
    WG, 1988, pp:434-441 [Conf]
  51. Rolf Klein
    Combinatorial Properties of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    WG, 1989, pp:356-369 [Conf]
  52. Rolf Klein, Derick Wood
    The Node Visit Cost of Brother Trees. [Citation Graph (0, 0)][DBLP]
    WG, 1986, pp:106-117 [Conf]
  53. Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
    Binary Search Trees of Almost Optimal Height. [Citation Graph (0, 0)][DBLP]
    Acta Inf., 1990, v:28, n:2, pp:165-178 [Journal]
  54. Frank K. H. A. Dehne, Rolf Klein
    "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1997, v:17, n:1, pp:19-32 [Journal]
  55. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
    The Geometric Dilation of Finite Point Sets. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 2006, v:44, n:2, pp:137-149 [Journal]
  56. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
    A Dynamic Fixed Windowing Problem. [Citation Graph (0, 0)][DBLP]
    Algorithmica, 1989, v:4, n:4, pp:535-550 [Journal]
  57. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Online searching with an autonomous robot. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:2, pp:102-115 [Journal]
  58. Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
    A fast algorithm for approximating the detour of a polygonal chain. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:2, pp:123-134 [Journal]
  59. Rolf Klein
    Foreword. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2005, v:30, n:2, pp:79-0 [Journal]
  60. Rolf Klein
    Walking an Unknown Street with Bounded Detour. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1991, v:1, n:, pp:325-351 [Journal]
  61. 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. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2006, v:34, n:1, pp:28-34 [Journal]
  62. Rolf Klein, Kurt Mehlhorn, Stefan Meiser
    Randomized Incremental Construction of Abstract Voronoi Diagrams. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 1993, v:3, n:, pp:157-184 [Journal]
  63. Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristan
    The weighted farthest color Voronoi diagram on trees and graphs. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2004, v:27, n:1, pp:13-26 [Journal]
  64. Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
    On the geometric dilation of closed curves, graphs, and point sets. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:36, n:1, pp:16-38 [Journal]
  65. Sándor P. Fekete, Rolf Klein, Andreas Nüchter
    Online Searching with an Autonomous Robot [Citation Graph (0, 0)][DBLP]
    CoRR, 2004, v:0, n:, pp:- [Journal]
  66. Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
    Generalized self-approaching curves. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:3-24 [Journal]
  67. Christoph A. Hipke, Christian Icking, Rolf Klein, Elmar Langetepe
    How to Find a Point on a Line Within a Fixed Distance. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1999, v:93, n:1, pp:67-73 [Journal]
  68. Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
    On bisectors for different distance functions. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2001, v:109, n:1-2, pp:139-161 [Journal]
  69. Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
    A Combinatorial Property of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:307-318 [Journal]
  70. Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
    Convex Distance Functions in 3-Space are Different. [Citation Graph (0, 0)][DBLP]
    Fundam. Inform., 1995, v:22, n:4, pp:331-352 [Journal]
  71. Rolf Klein, Derick Wood
    The Node Visit Cost of Brother Trees [Citation Graph (0, 0)][DBLP]
    Inf. Comput., 1987, v:75, n:2, pp:107-129 [Journal]
  72. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel
    Maximizing a Voronoi Region: the Convex Case. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 2005, v:15, n:5, pp:463-476 [Journal]
  73. Rolf Klein, Andrzej Lingas
    A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1996, v:6, n:3, pp:263-278 [Journal]
  74. Rolf Klein, Andrzej Lingas
    Manhattonian proximity in a simple polygon. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1995, v:5, n:, pp:53-74 [Journal]
  75. Christian Icking, Rolf Klein
    The Two Guards Problem. [Citation Graph (0, 0)][DBLP]
    Int. J. Comput. Geometry Appl., 1992, v:2, n:3, pp:257-285 [Journal]
  76. Manuel Abellanas, Ferran Hurtado, Vera Sacristan, Christian Icking, Lihong Ma, Rolf Klein, Elmar Langetepe, Belén Palop
    Voronoi Diagram for services neighboring a highway. [Citation Graph (0, 0)][DBLP]
    Inf. Process. Lett., 2003, v:86, n:5, pp:283-288 [Journal]
  77. Rolf Klein, Derick Wood
    On the path length of binary trees. [Citation Graph (0, 0)][DBLP]
    J. ACM, 1989, v:36, n:2, pp:280-289 [Journal]
  78. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
    The Polygon Exploration Problem. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2001, v:31, n:2, pp:577-600 [Journal]
  79. Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau
    An Optimal Competitive Strategy for Walking in Streets. [Citation Graph (0, 0)][DBLP]
    SIAM J. Comput., 2004, v:33, n:2, pp:462-486 [Journal]
  80. Rolf Klein, Derick Wood
    A Tight Upper Bound for the Path Length of AVL Trees. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 1990, v:72, n:2&3, pp:251-264 [Journal]
  81. Rolf Klein
    Rechnergestützte Kursmanagement bei der Durchführung stark belegter Programmierkurse. [Citation Graph (0, 0)][DBLP]
    Angewandte Informatik, 1986, v:28, n:1, pp:31-37 [Journal]
  82. Xin Han, Kazuo Iwama, Rolf Klein, Andrzej Lingas
    Approximating the Maximum Independent Set and Minimum Vertex Coloring on Box Graphs. [Citation Graph (0, 0)][DBLP]
    AAIM, 2007, pp:337-345 [Conf]
  83. Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
    Geometric dilation of closed planar curves: New lower bounds. [Citation Graph (0, 0)][DBLP]
    Comput. Geom., 2007, v:37, n:3, pp:188-208 [Journal]
  84. Rolf Klein, Martin Kutz
    The density of iterated crossing points and a gap result for triangulations of finite point sets [Citation Graph (0, 0)][DBLP]
    CoRR, 2006, v:0, n:, pp:- [Journal]

  85. A Meeting Scheduling Problem Respecting Time and Space. [Citation Graph (, )][DBLP]


  86. A traveller's problem. [Citation Graph (, )][DBLP]


  87. Competitive Online Searching for a Ray in the Plane. [Citation Graph (, )][DBLP]


  88. 06421 Abstracts Collection -- Robot Navigation. [Citation Graph (, )][DBLP]


  89. 06421 Executive Summary -- Robot Navigation. [Citation Graph (, )][DBLP]


  90. 06481 Abstracts Collection - Geometric Networks and Metric Space Embeddings. [Citation Graph (, )][DBLP]


  91. Competitive online searching for a ray in the plane. [Citation Graph (, )][DBLP]


  92. New Results on Visibility in Simple Polygons. [Citation Graph (, )][DBLP]


  93. Abstract Voronoi diagrams revisited. [Citation Graph (, )][DBLP]


  94. On the dilation spectrum of paths, cycles, and trees. [Citation Graph (, )][DBLP]


  95. Computing the Detour and Spanning Ratio of Paths, Trees, and Cycles in 2D and 3D. [Citation Graph (, )][DBLP]


Search in 0.169secs, Finished in 0.172secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
Introduction Collection Based Clustering Ranking Paper Based Journals Conferences DB Status Statistics Search
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002