External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

Touring Disjoint Polygons Problem Is NP-Hard

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]

Authors

Arash Ahadi

This author has not been identified. Look up 'Arash Ahadi' in Google

Amirhossein Mozafari

This author has not been identified. Look up 'Amirhossein Mozafari' in Google

Alireza Zarei

This author has not been identified. Look up 'Alireza Zarei' in Google
runs on