| Geometric data structures for computer graphics E Langetepe, G Zachmann AK Peters/CRC Press, 2006 | 156 | 2006 |
| Smallest color-spanning objects M Abellanas, F Hurtado, C Icking, R Klein, E Langetepe, L Ma, B Palop, ... European symposium on algorithms, 278-289, 2001 | 89 | 2001 |
| The farthest color Voronoi diagram and related problems M Abellanas, F Hurtado, C Icking, R Klein, E Langetepe, L Ma, B Palop, ... Abstracts 17th European Workshop Comput. Geom, 113-116, 2001 | 82 | 2001 |
| Abstract Voronoi diagrams revisited R Klein, E Langetepe, Z Nilforoushan Computational Geometry 42 (9), 885-902, 2009 | 65 | 2009 |
| On the competitive complexity of navigation tasks C Icking, T Kamphans, R Klein, E Langetepe Sensor Based Intelligent Robots: International Workshop Dagstuhl Castle …, 2002 | 61 | 2002 |
| Self-approaching curves C Icking, R Klein, E Langetepe Mathematical Proceedings of the Cambridge Philosophical Society 125 (3), 441-453, 1999 | 59 | 1999 |
| Exploring simple grid polygons C Icking, T Kamphans, R Klein, E Langetepe International Computing and Combinatorics Conference, 524-533, 2005 | 58 | 2005 |
| On the optimality of spiral search E Langetepe Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete …, 2010 | 53 | 2010 |
| Voronoi diagram for services neighboring a highway M Abellanas, F Hurtado, V Sacristan, C Icking, L Ma, R Klein, ... Information Processing Letters 86 (5), 283-288, 2003 | 53 | 2003 |
| A fast algorithm for approximating the detour of a polygonal chain A Ebbers-Baumann, R Klein, E Langetepe, A Lingas Computational Geometry 27 (2), 123-134, 2004 | 44 | 2004 |
| How to find a point on a line within a fixed distance C Hipke, C Icking, R Klein, E Langetepe Discrete Applied Mathematics 93 (1), 67-73, 1999 | 43 | 1999 |
| Generalized self-approaching curves O Aichholzer, F Aurenhammer, C Icking, R Klein, E Langetepe, G Rote Discrete Applied Mathematics 109 (1-2), 3-24, 2001 | 42 | 2001 |
| Competitive online approximation of the optimal search ratio R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen SIAM Journal on Computing 38 (3), 881-898, 2008 | 41 | 2008 |
| An optimal competitive strategy for walking in streets C Icking, R Klein, E Langetepe Annual Symposium on Theoretical Aspects of Computer Science, 110-120, 1999 | 41 | 1999 |
| An optimal competitive strategy for walking in streets C Icking, R Klein, E Langetepe, S Schuierer, I Semrau SIAM Journal on Computing 33 (2), 462-486, 2004 | 32 | 2004 |
| Exploring an Unknown Cellular Environment. C Icking, T Kamphans, R Klein, E Langetepe EuroCG, 140-143, 2000 | 28 | 2000 |
| Proximity problems for time metrics induced by the L_1 metric and isothetic networks M Abellanas Encuentros en Geometria Computacional, 2001 | 21 | 2001 |
| Competitive online approximation of the optimal search ratio R Fleischer, T Kamphans, R Klein, E Langetepe, G Trippen European Symposium on Algorithms, 335-346, 2004 | 18 | 2004 |
| Searching for an axis-parallel shoreline E Langetepe Theoretical Computer Science 447, 85-99, 2012 | 16 | 2012 |
| The weighted farthest color Voronoi diagram on trees and graphs F Hurtado, R Klein, E Langetepe, V Sacristán Computational Geometry 27 (1), 13-26, 2004 | 16 | 2004 |
