Kutz, Martin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Klein, R., & Kutz, M. (2007). Computing Geometric Minimum-Dilation Graphs Is NP-Hard. In M. Kaufmann, & D. Wagner (Eds.), Graph Drawing (pp. 196-207). Berlin: Springer.