Universitaet Bonn, Inst. f. Informatik, Abt. I: Proceedings

Informatik Abt. I Proceedings

Thilo Beckmann, Rolf Klein, David Kriesel, Elmar Langetepe
Ant-sweep: a decentral strategy for cooperative cleaning in expanding domains
Symposium on Computational Geometry, 2011, pp. 287-288.
Alexander Gilbers, Rolf Klein
A new upper bound for the VC-dimension of visibility regions
Symposium on Computational Geometry, 2011, pp. 380-386.
Rolf Klein, Rainer Penninger, Christian Sohler, David P. Woodruff
Tolerant Algorithms
ESA, 2011, pp. 736-747.
Florian Berger, Rolf Klein
A Traveller's Problem
Proceedings of the 26th ACM Symposium on Computational Geometry, Snowbird, USA, 2010, pp. 176-182.
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 Plane
ISAAC, 2010, pp. 121-131.
Elmar Langetepe
On the optimality of spiral search
SODA 2010: Proc. 21st Annu. ACM-SIAM Symp. Disc. Algor., 2010, pp. 1-12.
Slides of the talk.
Elmar Langetepe, Rainer Penninger, Jan Tulke
Computing the visibility area between two simple polygons in linear time
Abstracts 26th European Workshop Comput. Geom., Dortmund, 2010, pp. 237-240.
Alexander Gilbers, Rolf Klein
New Results on Visibility in Simple Polygons
Algorithms and Data Structure Symposium, Banff, Canada,
LNCS 5664, Springer, 2009, pp. 327-338.
Tom Kamphans, Elmar Langetepe
Inspecting a set of strips optimally
WADS 2009: Algorithms and Data Structure Symposium, "Banff, Alberta, Canada" , 2009, pp. 423-434.
Slides of the talk.
Tom Kamphans, Elmar Langetepe
Inspecting a set of strips optimally
Abstracts 25th European Workshop Comput. Geom., Brussels, Belgium, 2009, pp. 163-166.
Slides of the talk.
Elmar Langetepe
On the optimality of spiral search
Abstracts 25th European Workshop Comput. Geom., Brussels, Belgium, 2009, pp. 329-332.
Slides of the talk.
Florian Berger, Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
A Meeting Scheduling Problem Respecting Time and Space
Algorithmic Aspects in Information and Management, 4th International Conference, Shanghai, China, 2008, pp. 50-59.
Daniel Herrmann, Tom Kamphans, Elmar Langetepe
Exploring Simple Triangular and Hexagonal Grid Polygons Online
Abstracts 24th European Workshop Comput. Geom., Nancy, France, 2008, pp. 177-180.
Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
Escaping from a Labyrinth with One-way Roads for Limited Robots
Abstracts 3rd European Conf. Mobile Robots, Freiburg, 2007.
Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
Leaving an Unknown Maze with One-Way Roads
Abstracts 23rd European Workshop Comput. Geom., Graz, Austria, 2007, pp. 90-93.
Bernd Brüggemann, Tom Kamphans, Elmar Langetepe
Leaving an Unknown Maze with One-Way Roads
Abstracts 12th European Conf. Operational Research, Prague, 2007, pp. 140.
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Searching for rays and lower bound constructions
Abstracts 12th European Conf. Operational Research, Prague, 2007, pp. 65.
X. Han, K. Iwama, R. Klein, A. Lingas
Approximating the maximum independent set and minimum vertex coloring on box graphs
Proc. Third International Conference on Algorithmic Aspects in Information and Management, Portland, USA,
LNCS 4508, Springer, 2007, pp. 337-345.
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive Online Searching for a Ray in the Plane
Robot Navigation,
Dagstuhl Seminar Proceedings , Internationales Begegnungs- und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, Germany, 2006.
Birgit Engels, Tom Kamphans
Randolph's Robot Game is NP-hard!
Abstracts 22nd European Workshop Comput. Geom., Delphi, Greece, 2006, pp. 157-160.
Full Version.
Ansgar Grüne, Sanaz Kamali Sarvestani
On the Density of Iterated Line Segment Intersections
Abstracts 22nd European Workshop Comput. Geom., Delphi, Greece, 2006, pp. 39-42.
Rolf Klein, Martin Kutz
Computing geometric minimum-dilation graphs is NP-hard
Proc. 14th International Symposium on Graph Drawing, Karlsruhe, Germany,
LNCS 4372, Springer, 2006, pp. 196-107.
The original publication is available at http://www.springerlink.com/.
Rolf Klein, Martin Kutz
The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
Proc. 22nd Symposium on Computational Geometry, Sedona, Arizona,
ACM Press, 2006, pp. 264 - 272.
Rolf Klein, Doron Nussbaum, Jörg-Rüdiger Sack, Jiehua Yi
How to Fit In Another Meeting
Proc. 2nd International Conference on Collaborative Computing: Networking, Applications and Worksharing, Atlanta, USA,
IEEE, 2006, pp. 1-6.
Adrian Dumitrescu, Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein, Günter Rote
On Geometric Dilation and Halving Chords
9th International Workshop on Algorithms and Data Structures, Waterloo, Canada,
Lecture Notes Comput. Sci. 3608, Springer, 2005, pp. 244-255.
© Springer-Verlag, (Presentation File).
Adrian Dumitrescu, Ansgar Grüne, Günter Rote
Improved Lower Bound on the Geometric Dilation of Point Sets
Abstracts 21st European Workshop Comput. Geom., Eindhoven,
Technische Universiteit Eindhoven, 2005, pp. 37-40.
(Presentation File, Full Paper).
Andrea Eubeler, Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive Online Searching for a Ray in the Plane
Abstracts 21st European Workshop Comput. Geom., Eindhoven, 2005, pp. 107-110.
Annette Ebbers-Baumann, Ansgar Grüne, Marek Karpinski, Rolf Klein, Christian Knauer, Andrzej Lingas
Embedding Point Sets into Plane Graphs of Small Dilation
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China,
Lecture Notes Comput. Sci. 3827, Springer, 2005, pp. 5-16.
© Springer-Verlag, Best Paper Award of ISAAC 2005, (Full Paper).
Christian Icking, Tom Kamphans, Rolf Klein, Elmar Langetepe
Exploring simple grid polygons
11th Internat. Comput. Combin. Conf.,
Lecture Notes Comput. Sci. 3595, Springer, 2005, pp. 524-533.
© Springer-Verlag.
Rolf Klein, Christian Knauer, Giri Narasimhan, Michiel Smid
Exact and Approximation Algorithms for Computing the Dilation Spectrum of Paths, Trees, and Cycles
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya, Hainan, China,
Lecture Notes Comput. Sci. 3827, Springer, Berlin / Heidelberg, 2005, pp. 849-858.
© Springer-Verlag.
Tom Kamphans, Elmar Langetepe
Optimal competitive online ray search with an error-prone robot
Proc. 4th Internat. Workshop Efficient Experim. Algorithms, Santorini,
Lecture Notes Comput. Sci. 3503, Springer, 2005, pp. 593-596.
© Springer-Verlag.
Tom Kamphans, Elmar Langetepe
On optimizing multi-sequence functionals for competitive analysis
Abstracts 21st European Workshop Comput. Geom., Eindhoven, 2005, pp. 111-114.
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
Geometric Dilation of Closed Planar Curves: A New Lower Bound
Abstracts 20th European Workshop Comput. Geom., Seville,
Universidad de Sevilla, 2004, pp. 123-126.
(Presentation File).
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive online approximation of the optimal search ratio
Proc. 12th Annu. European Sympos. Algorithms, Bergen,
Lecture Notes Comput. Sci. 3221, Springer-Verlag, 2004, pp. 335-346.
© Springer-Verlag.
Rudolf Fleischer, Tom Kamphans, Rolf Klein, Elmar Langetepe, Gerhard Trippen
Competitive search ratio of graphs and polygons
Abstracts 20th European Workshop Comput. Geom., Sevilla,
Universidad de Sevilla, 2004, pp. 127-130.
Sándor Fekete, Rolf Klein, Andreas Nüchter
Online searching with an autonomous robot
Proc. 6th Workshop Algorithmic Found. Robot., Utrecht, 2004, pp. 335-350.
Roland Hagius, Christian Icking, Elmar Langetepe
Lower bounds for the polygon exploration problem
Abstracts 20th European Workshop Comput. Geom., Sevilla,
Universidad de Sevilla, 2004, pp. 135-138.
Tom Kamphans, Elmar Langetepe
Finding a door along a wall with an error afflicted robot
Abstracts 20th European Workshop Comput. Geom., Sevilla,
Universidad de Sevilla, 2004, pp. 143-146.
Manuel Abellanas, Ferran Hurtado, Rolf Klein, Elmar Langetepe, Belen Palop, Vera Sacristán
The bichromatic two center problem
X Encuentros de Geometria Computacional, Sevilla,
Universitat de Sevilla, 2003.
Annette Ebbers-Baumann, Ansgar Grüne, Rolf Klein
On the Geometric Dilation of Finite Point Sets
14th Annual International Symposium on Algorithms and Computation, Kyoto,
Lecture Notes Comput. Sci. 2906, Springer, 2003, pp. 250-259.
© Springer-Verlag, Best Paper Award of ISAAC 2003.
Ansgar Grüne, Rolf Klein, Elmar Langetepe
Computing the Detour of Polygons
Abstracts 19th European Workshop Comput. Geom., Bonn,
University of Bonn, 2003, pp. 61-64.
(Presentation File).
Tom Kamphans, Elmar Langetepe
The Pledge Algorithm Reconsidered under Errors in Sensors and Motion
Proc. of the 1th Workshop on Approximation and Online Algorithms,
Lecture Notes Comput. Sci. 2909, Springer, 2003, pp. 165-178.
© Springer-Verlag.
Elmar Langetepe, Gabriel Zachmann
Geometric Data Structures for Computer Graphics
Tutorial presented at Siggraph 2003, San Diego, 2003.
Frank Dehne, Rolf Klein, Raimund Seidel
Maximizing a Voronoi region.
Proc. 13th Ann. Int. Sympos. Alg. and Computation, Vancouver,
Lecture Notes Comput. Sci. 2518, Springer, 2002, pp. 624-634.
Ferran Hurtado, Rolf Klein, Elmar Langetepe, Vera Sacristán
The weighted farthest color voronoi diagram on trees and graphs.
Abstracts 18th European Workshop Comput. Geom., Warsaw,
Warsaw University, 2002, pp. 8-11.
Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
On the competitive complexity of navigation tasks
Sensor Based Intelligent Robots,
Lecture Notes Comput. Sci. 2238, Springer, Berlin, 2002, pp. 245-258.
© Springer-Verlag.
Elmar Langetepe, Gabriel Zachmann
Geometric Data Structures for Computer Graphics
Tutorial held at Eurographics 2002, Saarbrücken,
MPI Saarbrücken, 2002.
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
The Farthest Color Voronoi Diagram and Related Problems
Abstracts 17th European Workshop Comput. Geom., Berlin,
Freie Universität Berlin, 2001, pp. 113-116.
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belén Palop, Vera Sacristán
Smallest Color-Spanning Objects
Proc. 9th Annu. European Sympos. Algorithms, 2001.
Christian Icking, Lihong Ma
A Tight Bound for the Complexity of Voronoi Diagrams under Polyhedral Convex Distance Functions in 3D
Proc. 33rd Annu. ACM Sympos. Theory Comput., Crete, Greece, 2001.
Manuel Abellanas, Ferran Hurtado, Christian Icking, Rolf Klein, Elmar Langetepe, Lihong Ma, Belen Palop, Vera Sacristán
Proximity problems for time metrics induced by the L₁-metric and isothetic networks
IX Encuentros en Geometri a Computacional, Girona,
Universitat de Girona, 2001, pp. 175-181.
Annette Ebbers-Baumann, Rolf Klein, Elmar Langetepe, Andrzej Lingas
A fast algorithm for approximating the detour of a polygonal chain
Proc. 9th Annu. European Sympos. Algorithms,
Lecture Notes Comput. Sci. 2161, Springer, Berlin, 2001, pp. 321-332.
Christian Icking, Thomas Kamphans, Rolf Klein, Elmar Langetepe
Exploring an Unknown Cellular Environment
Abstracts 16th European Workshop Comput. Geom., Eilat,
Ben-Gurion University of the Negev, 2000, pp. 140-143.
Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Content-Based Relations
Proc. Information Visualisation in Digital Libraries, 2000.
Christian Icking, Rolf Klein, Elmar Langetepe
An Optimal Competitive Strategy for Walking in Streets
Proc. 16th Sympos. Theoret. Aspects Comput. Sci., Trier,
Lecture Notes Comput. Sci. 1563, Springer-Verlag, 1999, pp. 110-120.
Christian Icking, Rolf Klein, Elmar Langetepe
Searching a Goal on m Rays Within a Fixed Distance
Abstracts 15th European Workshop Comput. Geom., Antibes,
INRIA Sophia-Antipolis, 1999, pp. 137-139.
Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma, Francisco Santos
On Bisectors for Convex Distance Functions in 3-Space
Proc. 11th Canad. Conf. Comput. Geom., Vancouver, Canada, 1999.
Christian Icking, Rolf Klein, Lihong Ma, Stefan Nickel, Ansgar Weißler
On Bisectors for Different Distance Functions
Proc. 15th Annu. ACM Sympos. Comput. Geom., 1999, pp. 291-299.
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
Generalized Self-Approaching Curves
Abstracts 14th European Workshop Comput. Geom., Barcelona,
Universitat Polytènica de Catalunya, Barcelona, 1998, pp. 15-17.
Oswin Aichholzer, Franz Aurenhammer, Christian Icking, Rolf Klein, Elmar Langetepe, Günter Rote
Generalized Self-Approaching Curves
Proc. 9th Annu. Internat. Sympos. Algorithms Comput., Taejon,
Lecture Notes Comput. Sci. 1533, Springer-Verlag, 1998, pp. 317-326.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
Moving an Angle Around a Region
Proc. 6th Scand. Workshop Algorithm Theory, Stockholm,
Lecture Notes Comput. Sci. 1432, Springer-Verlag, 1998, pp. 71-82.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
The Polygon Exploration Problem: A New Strategy and a New Analysis Technique
Robotics: The Algorithmic Perspective, Proc. 3rd Workshop Algorithmic Found. Robot., Houston,
A. K. Peters, 1998, pp. 211-222.
Utilizes result in \citehikk-maar-98.
Christian Icking, Rolf Klein, Lihong Ma
The Bisector with Respect to Different Convex Distance Functions
Abstracts 14th European Workshop Comput. Geom., Barcelona,
Universitat Polytènica de Catalunya, Barcelona, 1998, pp. 99-101.
Ngoc-Minh Lê
Computing the L_∞-Voronoi Diagram in 3-Space Optimally
Abstracts 14th European Workshop Comput. Geom., Barcelona,
Universitat Polytènica de Catalunya, Barcelona, 1998, pp. 113.
Thomas Bretthauer, Anne Brüggemann-Klein, Stefan Hermann, Rolf Klein
A Plug-In Architecture for Cross-media Formatters
Proc. 7th International Conference on Electronic Publishing, Saint Malo,
Lecture Notes Comput. Sci. 1375, Springer-Verlag, 1998, pp. 444-453.
Anne Brüggemann-Klein, Rolf Klein, Britta Landgraf
BibRelEx: Exploring Bibliographic Databases by Visualization of Annotated Contents-Based Relations
Proc. International Forum on Multimedia and Image Processing, Anchorage, 1998.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
A Competitive Strategy for Learning a Polygon
Proc. 8th ACM-SIAM Sympos. Discrete Algorithms, 1997, pp. 166-174.
Christian Icking, Rolf Klein, Peter Köllner, Lihong Ma
A Java Applet for the Dynamic Visualization of Voronoi Diagrams
Abstracts 13th European Workshop Comput. Geom., Würzburg,
Universität Würzburg, 1997, pp. 46-47.
Ngoc-Minh Lê
A Quantum-Searching Application Note
Proc. 9th Canad. Conf. Comput. Geom., 1997, pp. 113-116.
Frank Hoffmann, Christian Icking, Rolf Klein, Klaus Kriegel
An Efficient Competitive Strategy for Learning a Polygon
Abstracts 12th European Workshop Comput. Geom., Münster,
Universität Münster, 1996, pp. 107-108.
Ngoc-Minh Lê
On Non-Smooth Convex Distance Functions
Proc. 8th Canad. Conf. Comput. Geom.,
Carleton University Press, Ottawa, Canada, 1996, pp. 113-118.
Manuel Abellanas, G. Hernandez, Rolf Klein, V. Neumann-Lara, Jorge Urrutia
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane
Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 71-78.
Christian Icking, Rolf Klein
Searching for the Kernel of a Polygon: A Competitive Strategy
Proc. 11th Annu. ACM Sympos. Comput. Geom., 1995, pp. 258-266.
Christian Icking, Rolf Klein
Searching for the Kernel of a Polygon: A Competitive Strategy
Abstracts 11th European Workshop Comput. Geom., Linz,
Universität Linz, 1995, pp. 7-99.
Rolf Klein, Andrzej Lingas
Fast Skeleton Construction
Proc. 3rd Annu. European Sympos. Algorithms,
Lecture Notes Comput. Sci. 979, Springer-Verlag, 1995, pp. 582-595.
Ngoc-Minh Lê
On Determining Optimal Strategies in Pursuit Games in the Plane
Proc. 22th Internat. Colloq. Automata Lang. Program.,
Lecture Notes Comput. Sci. 944, Springer-Verlag, 1995, pp. 499-510.
Ngoc-Minh Lê
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space
Proc. 10th Internat. Conf. Fund. Comput. Theory,
Lecture Notes Comput. Sci. 965, Springer-Verlag, 1995, pp. 333-342.
Ngoc-Minh Lê
Randomized Incremental Construction of Simple Abstract Voronoi Diagrams in 3-Space
Abstracts 11th European Workshop Comput. Geom., Linz,
Universität Linz, 1995, pp. 17-20.
Amitava Datta, Christian Icking
Competitive Searching in a Generalized Street
Proc. 10th Annu. ACM Sympos. Comput. Geom., 1994, pp. 175-182.
Frank Dehne, Rolf Klein
``The Big Sweep'': On the Power of the Wavefront Approach to Voronoi Diagrams
Proc. Internat. Sympos. Math. Found. Comput. Sci.,
Lecture Notes Comput. Sci. 841, Springer-Verlag, 1994, pp. 296-305.
Rolf Klein, Andrzej Lingas
Hamiltonian Abstract Voronoi Diagrams in Linear Time
Proc. 5th Annu. Internat. Sympos. Algorithms Comput., Beijing, China,
Lecture Notes Comput. Sci. 834, Springer-Verlag, 1994, pp. 11-19.
Rolf Klein, Andrzej Lingas
Hamiltonian Abstract Voronoi Diagrams in Linear Time
Abstracts 10th European Workshop Comput. Geom., Santander,
Universidad de Cantabria, Santander, 1994, pp. 1-4.
Ngoc-Minh Lê
On Voronoi Diagrams in the L_p Metric in Higher Dimensions
Proc. 11th Sympos. Theoret. Aspects Comput. Sci.,
Lecture Notes Comput. Sci. 755, Springer-Verlag, 1994, pp. 711-722.
G. Antoniou, E. Langetepe
Soundness and Completeness of a Logic Programming Approach to Default Logic
Proc. American National Conference on Artificial Intelligence,
MIT Press, 1994, pp. 934-939.
Christian Icking, Rolf Klein, Ngoc-Minh Lê, Lihong Ma
Convex Distance Functions in 3-Space are Different
Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 116-123.
Christian Icking, Rolf Klein, Lihong Ma
How to Look Around a Corner
Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 443-448.
Christian Icking, Rolf Klein, Lihong Ma
The Optimal Way for Looking Around a Corner
Proc. 4th IEEE-IEE Vehicle Navigation and Informations Systems Conference, Ottawa, Canada, 1993.
Rolf Klein, Andrzej Lingas
A Linear-Time Randomized Algorithm for the Bounded Voronoi Diagram of a Simple Polygon
Proc. 9th Annu. ACM Sympos. Comput. Geom., 1993, pp. 124-132.
Rolf Klein, Andrzej Lingas
A Note on Generalizations of Chew's Algorithm for the Voronoi Diagram of a Convex Polygon
Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 370-374.
Ngoc-Minh Lê
On General Properties of Strictly Convex Smooth Distance Functions in R^d
Proc. 5th Canad. Conf. Comput. Geom., Waterloo, Canada, 1993, pp. 375-380.
G. Antoniou, E. Langetepe
A Process Model for Default Logics and its Realization in Logic Programming
In Proc. 4th Portugese Conference on Artificial Intelligence,
LNAI , Springer, 1993, pp. 213-225.
Christian Icking, Rolf Klein
Path Planning Under Uncertainty
Abstracts 8th European Workshop Comput. Geom., Utrecht,
Utrecht University, 1992, pp. 5.
Rolf Klein, Andrzej Lingas
Manhattonian Proximity in a Simple Polygon
Proc. 8th Annu. ACM Sympos. Comput. Geom., 1992, pp. 312-319.
Christian Icking, Rolf Klein
The Two Guards Problem
Proc. 7th Annu. ACM Sympos. Comput. Geom., 1991, pp. 166-175.
Rolf Klein
Moving Along a Street
Proc. Computational Geometry: Methods, Algorithms and Applications, Bern,
Lecture Notes Comput. Sci. 553, Springer-Verlag, 1991, pp. 123-140.
Rolf Klein
Walking an Unknown Street with Bounded Detour
Proc. 32nd Annu. IEEE Sympos. Found. Comput. Sci., 1991, pp. 304-313.
Rolf Klein, Kurt Mehlhorn, Stefan Meiser
On the Construction of Abstract Voronoi Diagrams II
Proc. 1st Annu. SIGAL Internat. Sympos. Algorithms,
Lecture Notes Comput. Sci. 450, Springer-Verlag, 1990, pp. 138-154.
Christian Icking
Kürzeste Bewegung von Liniensegmenten
Abstracts 5th Intern. Workshop Comput. Geom., Freiburg,
Universität Freiburg, 1989.
Rolf Klein
Combinatorial Properties of Abstract Voronoi Diagrams
Proc. Internat. Workshop Graph-Theoret. Concepts Comput. Sci.,
Lecture Notes Comput. Sci. 411, Springer-Verlag, 1989, pp. 356-369.
Rolf Klein
Voronoi Diagrams in the Moscow Metric
Proc. Graph-Theoretic Concepts in Computer Science. Proceedings., Amsterdam,
Lecture Notes Comput. Sci. 344, Springer-Verlag, 1989, pp. 434-441.
Rolf Klein, Derick Wood
On Binary Trees
Information Processing 89, 11th World Computer Congress, San Francisco, 1989, pp. 449-454.
Rolf Klein, Derick Wood
On the Path Length of Binary Trees
Proc. 3rd International Conference on Foundations of Data Organization and Algorithms,
Lecture Notes Comput. Sci. 367, Springer-Verlag, 1989, pp. 128-136.
Christian Icking, Rolf Klein, Thomas Ottmann
Priority Search Trees in Secondary Memory
Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci.,
Lecture Notes Comput. Sci. 314, Springer-Verlag, 1988, pp. 84-93.
Rolf Klein
Abstract Voronoi Diagrams and Their Applications
Computational Geometry and its Applications, Würzburg,
Lecture Notes Comput. Sci. 333, Springer-Verlag, 1988, pp. 148-157.
extended abstract.
Rolf Klein, Derick Wood
On the Maximum Path Length of AVL-Trees
Proc. 13th Colloquium on Trees in Algebra and Programming, Nancy,
Lecture Notes Comput. Sci. 299, Springer-Verlag, 1988, pp. 16-27.
Rolf Klein, Derick Wood
Voronoi Diagrams Based on General Metrics in the Plane
Proc. 5th Sympos. Theoret. Aspects Comput. Sci.,
Lecture Notes Comput. Sci. 294, Springer-Verlag, 1988, pp. 281-291.
Frank Dehne, Rolf Klein
A Sweepcircle Algorithm for Voronoi diagrams
Proc. 13th Internat. Workshop Graph-Theoret. Concepts Comput. Sci.,
Lecture Notes Comput. Sci. , Springer-Verlag, 1987, pp. 59-70.
Rolf Klein, Otto Nurmi, Thomas Ottmann, Derick Wood
Optimal Dynamic Solutions for Fixed Windowing Problems
Proc. 2nd Annu. ACM Sympos. Comput. Geom., 1986, pp. 109-115.

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

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