Rolf Klein, Martin Kutz. Computing Geometric Minimum-Dilation Graphs Is NP-Hard. In Michael Kaufmann, Dorothea Wagner, editors, Graph Drawing, 14th International Symposium, GD 2006, Karlsruhe, Germany, September 18-20, 2006. Revised Papers. Volume 4372 of Lecture Notes in Computer Science, pages 196-207, Springer, 2006. [doi]
Abstract is missing.