Arash Ahadi, Amirhossein Mozafari, Alireza Zarei. Touring Disjoint Polygons Problem Is NP-Hard. In Peter Widmayer, Yinfeng Xu, Binhai Zhu, editors, Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings. Volume 8287 of Lecture Notes in Computer Science, pages 351-360, Springer, 2013. [doi]
Abstract is missing.