
|
[ ][ ]
|
|
Computer Science Dept. I
|
Prof. Dr. Rolf Klein
|
Prof.
Dr. Rolf Klein
|
Office
|
University of Bonn
Institute of Computer Science, Dept. I
Raum N 310
Römerstr. 164
53117 Bonn
|
|
+49 (228) 73 - 4134
|
| Fax |
+49 (228) 73 - 4321
|
 |
rolf.klein@uni-bonn.de |
| Consulting hours |
By appointment |
Research Interests
Computational Geometry, On-Line Algorithms, Algorithms and Data Structures
, Multimedia Applications in Teaching
Curriculum Vitae
born September 5, 1953, in Münster, Germany
marriage December 27, 1984, in Nottuln, Germany
one daughter, born January 1, 1997, in Munich, Germany
| 1978 |
Diploma in Mathematics und Mathematical Logic
|
| 1982 |
Doctorate in Mathematics, University of Erlangen-Nürnberg, Germany
|
| 1986/87 |
Visiting Assistant Professor, Data Structuring Group, Department of Computer Science, University of Waterloo, Canada
|
| 1989 |
Habilitation in Computer Science, University of Freiburg, Germany
|
| 1989 |
Associate Professor of Computer Science, Department of Mathematics, University of Essen, Germany
|
| 1991 |
Professor of Computer Science, University of Hagen, Germany
|
| seit 2000 |
Professor of Computer Science, Faculty of Natural Sciences, University of Bonn, Germany
|
| | |
Current Professional Society Activities
Co-Editor of Computational Geometry: Theory and Applications
.
Charter member of the
GI Special Interest Group on Computational Geometry
Erasmus delegate for the Institute of Computer Science
.
Co-organizer of the Dagstuhl seminars
Robot Navigation and
Geometric Networks and Metric Spanners, 2006
.
Program committee member for
COCOON '06, ISAAC '06,
committee member of the
DAAD
Reviewer for 16 Scientific Journals
Reviewer for the DFG program
Algorithmik großer und kompakter Netzwerke.
Publications
2 books,
and more than 100 publications,
recently:
- On the Geometric Dilation of Finite Point Sets
with A. Ebbers-Baumann und A. Grüne, Algorithmica 44(2), pp. 137-149, Februar 2006.
- Chords Halving the Area of a Planar Convex Set
with A. Grüne, C. Miori, und S. Segura Gomis,
to appear in
Mathematical Inequalities and Applications, 2006.
- A PTAS For Minimum Vertex Dilation Triangulation of a Simple Polygon
with a Constant Number of Sources of Dilation
with Ch. Levcopoulos und A. Lingas,
to appear in
Computational Geometry: Theory and Applications, 2006.
- Online Searching with an Autonomous Robot
with S. Fekete und A. Nüchter,
to appear in
Computational Geometry: Theory and Applications, 2006.
- On the Geometric Dilation of Closed Curves, Graphs, and Point Sets
with A. Dumitrescu, A. Ebbers-Baumann, A. Grüne und G. Rote,
to appear in
Computational Geometry: Theory and Applications, 2006.
- Computing the Detour and Spanning Ratio of Paths, Trees and Cycles in 2D and 3D
with P. Agarwal, Ch. Knauer, S. Langerman, P. Morin, M. Sharir und M. Soss,
to appear in
Discrete and Computational Geometry, 2006.
- The Density of Iterated Plane Intersection Graphs and a Gap Result
for Triangulations
with M. Kutz, 22nd ACM Symposium on Computational Geometry, 5.-7. Juni 2006
Sedona, Arizona.
- Exact and Approximation Algorithms for Computing the Dilation Spectrum
of Paths, Trees, and Cycles
with Ch. Knauer, G. Narasimhan und M. Smid,
in X. Deng und D. Du (Hrsg.),
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya,
Hainan, China, December 19-21, 2005, LNCS 3827, pp. 849 - 858.
- Embedding Point Sets into Plane Graphs of Small Dilation
with A. Ebbers-Baumann, A. Grüne, M. Karpinski, Ch. Knauer und A. Lingas,
in X. Deng und D. Du (Hrsg.),
Algorithms and Computation: 16th International Symposium, ISAAC 2005, Sanya,
Hainan, China, December 19-21, 2005, LNCS 3827, pp. 5-16.
Best Paper Award.