{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T22:16:31Z","timestamp":1742940991974,"version":"3.40.3"},"publisher-location":"Cham","reference-count":24,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_46","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"761-777","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["On the\u00a0Complexity of\u00a0Half-Guarding Monotone Polygons"],"prefix":"10.1007","author":[{"given":"Hannah Miller","family":"Hillberg","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5832-8135","authenticated-orcid":false,"given":"Erik","family":"Krohn","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alex","family":"Pahlow","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"46_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)"},{"key":"46_CR2","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1142\/S0218195998000035,https:\/\/doi.org\/10.1142\/S0218195998000035","DOI":"10.1142\/S0218195998000035"},{"key":"46_CR3","unstructured":"Aggarwal, A.: The art gallery theorem: its variations, applications and algorithmic aspects. Ph.D. thesis, The Johns Hopkins University (1984)"},{"key":"46_CR4","doi-asserted-by":"crossref","unstructured":"Bhattacharya, P., Ghosh, S., Roy, B.: Approximability of guarding weak visibility polygons. Discrete Applied Mathematics 228 (02 2017)","DOI":"10.1016\/j.dam.2016.12.015"},{"key":"46_CR5","unstructured":"Bhattacharya, P., Ghosh, S.K., Pal, S.P.: Constant approximation algorithms for guarding simple polygons using vertex guards. CoRR (2017)"},{"key":"46_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/978-3-319-14974-5_5","volume-title":"Algorithms and Discrete Applied Mathematics","author":"P Bhattacharya","year":"2015","unstructured":"Bhattacharya, P., Ghosh, S.K., Roy, B.: Vertex guarding in weak visibility polygons. In: Ganguly, S., Krishnamurti, R. (eds.) Algorithms and Discrete Applied Mathematics, pp. 45\u201357. Springer International Publishing, Cham (2015)"},{"key":"46_CR7","unstructured":"Bonnet, \u00c9., Giannopoulos, P.: Orthogonal terrain guarding is np-complete. J. Comput. Geom. 10(2), 21\u201344 (2019). 10.20382\/jocg.v10i2a3, https:\/\/doi.org\/10.20382\/jocg.v10i2a3"},{"key":"46_CR8","doi-asserted-by":"publisher","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). https:\/\/doi.org\/10.1142\/S0218195997000090,https:\/\/doi.org\/10.1142\/S0218195997000090","DOI":"10.1142\/S0218195997000090"},{"issue":"6","key":"46_CR9","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1016\/j.ipl.2006.05.014","volume":"100","author":"A Efrat","year":"2006","unstructured":"Efrat, A., Har-Peled, S.: Guarding galleries and terrains. Information Processing Letters 100(6), 238\u2013245 (2006)","journal-title":"Information Processing Letters"},{"key":"46_CR10","doi-asserted-by":"crossref","unstructured":"Eidenbenz, S.: Inapproximability results for guarding polygons without holes. In: ISAAC. pp. 427\u2013436 (1998)","DOI":"10.1007\/3-540-49381-6_45"},{"key":"46_CR11","doi-asserted-by":"crossref","unstructured":"Elbassioni, K.M., Krohn, E., Matijevic, D., Mestre, J., Severdija, D.: Improved approximations for guarding 1.5-dimensional terrains. Algorithmica 60(2), 451\u2013463 (2011)","DOI":"10.1007\/s00453-009-9358-4"},{"key":"46_CR12","doi-asserted-by":"publisher","unstructured":"Estivill-Castro, V., O\u2019Rourke, J., Urrutia, J., Xu, D.: Illumination of polygons with vertex lights. Inf. Process. Lett. 56(1), 9\u201313 (1995). https:\/\/doi.org\/10.1016\/0020-0190(95)00129-Z,https:\/\/doi.org\/10.1016\/0020-0190(95)00129-Z","DOI":"10.1016\/0020-0190(95)00129-Z"},{"issue":"2","key":"46_CR13","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. Discrete & Computational Geometry 17(2), 143\u2013162 (1997). https:\/\/doi.org\/10.1007\/BF02770871","journal-title":"Discrete & Computational Geometry"},{"key":"46_CR14","unstructured":"Gibson, M., Krohn, E., Rayford, M.: Guarding monotone polygons with vertex half-guards is np-hard. European Workshop on Computational Geometry (2018), https:\/\/conference.imp.fu-berlin.de\/eurocg18\/program"},{"key":"46_CR15","unstructured":"Gibson, M., Krohn, E., Rayford, M.: Guarding monotone polygons with half-guards. In: Gudmundsson, J., Smid, M.H.M. (eds.) Proceedings of the 29th Canadian Conference on Computational Geometry, CCCG 2017, July 26\u201328, 2017, Carleton University, Ottawa, Ontario, Canada. pp. 168\u2013173 (2017)"},{"issue":"5","key":"46_CR16","doi-asserted-by":"publisher","first-page":"1316","DOI":"10.1137\/100791506","volume":"40","author":"J King","year":"2011","unstructured":"King, J., Krohn, E.: Terrain guarding is np-hard. SIAM J. Comput. 40(5), 1316\u20131339 (2011)","journal-title":"SIAM J. Comput."},{"key":"46_CR17","unstructured":"Krohn, E.: Survey of terrain guarding and art gallery problems. Comprehensive Exam, University of Iowa (11 2007), http:\/\/faculty.cs.uwosh.edu\/faculty\/krohn\/papers\/comprehensive.pdf"},{"key":"46_CR18","unstructured":"Krohn, E., Nilsson, B.J.: The complexity of guarding monotone polygons. In: CCCG. pp. 167\u2013172 (2012)"},{"issue":"3","key":"46_CR19","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"},{"issue":"2","key":"46_CR20","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. Inform. Theory 32(2), 276\u2013282 (1986)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"46_CR21","volume-title":"Art gallery theorems and algorithms","author":"J O\u2019Rourke","year":"1987","unstructured":"O\u2019Rourke, J.: Art gallery theorems and algorithms, vol. 57. Oxford New York, NY, USA (1987)"},{"issue":"2","key":"46_CR22","doi-asserted-by":"publisher","first-page":"345","DOI":"10.1007\/s00454-004-1091-9","volume":"33","author":"B Speckmann","year":"2005","unstructured":"Speckmann, B., T\u00f3th, C.D.: Allocating vertex $$\\pi $$-guards in simple polygons via pseudo-triangulations. Discrete & Computational Geometry 33(2), 345\u2013364 (2005)","journal-title":"Discrete & Computational Geometry"},{"issue":"3","key":"46_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1016\/S0925-7721(01)00024-4","volume":"21","author":"CD T\u00f3th","year":"2002","unstructured":"T\u00f3th, C.D.: Art galleries with guards of uniform range of vision. Computational Geometry 21(3), 185\u2013192 (2002)","journal-title":"Computational Geometry"},{"key":"46_CR24","doi-asserted-by":"publisher","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131027. North Holland \/ Elsevier (2000). https:\/\/doi.org\/10.1016\/b978-044482537-7\/50023-1,https:\/\/doi.org\/10.1016\/b978-044482537-7\/50023-1","DOI":"10.1016\/b978-044482537-7\/50023-1 10.1016\/b978-044482537-7\/50023-1"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_46","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:08:37Z","timestamp":1667084917000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_46"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_46","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","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":"46","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":"40% - 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":"4","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":"8.7","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)"}}]}}