Your search returned the following 5 documents:

5. Computing geometric minimum-dilation graphs is NP-hard
   Panos Giannopoulos, Rolf Klein, Martin Kutz, and Daniel Marx
   International Journal of Computational Geometry & Applications 20 (2): 147-173, 2010
   
4. Computing Geometric Minimum-Dilation Graphs Is NP-Hard
   Rolf Klein and Martin Kutz
   In: Graph Drawing : 14th International Symposium, GD 2006, Karlsruhe, Germany, 2007, 196-207
   
   
3. The Density of Iterated Crossing Points and a Gap Result for Triangulations of Finite Point Sets
   Rolf Klein and Martin Kutz
   In: Proceedings of the 22nd Annual Symposium on Computational Geometry, SCG'06, Sedona, Arizona, USA, 2006, 264-272
   
   
2. Randomized incremental construction of abstract Voronoi diagrams
   Rolf Klein, Kurt Mehlhorn, and Stefan Meiser
   In: Informatik---Festschrift zum 60.~Geburtstag von Günter Hotz, 1992, 283-308
   
1. Randomized incremental construction of abstract Voronoi diagrams
   Rolf Klein, Kurt Mehlhorn, and Stefan Meiser
   Computational Geometry: Theory and Applications 3 (3): 157-184, 1993
   [PDF: Download: RandomizedIncrementalAbstractVD.pdf]