Touring Disjoint Polygons Problem Is NP-Hard.

Arash Ahadi, Amirhossein Mozafari, Alireza Zarei

Browse the full COCOA paper archive.