Publisher
Springer International Publishing
Reference16 articles.
1. Bärtschi, A., Suri, S.: Conflict-free chromatic art gallery coverage. Algorithmica 68, 265–283 (2014). https://doi.org/10.1007/s00453-012-9732-5
2. Lecture Notes in Computer Science;O Çağırıcı,2019
3. Chvátal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory B. 18, 39–41 (1975). https://doi.org/10.1016/0095-8956(75)90061-1
4. Eidenbenz, S.J., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31, 79–113 (2001). https://doi.org/10.1007/s00453-001-0040-8
5. Erickson, L.H., LaValle, S.M.: A chromatic art gallery problem. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign (2011)