Panos Giannopoulos, Rolf Klein, Christian Knauer, Martin Kutz, Dániel Marx. Computing Geometric Minimum-Dilation Graphs is NP-Hard. Int. J. Comput. Geometry Appl., 20(2):147-173, 2010. [doi]
@article{GiannopoulosKKKM10,
title = {Computing Geometric Minimum-Dilation Graphs is NP-Hard},
author = {Panos Giannopoulos and Rolf Klein and Christian Knauer and Martin Kutz and Dániel Marx},
year = {2010},
doi = {10.1142/S0218195910003244},
url = {http://dx.doi.org/10.1142/S0218195910003244},
tags = {graph-rewriting, rewriting},
researchr = {https://researchr.org/publication/GiannopoulosKKKM10},
cites = {0},
citedby = {0},
journal = {Int. J. Comput. Geometry Appl.},
volume = {20},
number = {2},
pages = {147-173},
}