1. Agarwal, A., Lim, M.H., Xu, Y.: Graph Compression via Compaction of degree-2 nodes for URAV Visitation Sequencing. UVS Tech 2003. Brussels, Belgium (December 2003)
2. Vleugels, J., Overmars, M.: Approximating Generalized Voronoi Diagrams in Any Dimension. Intl. J. on Computational Geom. and Applications 8, 201–221 (1998)
3. Arya, S., Vigneron, A.: Approximating a Voronoi Cell. Research Report HKUST-TCSC- 2003-10 (2003)
4. Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)
5. Wagner, I.A., Bruckstein, A.M.: Hamiltonian(t) – An Ant Inspired Heuristic for Recognizing Hamiltonian Graphs. In: Special Session on Ant Colony Methods, 1999 Congress on Evolutionary Computation, Washington DC, USA (July 1999)