{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T06:29:25Z","timestamp":1774333765048,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":22,"publisher":"Springer Nature Singapore","isbn-type":[{"value":"9789819571260","type":"print"},{"value":"9789819571277","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-981-95-7127-7_32","type":"book-chapter","created":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T10:07:17Z","timestamp":1770977237000},"page":"483-498","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["The Gate-Cover Problem"],"prefix":"10.1007","author":[{"given":"Esther M.","family":"Arkin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alon","family":"Efrat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Omrit","family":"Filtser","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stephen","family":"Kobourov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Kratochv\u00edl","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Joseph S. B.","family":"Mitchell","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Rosenberg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,2,14]]},"reference":[{"issue":"2","key":"32_CR1","doi-asserted-by":"publisher","first-page":"621","DOI":"10.1007\/S00373-020-02272-8","volume":"37","author":"H Alpert","year":"2021","unstructured":"Alpert, H., Rold\u00e1n, \u00c9.: Art gallery problem with rook and queen vision. Graphs Comb. 37(2), 621\u2013642 (2021). https:\/\/doi.org\/10.1007\/S00373-020-02272-8","journal-title":"Graphs Comb."},{"key":"32_CR2","doi-asserted-by":"publisher","unstructured":"Aschner, R., Katz, M.J., Morgenstern, G., Yuditsky, Y.: Approximation schemes for covering and packing. In: WALCOM: Algorithms and Computation (2013). https:\/\/doi.org\/10.1007\/978-3-642-36065-7_10","DOI":"10.1007\/978-3-642-36065-7_10"},{"key":"32_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-319-53925-6_5","volume-title":"WALCOM: Algorithms and Computation","author":"T Biedl","year":"2017","unstructured":"Biedl, T., Chan, T.M., Lee, S., Mehrabi, S., Montecchiani, F., Vosoughpour, H.: On guarding orthogonal polygons with sliding cameras. In: Poon, S.-H., Rahman, M.S., Yen, H.-C. (eds.) WALCOM 2017. LNCS, vol. 10167, pp. 54\u201365. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53925-6_5"},{"key":"32_CR4","doi-asserted-by":"publisher","unstructured":"Biedl, T., Irfan, M.T., Iwerks, J., Kim, J., Mitchell, J.S.: Guarding polyominoes. In: Proceedings of the 27th Annual Symposium on Computational Geometry (SoCG), pp. 387\u2013396. Association for Computing Machinery (2011). https:\/\/doi.org\/10.1145\/1998196.1998261","DOI":"10.1145\/1998196.1998261"},{"key":"32_CR5","unstructured":"Biedl, T., Mehrabi, S.: On r-Guarding thin orthogonal polygons. In: 27th International Symposium on Algorithms and Computation (ISAAC 2016), pp. 17:1\u201317:13. Leibniz International Proceedings in Informatics (LIPIcs) (2016)"},{"issue":"2","key":"32_CR6","doi-asserted-by":"publisher","first-page":"373","DOI":"10.1007\/S00454-012-9417-5","volume":"48","author":"TM Chan","year":"2012","unstructured":"Chan, T.M., Har-Peled, S.: Approximation algorithms for maximum independent set of pseudo-disks. Discret. Comput. Geom. 48(2), 373\u2013392 (2012). https:\/\/doi.org\/10.1007\/S00454-012-9417-5","journal-title":"Discret. Comput. Geom."},{"key":"32_CR7","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. In: 63rd IEEE Annual Symposium on Foundations of Computer Science, FOCS, pp. 612\u2013623. IEEE (2022). https:\/\/doi.org\/10.1109\/FOCS54457.2022.00064","DOI":"10.1109\/FOCS54457.2022.00064"},{"key":"32_CR8","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/j.tcs.2021.06.012","volume":"882","author":"O Daescu","year":"2021","unstructured":"Daescu, O., Malik, H.: New bounds on guarding problems for orthogonal polygons in the plane using vertex guards with halfplane vision. Theoret. Comput. Sci. 882, 63\u201376 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2021.06.012","journal-title":"Theoret. Comput. Sci."},{"key":"32_CR9","doi-asserted-by":"publisher","unstructured":"Fabris, M., Ceccato, R., Zanella, A.: Efficient sensors selection for traffic flow monitoring: An overview of model-based techniques leveraging network observability. Sensors 25(5) (2025). https:\/\/doi.org\/10.3390\/s25051416, https:\/\/www.mdpi.com\/1424-8220\/25\/5\/1416","DOI":"10.3390\/s25051416"},{"issue":"2","key":"32_CR10","doi-asserted-by":"publisher","first-page":"268","DOI":"10.1007\/S00224-016-9744-7","volume":"62","author":"SP Fekete","year":"2018","unstructured":"Fekete, S.P., Huang, K., Mitchell, J.S.B., Parekh, O., Phillips, C.A.: Geometric hitting set for segments of few orientations. Theory Comput. Syst. 62(2), 268\u2013303 (2018). https:\/\/doi.org\/10.1007\/S00224-016-9744-7","journal-title":"Theory Comput. Syst."},{"issue":"3","key":"32_CR11","doi-asserted-by":"publisher","first-page":"266","DOI":"10.1007\/BF01190507","volume":"13","author":"MR Fellows","year":"1995","unstructured":"Fellows, M.R., Kratochv\u00edl, J., Middendorf, M., Pfeiffer, F.: The complexity of induced minors and related problems. Algorithmica 13(3), 266\u2013282 (1995). https:\/\/doi.org\/10.1007\/BF01190507","journal-title":"Algorithmica"},{"issue":"4","key":"32_CR12","doi-asserted-by":"publisher","first-page":"572","DOI":"10.1007\/S00453-024-01292-7","volume":"87","author":"O Filtser","year":"2025","unstructured":"Filtser, O., Krohn, E., Nilsson, B.J., Rieck, C., Schmidt, C.: Guarding polyominoes under k-hop visibility. Algorithmica 87(4), 572\u2013593 (2025). https:\/\/doi.org\/10.1007\/S00453-024-01292-7","journal-title":"Algorithmica"},{"key":"32_CR13","first-page":"109","volume":"63","author":"H de Fraysseix","year":"1991","unstructured":"de Fraysseix, H., de Mendez, P.O., Pach, J.: Representation of planar graphs by segments. Intuitive Geom. 63, 109\u2013117 (1991)","journal-title":"Intuitive Geom."},{"key":"32_CR14","doi-asserted-by":"publisher","first-page":"13","DOI":"10.1016\/J.COMGEO.2016.07.003","volume":"59","author":"E Gy\u00f6ri","year":"2016","unstructured":"Gy\u00f6ri, E., Mezei, T.R.: Partitioning orthogonal polygons into $$\\le $$ 8-vertex pieces, with application to an art gallery theorem. Comput. Geom. 59, 13\u201325 (2016). https:\/\/doi.org\/10.1016\/J.COMGEO.2016.07.003","journal-title":"Comput. Geom."},{"issue":"4","key":"32_CR15","doi-asserted-by":"publisher","first-page":"883","DOI":"10.1007\/S00454-010-9285-9","volume":"44","author":"NH Mustafa","year":"2010","unstructured":"Mustafa, N.H., Ray, S.: Improved results on geometric hitting set problems. Discret. Comput. Geom. 44(4), 883\u2013895 (2010). https:\/\/doi.org\/10.1007\/S00454-010-9285-9","journal-title":"Discret. Comput. Geom."},{"key":"32_CR16","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 Inc, USA (1987)"},{"key":"32_CR17","doi-asserted-by":"publisher","DOI":"10.1016\/j.comgeo.2023.102054","volume":"117","author":"C Rieck","year":"2024","unstructured":"Rieck, C., Scheffer, C.: The dispersive art gallery problem. Comput. Geom. 117, 102054 (2024)","journal-title":"Comput. Geom."},{"key":"32_CR18","unstructured":"Rosenberg, A.: The gate cover problem in thin polyomino simulator. https:\/\/arikrosen.pythonanywhere.com\/"},{"issue":"9","key":"32_CR19","doi-asserted-by":"publisher","first-page":"1384","DOI":"10.1109\/5.163407","volume":"80","author":"TC Shermer","year":"1992","unstructured":"Shermer, T.C.: Recent results in art galleries (geometry). Proc. IEEE 80(9), 1384\u20131399 (1992). https:\/\/doi.org\/10.1109\/5.163407","journal-title":"Proc. IEEE"},{"issue":"6","key":"32_CR20","doi-asserted-by":"publisher","first-page":"1186","DOI":"10.1016\/j.icte.2024.10.007","volume":"10","author":"AS Thabit","year":"2024","unstructured":"Thabit, A.S., Kerrache, C.A., Calafate, C.T.: A survey on monitoring and management techniques for road traffic congestion in vehicular networks. ICT Express 10(6), 1186\u20131198 (2024). https:\/\/doi.org\/10.1016\/j.icte.2024.10.007","journal-title":"ICT Express"},{"key":"32_CR21","doi-asserted-by":"publisher","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Sack, J.R., Urrutia, J. (eds.) Handbook of Computational Geometry, pp. 973\u20131027. North-Holland, Amsterdam (2000). https:\/\/doi.org\/10.1016\/B978-044482537-7\/50023-1","DOI":"10.1016\/B978-044482537-7\/50023-1"},{"issue":"3","key":"32_CR22","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1137\/0138030","volume":"38","author":"M Yannakakis","year":"1980","unstructured":"Yannakakis, M., Gavril, F.: Edge dominating sets in graphs. SIAM J. Appl. Math. 38(3), 364\u2013372 (1980)","journal-title":"SIAM J. Appl. Math."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-95-7127-7_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,24]],"date-time":"2026-03-24T04:08:53Z","timestamp":1774325333000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-95-7127-7_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9789819571260","9789819571277"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-981-95-7127-7_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"14 February 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"The authors have no competing interests to declare that are relevant to the content of this article.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Disclosure of Interests"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference and Workshops on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Perugia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 March 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 March 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/mozart.diei.unipg.it\/walcom2026","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}