{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:33:36Z","timestamp":1760441616680,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030398804"},{"type":"electronic","value":"9783030398811"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-39881-1_13","type":"book-chapter","created":{"date-parts":[[2020,1,27]],"date-time":"2020-01-27T03:02:33Z","timestamp":1580094153000},"page":"146-157","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Computational Complexity of the Chromatic Art Gallery Problem for Orthogonal Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0152-2233","authenticated-orcid":false,"given":"Chuzo","family":"Iwamoto","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tatsuaki","family":"Ibusuki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"13_CR1","unstructured":"B\u00e4rtschi, A., Suri, S.: Conflict-free chromatic art gallery coverage. In: 29th International Symposium on Theoretical Aspects of Computer Science, pp. 160\u2013171 (2012)"},{"key":"13_CR2","doi-asserted-by":"crossref","unstructured":"\u00c7a\u011f\u0131r\u0131c\u0131, O., Ghosh, S.K., Hlin\u011bn\u00fd, P., Roy, R.: On conflict-free chromatic guarding of simple polygons. \narXiv:1904.08624\n\n, 26 pages (2019)","DOI":"10.1007\/978-3-030-36412-0_49"},{"key":"13_CR3","doi-asserted-by":"publisher","first-page":"39","DOI":"10.1016\/0095-8956(75)90061-1","volume":"18","author":"V Chv\u00e1tal","year":"1975","unstructured":"Chv\u00e1tal, V.: A combinatorial theorem in plane geometry. J. Comb. Theory B 18, 39\u201341 (1975)","journal-title":"J. Comb. Theory B"},{"key":"13_CR4","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/s00453-001-0040-8","volume":"31","author":"SJ Eidenbenz","year":"2001","unstructured":"Eidenbenz, S.J., Stamm, C., Widmayer, P.: Inapproximability results for guarding polygons and terrains. Algorithmica 31, 79\u2013113 (2001)","journal-title":"Algorithmica"},{"key":"13_CR5","unstructured":"Erickson, L.H., LaValle, S.M.: A chromatic art gallery problem. Technical report, Department of Computer Science, University of Illinois at Urbana-Champaign (2011)"},{"key":"13_CR6","doi-asserted-by":"crossref","unstructured":"Fekete, S.P., Friedrichs, S., Hemmer, M., Mitchell, J.B.M., Schmidt, C.: On the chromatic art gallery problem. In: 30th Canadian Conference on Computational Geometry, Halifax, pp. 73\u201379 (2014)","DOI":"10.1007\/s00453-014-9961-x"},{"key":"13_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"13_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"717","DOI":"10.1007\/BFb0032069","volume-title":"Automata, Languages and Programming","author":"F Hoffmann","year":"1990","unstructured":"Hoffmann, F.: On the rectilinear art gallery problem. In: Paterson, M.S. (ed.) ICALP 1990. LNCS, vol. 443, pp. 717\u2013728. Springer, Heidelberg (1990). \nhttps:\/\/doi.org\/10.1007\/BFb0032069"},{"key":"13_CR9","doi-asserted-by":"publisher","first-page":"24","DOI":"10.1016\/j.comgeo.2018.01.003","volume":"73","author":"F Hoffman","year":"2018","unstructured":"Hoffman, F., Kriegel, K., Suri, S., Verbeek, K., Willert, M.: Tight bounds for conflict-free chromatic guarding of orthogonal art galleries. Comput. Geom. Theory Appl. 73, 24\u201334 (2018)","journal-title":"Comput. Geom. Theory Appl."},{"key":"13_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1007\/978-3-319-13287-7_8","volume-title":"Discrete and Computational Geometry and Graphs","author":"C Iwamoto","year":"2014","unstructured":"Iwamoto, C., Kume, T.: Computational complexity of the $$r$$-visibility guard set problem for polyominoes. In: Akiyama, J., Ito, H., Sakai, T. (eds.) JCDCGG 2013. LNCS, vol. 8845, pp. 87\u201395. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-13287-7_8"},{"issue":"3","key":"13_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1016\/j.comgeo.2007.02.002","volume":"39","author":"MJ Katz","year":"2008","unstructured":"Katz, M.J., Roisman, G.S.: On guarding the vertices of rectilinear domains. Comput. Geom. Theory Appl. 39(3), 219\u2013228 (2008)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"2","key":"13_CR12","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"13_CR13","volume-title":"Art Gallery Theorems and Algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art Gallery Theorems and Algorithms. Oxford University Press, New York (1987)"},{"key":"13_CR14","unstructured":"Pilz, A: Planar 3-SAT with a clause-variable cycle. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, pp. 31:1\u201331:13 (2018)"},{"key":"13_CR15","series-title":"Texts and Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. MCS. Springer, New York (1985). \nhttps:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1002\/malq.19950410212","volume":"41","author":"D Schuchardt","year":"1995","unstructured":"Schuchardt, D., Hecker, H.-D.: Two NP-hard art-gallery problems for ortho-polygons. Math. Logic Q. 41(2), 261\u2013267 (1995)","journal-title":"Math. Logic Q."},{"issue":"2","key":"13_CR17","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1142\/S0218195907002264","volume":"17","author":"C Worman","year":"2007","unstructured":"Worman, C., Keil, J.M.: Polygon decomposition and the orthogonal art gallery problem. Int. J. Comput. Geom. Appl. 17(2), 105\u2013138 (2007)","journal-title":"Int. J. Comput. Geom. Appl."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-39881-1_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,2,19]],"date-time":"2020-02-19T19:05:45Z","timestamp":1582139145000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-39881-1_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030398804","9783030398811"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-39881-1_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"20 February 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 March 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 April 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.comp.nus.edu.sg\/~walcom20\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}