Conference Paper:
M. B. Dillencourt,
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-Complete, in
Proceedings of the Fourth Canadian Conference on Computational Geometry,
St. Johns, Newfoundland, August, 1992, 223-228.
Updated Version:
M. B. Dillencourt,
Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-Complete,
Discrete Applied Mathematics, 64(3), February 1996, 207-217.