{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T19:38:33Z","timestamp":1743104313260,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"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_43","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"713-729","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On r-Guarding SCOTs \u2013 A\u00a0New Family of\u00a0Orthogonal Polygons"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4263-9382","authenticated-orcid":false,"given":"Vasco","family":"Cruz","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1776-4897","authenticated-orcid":false,"given":"Ana Paula","family":"Tom\u00e1s","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"issue":"3","key":"43_CR1","doi-asserted-by":"publisher","first-page":"711","DOI":"10.1007\/s00454-012-9429-1","volume":"48","author":"T Biedl","year":"2012","unstructured":"Biedl, T., Irfan, M.T., Iwerks, J., Kim, J., Mitchell, J.S.B.: The art gallery theorem for polyominoes. Discrete Comput. Geom. 48(3), 711\u2013720 (2012). https:\/\/doi.org\/10.1007\/s00454-012-9429-1","journal-title":"Discrete Comput. Geom."},{"key":"43_CR2","unstructured":"Biedl, T., Mehrabi, S.: On $$r$$-Guarding thin orthogonal polygons. arXiv preprint arXiv:1604.07100 (2016), (extended version of ISAAC\u20192016)"},{"issue":"2","key":"43_CR3","doi-asserted-by":"publisher","first-page":"641","DOI":"10.1007\/s00453-020-00769-5","volume":"83","author":"T Biedl","year":"2020","unstructured":"Biedl, T., Mehrabi, S.: On orthogonally guarding orthogonal polygons with bounded treewidth. Algorithmica 83(2), 641\u2013666 (2020). https:\/\/doi.org\/10.1007\/s00453-020-00769-5","journal-title":"Algorithmica"},{"key":"43_CR4","doi-asserted-by":"publisher","unstructured":"Biedl, T.C., Irfan, M.T., Iwerks, J., Kim, J., Mitchell, J.S.B.: Guarding polyominoes. In: Proceedings of the 27th ACM Symposium on Computational Geometry, SoCG 2011. pp. 387\u2013396. ACM (2011). https:\/\/doi.org\/10.1145\/1998196.1998261","DOI":"10.1145\/1998196.1998261"},{"key":"43_CR5","doi-asserted-by":"publisher","unstructured":"Chen, L., Kyng, R., Liu, Y.P., Peng, R., Gutenberg, M.P., Sachdeva, S.: Maximum flow and minimum-cost flow in almost-linear time. arXiv preprint arXiv:2203.00671 (2022). https:\/\/doi.org\/10.48550\/arXiv.2203.00671","DOI":"10.48550\/arXiv.2203.00671"},{"issue":"1","key":"43_CR6","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 Series B 18(1), 39\u201341 (1975)","journal-title":"J. Comb. Theory Series B"},{"key":"43_CR7","unstructured":"Cruz, V.: Algorithms for art gallery problems. Master\u2019s thesis, Universidade do Porto (2022), https:\/\/hdl.handle.net\/10216\/142907"},{"key":"43_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1007\/11685654_10","volume-title":"Theoretical Computer Science","author":"Y Dinitz","year":"2006","unstructured":"Dinitz, Y.: Dinitz\u2019 algorithm: the original version and Even\u2019s version. In: Goldreich, O., Rosenberg, A.L., Selman, A.L. (eds.) Theoretical Computer Science. LNCS, vol. 3895, pp. 218\u2013240. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11685654_10"},{"key":"43_CR9","unstructured":"Erickson, J.: Algorithms - Lecture 25: Extensions of maximum flow, lecture notes (2015). https:\/\/courses.engr.illinois.edu\/cs498dl1\/sp2015\/notes\/25-maxflowext.pdf. Accessed Aug 2022"},{"issue":"4","key":"43_CR10","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1137\/0202019","volume":"2","author":"JE Hopcroft","year":"1973","unstructured":"Hopcroft, J.E., Karp, R.M.: An $$n^{5\/2}$$ algorithm for maximum matchings in bipartite graphs. SIAM J. Comput. 2(4), 225\u2013231 (1973). https:\/\/doi.org\/10.1137\/0202019","journal-title":"SIAM J. Comput."},{"key":"43_CR11","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). https:\/\/doi.org\/10.1007\/978-3-319-13287-7_8"},{"issue":"2","key":"43_CR12","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. Algebraic Discrete Methods 4(2), 194\u2013206 (1983)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"3","key":"43_CR13","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. 39(3), 219\u2013228 (2008)","journal-title":"Comput. Geom."},{"key":"43_CR14","volume-title":"Algorithm Design","author":"J Kleinberg","year":"2006","unstructured":"Kleinberg, J., Tardos, E.: Algorithm Design. Addison-Wesley, Pearson Education (2006)"},{"issue":"2","key":"43_CR15","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1109\/TIT.1986.1057165","volume":"32","author":"D Lee","year":"1986","unstructured":"Lee, D., Lin, A.: Computational complexity of art gallery problems. IEEE Trans. Inf. Theory 32(2), 276\u2013282 (1986). https:\/\/doi.org\/10.1109\/TIT.1986.1057165","journal-title":"IEEE Trans. Inf. Theory"},{"key":"43_CR16","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 (1987)"},{"issue":"2","key":"43_CR17","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. Log. Q. 41(2), 261\u2013267 (1995). https:\/\/doi.org\/10.1002\/malq.19950410212","journal-title":"Math. Log. Q."},{"key":"43_CR18","doi-asserted-by":"publisher","unstructured":"Tom\u00e1s, A.P.: Guarding thin orthogonal polygons is hard. In: Gasieniec, L., Wolter, F. (eds.) FCT 2013. LNCS, vol. 8070, pp. 305\u2013316. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40164-0_29","DOI":"10.1007\/978-3-642-40164-0_29"},{"key":"43_CR19","unstructured":"Urrutia, J.: Sixth Proof of the Orthogonal Art Gallery Theorem. Technical report TR-97-03. Department of Computer Science, University of Ottawa, February 1997. http:\/\/www.math.unam.mx\/~urrutia\/online_papers\/IllumOrt.pdf. Accessed Oct 2022"},{"issue":"02","key":"43_CR20","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(02), 105\u2013138 (2007). https:\/\/doi.org\/10.1142\/S0218195907002264","journal-title":"Int. J. Comput. Geom. Appl."}],"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_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:08:50Z","timestamp":1667084930000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_43","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)"}}]}}