| 2011 |
|---|
| 24 | Tolerant Algorithms. Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff. ESA 2011, 736-747. Web SearchBibTeXDownload |
| 2008 |
|---|
| 23 | 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. Discrete & Computational Geometry (39): 17-37 (2008). Web SearchBibTeXDownload |
| 2006 |
|---|
| 22 | 06421 Abstracts Collection -- Robot Navigation. Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz. Robot Navigation 2006. Web SearchBibTeXDownload |
| 21 | 06421 Executive Summary -- Robot Navigation. Sándor P. Fekete, Rudolf Fleischer, Rolf Klein, Alejandro López-Ortiz. Robot Navigation 2006. Web SearchBibTeXDownload |
| 2005 |
|---|
| 20 | Maximizing a Voronoi Region: the Convex Case. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel. Int. J. Comput. Geometry Appl. (15): 463-476 (2005). Web SearchBibTeXDownload |
| 2002 |
|---|
| 19 | Maximizing a Voronoi Region: The Convex Case. Frank K. H. A. Dehne, Rolf Klein, Raimund Seidel. ISAAC 2002, 624-634. Web SearchBibTeXDownload |
| 2001 |
|---|
| 18 | The Polygon Exploration Problem. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel. SIAM J. Comput. (31): 577-600 (2001). Web SearchBibTeXDownload |
| 1998 |
|---|
| 17 | Moving an Angle Around a Region. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel. SWAT 1998, 71-82. Web SearchBibTeXDownload |
| 1997 |
|---|
| 16 | "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Frank K. H. A. Dehne, Rolf Klein. Algorithmica (17): 19-32 (1997). Web SearchBibTeXDownload |
| 15 | A Competitive Strategy for Learning a Polygon. Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel. SODA 1997, 166-174. Web SearchBibTeXDownload |
| 1994 |
|---|
| 14 | "The Big Sweep": On the Power of the Wavefront Approach to Voronoi Diagrams. Frank K. H. A. Dehne, Rolf Klein. MFCS 1994, 296-305. Web SearchBibTeXDownload |
| 1990 |
|---|
| 13 | Binary Search Trees of Almost Optimal Height. Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann. Acta Inf. (28): 165-178 (1990). Web SearchBibTeXDownload |
| 12 | A Tight Upper Bound for the Path Length of AVL Trees. Rolf Klein, Derick Wood. Theor. Comput. Sci. (72): 251-264 (1990). Web SearchBibTeXDownload |
| 1989 |
|---|
| 11 | A Dynamic Fixed Windowing Problem. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. Algorithmica (4): 535-550 (1989). Web SearchBibTeXDownload |
| 10 | The Path Length of Binary Trees. Rolf Klein, Derick Wood. FODO 1989, 128-136. Web SearchBibTeX |
| 9 | On Binary Trees. Rolf Klein, Derick Wood. IFIP Congress 1989, 449-454. Web SearchBibTeX |
| 8 | On the path length of binary trees. Rolf Klein, Derick Wood. J. ACM (36): 280-289 (1989). Web SearchBibTeXDownload |
| 1988 |
|---|
| 7 | On the Maximum Path Length of AVL Trees. Rolf Klein, Derick Wood. CAAP 1988, 16-27. Web SearchBibTeXDownload |
| 6 | Voronoi Diagrams Based on General Metrics in the Plane. Rolf Klein, Derick Wood. STACS 1988, 281-291. Web SearchBibTeXDownload |
| 1987 |
|---|
| 5 | The Node Visit Cost of Brother Trees. Rolf Klein, Derick Wood. Inf. Comput. (75): 107-129 (1987). Web SearchBibTeXDownload |
| 4 | A Sweepcircle Algorithm for Voronoi Diagrams. Frank K. H. A. Dehne, Rolf Klein. WG 1987, 59-83. Web SearchBibTeXDownload |
| 3 | Priority Search Trees in Secondary Memory (Extended Abstract). Christian Icking, Rolf Klein, Thomas Ottmann. WG 1987, 84-93. Web SearchBibTeXDownload |
| 1986 |
|---|
| 2 | Optimal Dynamic Solutions for Fixed Windowing Problems. Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood. Symposium on Computational Geometry 1986, 109-115. Web SearchBibTeXDownload |
| 1 | The Node Visit Cost of Brother Trees. Rolf Klein, Derick Wood. WG 1986, 106-117. Web SearchBibTeXDownload |
