Universitaet Bonn, Inst. f. Informatik, Abt. I: Articles in Journals

Informatik Abt. I Articles in Journals

Rudolf Fleischer, Thomas Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
The Tourist in the Shopping Arcade
Journal of Universal Computer Science 16(5), pp. 676-685, 2010.
Subir Kumar Ghosh, Rolf Klein
Online algorithms for searching and exploration in the plane
Computer Science Review 4(4), pp. 189-201, 2010.
Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Daniel Marx
Computing Minimum-Dilation Graphs is NP-Hard
International Journal on Computational Geometry and Applications 20(2), pp. 147-173, 2010.
Elmar Langetepe
Optimizing two-sequence functionals for competitive analysis
accepted for Computer Science - Research and Development, 2010.
Elmar Langetepe
Searching for an axis-parallel shoreline
Unpublished manuscript, submitted for publication, 2010.
Rolf Klein, Elmar Langetepe, Zhara Nilforoushan
Abstract Voronoi Diagrams Revisited
Computational Geometry: Theory and Applications 42(9), pp. 885-902, 2009.
The original publication is available at Elsevier .
Florian Berger, Alexander Gilbers, Ansgar Grüne, Rolf Klein
How Many Lions Are Needed to Clear a Grid?
Algorithms 2(3), pp. 1069-1086, 2009.
Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid
On the Dilation Spectrum of Paths, Trees and Cycles
To appear in Computational Geometry: Theory and Applications, 2009.
Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
A Meeting Scheduling Problem Respecting Time and Space
GeoInformatica 13(4), pp. 453-481, 2008.
Pankaj K. Agarwal, Rolf Klein, Christian Knauer, Stefan Langerman, Pat Morin, Micha Sharir, Michael Soss
Computing the detour and spanning ratio of paths, trees and cycles in 2d and 3d
Discrete & Computational Geometry 39(1), pp. 17-37, 2008.
The original publication is available at www.springerlink.com/.
Ansgar Grüne, Sanaz Kamali Sarvestani
On the Density of Iterated Line Segment Intersections
Computational Geometry: Theory and Applications 40(1), pp. 23-36, 2008.
The original publication is available at www.elsevier.com.
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive online approximation of the optimal search ratio
Siam J. Comput., pp. 881-898, 2008.
Tom Kamphans, Elmar Langetepe
Leaving an unknown maze using an error-prone compass
accepted for Internat. J. Comput. Geom. Appl., 2008.
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
Geometric Dilation of Closed Planar Curves: New Lower Bounds
Computational Geometry: Theory and Applications 37(3), pp. 188-208, 2007.
The original publication is available at www.elsevier.com.
Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
Embedding Point Sets into Plane Graphs of Small Dilation
International Journal of Computational Geometry & Applications 17(3), pp. 201-230, 2007.
(Special issue devoted to selected papers from ISAAC 2005) The original publication is available at www.worldscinet.com, © World Scientific Publishing Company.
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
On the Geometric Dilation of Closed Curves, Graphs and Point Sets
Computational Geometry: Theory and Applications 36(1), pp. 16-38, 2007.
The original publication is available at www.elsevier.com.
Ansgar Grüne, Rolf Klein, Cinzia Miori, Salvador Segura Gomis
Chords Halving the Area of a Planar Convex Set
Mathematical Inequalities and Applications 10(1), pp. 205-216, 2007.
The original publication is available at http://www.mia-journal.com/.
S. Fekete, R. Klein, A. Nüchter
Online Searching with an Autonomous Robot
Computational Geometry: Theory and Applications 34(2), pp. 102-115, 2006.
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
Computational Geometry: Theory and Applications 34(1), pp. 28-34, 2006.
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
The Geometric Dilation of Finite Point Sets
Algorithmica 44, pp. 137-149, 2006.
(Special issue devoted to selected papers from ISAAC 2003). The original publication is available at http://www.springerlink.com/.
Birgit Engels, Tom Kamphans
Randolph's Robot Game is NP-hard!
Electronic Notes in Discrete Mathematics 25, pp. 49-53, 2006.
Frank Dehne, Rolf Klein, Raimund Seidel
Maximizing a Voronoi Region: The Convex Case
International Journal on Computational Geometry and Applications 15(5), pp. 463-475, 2005.
Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
A fast algorithm for approximating the detour of a polygonal chain
Computational Geometry: Theory and Applications 27, pp. 123-134, 2004.
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán
The weighted farthest color Voronoi diagram on trees and graphs
Computational Geometry: Theory and Applications 27, pp. 13-26, 2004.
Christian Icking, Rolf Klein, Elmar Langetepe, Sven Schuierer, Ines Semrau
An Optimal Competitive Strategy for Walking in Streets
SIAM J. Comput. 33, pp. 462-486, 2004.
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belen Palop, Vera Sacristán
Voronoi Diagram for services neighboring a highway
Information Processing Letters 86, pp. 283-288, 2003.
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
Generalized Self-Approaching Curves
Discrete Appl. Math. 109, pp. 3-24, 2001.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
The Polygon Exploration Problem
SIAM J. Comput. 31, pp. 577-600, 2001.
Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
On Bisectors for Different Distance Functions
Discrete Appl. Math. 109, pp. 139-161, 2001.
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.
Amitava Datta, Christian Icking
Competitive Searching in a Generalized Street
Comput. Geom. Theory Appl. 13, pp. 109-120, 1999.
Christoph Hipke, Christian Icking, Rolf Klein, Elmar Langetepe
How to Find a Point on a Line within a Fixed Distance
Discrete Appl. Math. 93, pp. 67-73, 1999.
Christian Icking, Rolf Klein, Elmar Langetepe
Self-Approaching Curves
Math. Proc. Camb. Phil. Soc. 125, pp. 441-453, 1999.
Ngoc-Minh Lê
On Non-Smooth Convex Distance Functions
Inform. Process. Lett. 63(6), pp. 323-329, 1997.
Manuel Abellanas, G. Hernandes, Rolf Klein, V. Neumann-Lara, Jorge Urrutia
A Combinatorial Property of Convex Sets
Discrete Comput. Geom. 17(3), pp. 307-318, 1997.
Frank Dehne, Rolf Klein
``The Big Sweep'': On the Power of the Wavefront Approach to Voronoi Diagrams
Algorithmica 17(1), pp. 19-32, 1997.
Ngoc-Minh Lê
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space
Comput. Geom. Theory Appl. 8, pp. 279-298, 1997.
G. Antoniou, E. Langetepe
A correct logic programming computation of default logic extensions
Journal of Automated Reasoning 18,1, pp. 25-46, 1997.
Rolf Klein, Andrzej Lingas
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
Internat. J. Comput. Geom. Appl. 6, pp. 263-278, 1996.
Ngoc-Minh Lê
On Voronoi diagrams in the L_p-metric in R^D
Discrete Comput. Geom. 16, pp. 177-196, 1996.
Anne Brüggemann-Klein, Rolf Klein, Stefan Wohlfeil
Pagination Reconsidered
Electronic Publishing: Origination, Dissemination, and Design 8(2/3), pp. 139-152, 1995.
Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
Convex Distance Functions in 3-Space are Different
Fundam. Inform. 22, pp. 331-352, 1995.
Rolf Klein, Andrzej Lingas
Manhattonian proximity in a simple polygon
Internat. J. Comput. Geom. Appl. 5, pp. 53-74, 1995.
Rolf Klein, Lihong Ma
Wrapping Ellipses Around a Convex Skeleton
Internat. J. Comput. Math. 55, pp. 173-181, 1995.
G. Antoniou, E. Langetepe
Applying SLD-resolution to a Class of Non-Horn Logic Programs
Journal of the Interest Group of Pure and Applied Logics 2,2, pp. 229-241, 1994.
G. Antoniou, E. Langetepe, V. Sperschneider
New proofs in default logic theory
Annals of Mathematics and Artificial Intelligence 12, pp. 215-229, 1994.
Rolf Klein, Kurt Mehlhorn, Stefan Meiser
Randomized Incremental Construction of Abstract Voronoi Diagrams
Comput. Geom. Theory Appl. 3(3), pp. 157-184, 1993.
Christian Icking, Günter Rote, Emo Welzl, Chee Yap
Shortest Paths for Line Segments
Algorithmica 10, pp. 182-200, 1993.
Christian Icking, Rolf Klein
The Two Guards Problem
Internat. J. Comput. Geom. Appl. 2(3), pp. 257-285, 1992.
Rolf Klein
Walking an Unknown Street with Bounded Detour
Comput. Geom. Theory Appl. 1, pp. 325-351, 1992.
Arne Andersson, Christian Icking, Rolf Klein, Thomas Ottmann
Binary Search Trees of Almost Optimal Height
Acta Inform. 28, pp. 165-178, 1990.
Rolf Klein, Derick Wood
A Tight Upper Bound for the Length of AVL Trees
Theoret. Comput. Sci. 72, pp. 251-264, 1990.
Rolf Klein, Derick Wood
On the Path Length of Binary Trees
J. ACM 36(2), pp. 280-289, 1989.
Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
A Dynamic Fixed Windowing Problem
Algorithmica 4, pp. 535-550, 1989.

[ Informatik Abt. I ] [ Forschung ] [ Lehre ] [ Publikationen ] [ Mitarbeiter ] [ Universität Bonn ] [ Geometrie Labor ]

[ Informatik Abt. I ] [ Forschung ] [ Lehre ] [ Publikationen ] [ Mitarbeiter ] [ Universität Bonn ]
[ Geometrie Labor ]