Kutz, Martin Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Giannopoulos, P., Klein, R., Kutz, M., & Marx, D. (2010). Computing Geometric Minimum-dilation Graphs is NP-hard. International Journal of Computational Geometry & Applications, 20(2), 147-173. doi:10.1142/S0218195910003244.