{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:46:39Z","timestamp":1742939199077,"version":"3.40.3"},"publisher-location":"Cham","reference-count":18,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031496103"},{"type":"electronic","value":"9783031496110"}],"license":[{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,12,9]],"date-time":"2023-12-09T00:00:00Z","timestamp":1702080000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-49611-0_24","type":"book-chapter","created":{"date-parts":[[2023,12,8]],"date-time":"2023-12-08T14:02:45Z","timestamp":1702044165000},"page":"330-353","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Half Guarding Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5832-8135","authenticated-orcid":false,"given":"Erik","family":"Krohn","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pahlow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3314-9437","authenticated-orcid":false,"given":"Zhongxiu","family":"Yang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,9]]},"reference":[{"key":"24_CR1","unstructured":"Abdelkader, A., Saeed, A., Harras, K.A., Mohamed, A.: The inapproximability of illuminating polygons by $$\\alpha $$-floodlights. In: CCCG, pp. 287\u2013295 (2015)"},{"issue":"1","key":"24_CR2","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1142\/S0218195998000035","volume":"8","author":"J Abello","year":"1998","unstructured":"Abello, J., Estivill-Castro, V., Shermer, T.C., Urrutia, J.: Illumination of orthogonal polygons with orthogonal floodlights. Int. J. Comput. Geom. Appl. 8(1), 25\u201338 (1998)","journal-title":"Int. J. Comput. Geom. Appl."},{"issue":"1\/2","key":"24_CR3","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1142\/S0218195997000090","volume":"7","author":"P Bose","year":"1997","unstructured":"Bose, P., Guibas, L.J., Lubiw, A., Overmars, M.H., Souvaine, D.L., Urrutia, J.: The floodlight problem. Int. J. Comput. Geom. Appl. 7(1\/2), 153\u2013163 (1997)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. In: SWAT, pp. 96\u2013104 (1988)","DOI":"10.1007\/3-540-19487-8_10"},{"issue":"2","key":"24_CR5","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1007\/BF02770871","volume":"17","author":"SK Ghosh","year":"1997","unstructured":"Ghosh, S.K.: On recognizing and characterizing visibility graphs of simple polygons. Discr. Comput. Geomet. 17(2), 143\u2013162 (1997)","journal-title":"Discr. Comput. Geomet."},{"key":"24_CR6","unstructured":"Gibson, M., Krohn, E., Rayford, M.: Guarding monotone polygons with half-guards. In: CCCG, pp. 168\u2013173 (2017)"},{"key":"24_CR7","unstructured":"Gibson, M., Krohn, E., Wang, Q.: On the VC-dimension of visibility in monotone polygons. In: CCCG (2014)"},{"key":"24_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"541","DOI":"10.1007\/978-3-662-48971-0_46","volume-title":"Algorithms and Computation","author":"M Gibson","year":"2015","unstructured":"Gibson, M., Krohn, E., Wang, Q.: The VC-dimension of visibility on the boundary of a simple polygon. In: Elbassioni, K., Makino, K. (eds.) ISAAC 2015. LNCS, vol. 9472, pp. 541\u2013551. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-48971-0_46"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1016\/j.comgeo.2018.10.006","volume":"77","author":"M Gibson","year":"2019","unstructured":"Gibson, M., Krohn, E., Wang, Q.: The VC-dimension of visibility on the boundary of monotone polygons. Comput. Geom. 77, 62\u201372 (2019)","journal-title":"Comput. Geom."},{"key":"24_CR10","unstructured":"Gibson-Lopez, M., Yang, Z.: The VC-dimension of limited visibility terrains. In: ISAAC, vol. 212, pp. 1\u201317. Dagstuhl, Germany (2021)"},{"issue":"1","key":"24_CR11","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.comgeo.2013.08.012","volume":"47","author":"A Gilbers","year":"2014","unstructured":"Gilbers, A., Klein, R.: A new upper bound for the VC-dimension of visibility regions. Comput. Geom. 47(1), 61\u201374 (2014)","journal-title":"Comput. Geom."},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Hillberg, H.M., Krohn, E., Pahlow, A.: On the complexity of half-guarding monotone polygons. In: Castaneda, A., Rodr\u00edguez-Henr\u00edquez, F. (eds.) LATIN 2022: Theoretical Informatics. LATIN 2022. LNCS, vol. 13568. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-20624-5_46","DOI":"10.1007\/978-3-031-20624-5_46"},{"issue":"2","key":"24_CR13","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1137\/0604020","volume":"4","author":"J Kahn","year":"1983","unstructured":"Kahn, J., Klawe, M., Kleitman, D.: Traditional galleries require fewer watchmen. SIAM J. Algebr. Discrete Methods 4(2), 194\u2013206 (1983)","journal-title":"SIAM J. Algebr. Discrete Methods"},{"key":"24_CR14","unstructured":"King, J.: VC-dimension of visibility on terrains. In: CCCG (2008)"},{"key":"24_CR15","unstructured":"Krohn, E., Nilsson, B.J.: The complexity of guarding monotone polygons. In: CCCG, vol. 2012, pp. 167\u2013172 (2012)"},{"issue":"3","key":"24_CR16","doi-asserted-by":"publisher","first-page":"564","DOI":"10.1007\/s00453-012-9653-3","volume":"66","author":"E Krohn","year":"2013","unstructured":"Krohn, E., Nilsson, B.J.: Approximate guarding of monotone and rectilinear polygons. Algorithmica 66(3), 564\u2013594 (2013)","journal-title":"Algorithmica"},{"key":"24_CR17","doi-asserted-by":"crossref","unstructured":"Krohn, E.A., Nilsson, B.J.: Approximate guarding of monotone and rectilinear polygons. Algorithmica, pp. 1\u201331 (2012)","DOI":"10.1007\/s00453-012-9653-3"},{"key":"24_CR18","unstructured":"Nilsson, B., Wood, D.: Optimum watchmen routes in spiral polygons. In: CCCG, pp. 269\u2013272 (1990)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49611-0_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,10]],"date-time":"2024-02-10T09:08:25Z","timestamp":1707556105000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49611-0_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,12,9]]},"ISBN":["9783031496103","9783031496110"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49611-0_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,12,9]]},"assertion":[{"value":"9 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hawai, HI","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/theory.utdallas.edu\/COCOA2023\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"117","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"73","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"62% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"6","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}