Michael B. Dillencourt. Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete. Discrete Applied Mathematics, 64(3):207-217, 1996. [doi]
@article{Dillencourt96,
title = {Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete},
author = {Michael B. Dillencourt},
year = {1996},
doi = {10.1016/0166-218X(94)00125-W},
url = {http://dx.doi.org/10.1016/0166-218X(94)00125-W},
tags = {completeness},
researchr = {https://researchr.org/publication/Dillencourt96},
cites = {0},
citedby = {0},
journal = {Discrete Applied Mathematics},
volume = {64},
number = {3},
pages = {207-217},
}