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]
@inproceedings{AhadiMZ13,
title = {Touring Disjoint Polygons Problem Is NP-Hard},
author = {Arash Ahadi and Amirhossein Mozafari and Alireza Zarei},
year = {2013},
doi = {10.1007/978-3-319-03780-6_31},
url = {http://dx.doi.org/10.1007/978-3-319-03780-6_31},
researchr = {https://researchr.org/publication/AhadiMZ13},
cites = {0},
citedby = {0},
pages = {351-360},
booktitle = {Combinatorial Optimization and Applications - 7th International Conference, COCOA 2013, Chengdu, China, December 12-14, 2013, Proceedings},
editor = {Peter Widmayer and Yinfeng Xu and Binhai Zhu},
volume = {8287},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-319-03779-0},
}