Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons

Chuzo Iwamoto, Tatsuaki Ibusuki. Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons. In M. Sohel Rahman, Kunihiko Sadakane, Wing-Kin Sung, editors, WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020, Singapore, March 31 - April 2, 2020, Proceedings. Volume 12049 of Lecture Notes in Computer Science, pages 146-157, Springer, 2020. [doi]

Abstract

Abstract is missing.