{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:05:54Z","timestamp":1740107154567,"version":"3.37.3"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T00:00:00Z","timestamp":1582156800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/501100005739","name":"Universidad Nacional Aut\u00f3noma de M\u00e9xico","doi-asserted-by":"publisher","award":["PAPIIT Grant IN102117"],"award-info":[{"award-number":["PAPIIT Grant IN102117"]}],"id":[{"id":"10.13039\/501100005739","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Graphs and Combinatorics"],"published-print":{"date-parts":[[2020,5]]},"DOI":"10.1007\/s00373-020-02141-4","type":"journal-article","created":{"date-parts":[[2020,2,20]],"date-time":"2020-02-20T07:02:58Z","timestamp":1582182178000},"page":"617-630","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Tight Bounds for Illuminating and Covering of Orthotrees with Vertex Lights and Vertex Beacons"],"prefix":"10.1007","volume":"36","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0842-0806","authenticated-orcid":false,"given":"I.","family":"Aldana-Galv\u00e1n","sequence":"first","affiliation":[]},{"given":"J. L.","family":"\u00c1lvarez-Rebollar","sequence":"additional","affiliation":[]},{"given":"J. C.","family":"Catana-Salazar","sequence":"additional","affiliation":[]},{"given":"N.","family":"Mar\u00edn","sequence":"additional","affiliation":[]},{"given":"E.","family":"Sol\u00eds-Villarreal","sequence":"additional","affiliation":[]},{"given":"J.","family":"Urrutia","sequence":"additional","affiliation":[]},{"given":"C.","family":"Velarde","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,2,20]]},"reference":[{"key":"2141_CR1","unstructured":"Aldana-Galv\u00e1n, I., \u00c1lvarez-Rebollar, J.L., Catana-Salazar, J.C., Jim\u00e9nez-Salinas, M., Sol\u00eds-Villarreal, E., Urrutia, J.: Minimizing the solid angle sum of orthogonal polyhedra and guarding them with $$\\frac{\\pi }{2}$$-edge guards. In: Proceedings of the 28th Canadian Conference on Computational Geometry, Vancouver, August 3-5, pp. 175\u2013181 (2016)"},{"key":"2141_CR2","unstructured":"Aldana-Galv\u00e1n, I., \u00c1lvarez-Rebollar, J.L., Catana-Salazar, J.C., Mar\u00edn-Nev\u00e1rez, N., Sol\u00eds-Villarreal, E., Urrutia, J., Velarde, C.: Covering orthotrees with guards and beacons. In: In proceedings of XVII Spanish Meeting on Computational Geometry, Alicante, Spain, July 26\u201328, pp. 56\u201368 (2017)"},{"key":"2141_CR3","doi-asserted-by":"publisher","unstructured":"Bae, S.W., Shin, C.S., Vigneron, A.E.: Tight bounds for beacon-based coverage in simple rectilinear polygons. To appear in Computational Geometry (2019). https:\/\/doi.org\/10.1016\/j.comgeo.2019.02.002","DOI":"10.1016\/j.comgeo.2019.02.002"},{"key":"2141_CR4","unstructured":"Benbernou, N.M., Demaine, E.D., Demaine, M.L., Kurdia, A., O\u2019Rourke, J., Toussaint, G., Urrutia, J., Viglietta, G.: Edge-guarding orthogonal polyhedra. In: Proceedings of the 23rd Canadian Conference on Computational Geometry, Toronto, August 10\u201312, pp. 461\u2013466 (2011)"},{"key":"2141_CR5","unstructured":"Biro, M.: Beacon-based routing and guarding. Ph.D. thesis, State University of New York at Stony Brook (2013)"},{"key":"2141_CR6","unstructured":"Biro, M., Gao, J., Iwerks, J.B., Kostitsyna, I., Mitchell, J.S.: Beacon-based routing and coverage. In: 21st Fall Workshop on Computational Geometry, New York, November 4\u20135 (2011)"},{"issue":"1","key":"2141_CR7","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 Ser B 18(1), 39\u201341 (1975)","journal-title":"J. Comb Theory Ser B"},{"key":"2141_CR8","doi-asserted-by":"crossref","unstructured":"Cleve, J.: Combinatorics of beacon-based routing and guarding in three dimensions. Master\u2019s thesis, Freie Universit\u00e4t Berlin (2017)","DOI":"10.1007\/978-3-319-77404-6_26"},{"key":"2141_CR9","doi-asserted-by":"crossref","unstructured":"Cleve, J., Mulzer, W.: Combinatorics of beacon-based routing in three dimensions. In: Latin American Symposium on Theoretical Informatics, Buenos Aires, April 16-19, pp. 346\u2013360. Springer (2018)","DOI":"10.1007\/978-3-319-77404-6_26"},{"key":"2141_CR10","unstructured":"Damian, M., Flatland, R.: Unfolding low-degree orthotrees with constant refinement. In: 30th Canadian Conference on Computational Geometry, Winnipeg, August 8\u201310. Elsevier (2018)"},{"key":"2141_CR11","unstructured":"Damian, M., Flatland, R.: Unfolding orthotrees with constant refinement. arXiv preprint arXiv:1811.01842 (2018)"},{"key":"2141_CR12","unstructured":"Iwerks, J.G.: Combinatorics and complexity in geometric visibility problems. Ph.D. thesis, State University of New York at Stony Brook (2012)"},{"key":"2141_CR13","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 University Press Inc., New York (1987)"},{"key":"2141_CR14","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. Proc. IEEE 80, 1384\u20131384 (1992)","journal-title":"Proc. IEEE"},{"key":"2141_CR15","unstructured":"Shermer, T.C.: A combinatorial bound for beacon-based routing in orthogonal polygons. (2015) arXiv:1507.03509"},{"key":"2141_CR16","unstructured":"Shermer, T.C.: A combinatorial bound for beacon-based routing in orthogonal polygons. In: Proceedings of the 27th Canadian Conference on Computational Geometry, Kingston, Ontario, August 10\u201312, pp. 213\u2013219 (2015)"},{"key":"2141_CR17","doi-asserted-by":"crossref","unstructured":"Tom\u00e1s, A.P.: Guarding thin orthogonal polygons is hard. In: International Symposium on Fundamentals of Computation Theory, pp. 305\u2013316. Springer (2013)","DOI":"10.1007\/978-3-642-40164-0_29"},{"key":"2141_CR18","doi-asserted-by":"crossref","unstructured":"Urrutia, J.: Art gallery and illumination problems. In: Handbook of computational geometry, pp. 973\u20131027. Elsevier (2000)","DOI":"10.1016\/B978-044482537-7\/50023-1"},{"key":"2141_CR19","unstructured":"Viglietta, G.: Guarding and searching polyhedra. Ph.D. thesis, University of Pisa (2012)"},{"issue":"8","key":"2141_CR20","doi-asserted-by":"publisher","first-page":"833","DOI":"10.1016\/j.comgeo.2014.04.009","volume":"47","author":"G Viglietta","year":"2014","unstructured":"Viglietta, G.: Face-guarding polyhedra. Comput. Geom. 47(8), 833\u2013846 (2014)","journal-title":"Comput. Geom."}],"container-title":["Graphs and Combinatorics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02141-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00373-020-02141-4\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00373-020-02141-4.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,16]],"date-time":"2022-10-16T02:28:54Z","timestamp":1665887334000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00373-020-02141-4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,2,20]]},"references-count":20,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2020,5]]}},"alternative-id":["2141"],"URL":"https:\/\/doi.org\/10.1007\/s00373-020-02141-4","relation":{},"ISSN":["0911-0119","1435-5914"],"issn-type":[{"type":"print","value":"0911-0119"},{"type":"electronic","value":"1435-5914"}],"subject":[],"published":{"date-parts":[[2020,2,20]]},"assertion":[{"value":"3 April 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"13 November 2019","order":2,"name":"revised","label":"Revised","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 February 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}