HEINZ NIXDORF INSTITUTE
University of Paderborn
Algorithms and Complexity

Valentina Damerow, Dipl.-Math.
Member of the PaSCo (Paderborn Institute for Scientific Computation) Graduierten Kolleg
- Research Areas:
- Computational Geometry, Randomized Algorithms, and Complexity Theory
- Teaching:
- Address:
Office: F1.209
Phone: ++ 49 - 5251 - 606457
Fax: ++ 49 - 5251 - 606482
EMail: vio@upb.de
- Alternative homepage: Valentina at the PaSCo Graduierten Kolleg
Publications:
- Marcin Bienkowski, Valentina Damerow, Friedhelm Meyer auf der Heide, and Christian Sohler.
Average Case Complexity of Voronoi Diagrams of n Sites from the Unit Cube.
Presented at the 21st European Workshop on Computational Geometry (EWCG), 2005.
Abstract or extended abstract in
pdf .
- Valentina Damerow and Christian Sohler.
Extreme Points under Random Noise.
In: Proceedings of the 12th European Symposium on Algorithms (ESA), pp 264-274, 2004.
Abstract or extended abstract in
compressed postscript .
- Valentina Damerow and Christian Sohler.
Smoothed Number of Extreme Points under Uniform Noise.
Presented at the 20th European Workshop on Computational Geometry (EWCG), 2004.
Abstract or extended abstract in
compressed postscript .
- Valentina Damerow, Friedhelm Meyer auf der Heide, Harald Räcke, Christian Scheideler, and Christian Sohler.
Smoothed Motion Complexity.
In: Proceedings of the 11th European Symposium on Algorithms (ESA), pp 161-171, 2003.
Abstract or extended abstract in
compressed postscript .
- Valentina Damerow, Lukas Finschi, and Martin Ziegler.
Point Location Algorithms of Minimum Size.
Presented at the 14th Canadian Conference of Computational Geometry (CCCG), 2002.
Abstract or extended abstract in
compressed postscript .
- Valentina Damerow and Martin Ziegler.
The Point Location Problem in Three Algebraic Models of Computation.
Presented at the 3rd GI-Informatiktage 2001.

ESA in Budapest
