{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:18:01Z","timestamp":1761175081401,"version":"build-2065373602"},"reference-count":11,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f4752","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"789-794","source":"Crossref","is-referenced-by-count":0,"title":["Improved upper bounds on the shortest watchman route in simple polygons: Dependence on reflex vertices and triangulation strategies"],"prefix":"10.15439","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8308-4304","authenticated-orcid":true,"given":"Lubom\u00edr","family":"\u0160t\u011bp\u00e1nek","sequence":"first","affiliation":[{"name":"Institute of Biophysics and Informatics, First Faculty of Medicine, Charles University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","doi-asserted-by":"crossref","unstructured":"S. Carlsson, H. Jonsson, and B. J. Nilsson. \u201cFinding the \n\tShortest Watchman Route in a Simple Polygon\u201d. In: Discrete \n\t& Computational Geometry 22.3 (Oct. 1999), pp. 377\u2013402. \n\tISSN: 0179-5376. DOI: 10.1007\/pl00009467.","DOI":"10.1007\/PL00009467"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"X. Tan. \u201cFast computation of shortest watchman routes in \n\tsimple polygons\u201d. In: Information Processing Letters 77.1 \n\t(Jan. 2001), pp. 27\u201333. ISSN : 0020-0190. DOI: 10.1016\/s0020-0190(00)00146-0.","DOI":"10.1016\/S0020-0190(00)00146-0"},{"key":"ref3","doi-asserted-by":"crossref","unstructured":"W.-P. Chin and S. Ntafos. \u201cShortest watchman routes in simple \n\tpolygons\u201d. In: Discrete & Computational Geometry 6.1 (Mar. \n\t1991), pp. 9\u201331. ISSN : 1432-0444. DOI : 10.1007\/bf02574671.","DOI":"10.1007\/BF02574671"},{"key":"ref4","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell. \u201cApproximating Watchman Routes\u201d. In: \n\tProceedings of the Twenty-Fourth Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and \n\tApplied Mathematics, Jan. 2013, pp. 844\u2013855. DOI: 10.1137\/1.9781611973105.60.","DOI":"10.1137\/1.9781611973105.60"},{"key":"ref5","doi-asserted-by":"crossref","unstructured":"A. Dumitrescu and C. D. T\u00f3th. \u201cWatchman tours for polygons \n\twith holes\u201d. In: Computational Geometry 45.7 (Aug. 2012), \n\tpp. 326\u2013333. ISSN: 0925-7721. DOI: 10.1016\/j.comgeo.2012. \n\t02.001.","DOI":"10.1016\/j.comgeo.2012.02.001"},{"key":"ref6","doi-asserted-by":"crossref","unstructured":"J. Faigl. \u201cApproximate Solution of the Multiple Watchman \n\tRoutes Problem With Restricted Visibility Range\u201d. In: IEEE \n\tTransactions on Neural Networks 21.10 (Oct. 2010), pp. 1668\u20131679. ISSN: 1941-0093. DOI: 10.1109\/tnn.2010.2070518.","DOI":"10.1109\/TNN.2010.2070518"},{"key":"ref7","doi-asserted-by":"crossref","unstructured":"J. Mikula and M. Kulich. \u201cTowards a Continuous Solution of \n\tthe d-Visibility Watchman Route Problem in a Polygon With \n\tHoles\u201d. In: IEEE Robotics and Automation Letters 7.3 (July \n\t2022), pp. 5934\u20135941. ISSN : 2377-3774. DOI : 10.1109\/lra.2022.3159824.","DOI":"10.1109\/LRA.2022.3159824"},{"key":"ref8","doi-asserted-by":"crossref","unstructured":"B. J. Nilsson and E. Packer. \u201cApproximation Algorithms for \n\tthe Two-Watchman Route in a Simple Polygon\u201d. In: Algorithmica 86.9 (June 2024), pp. 2845\u20132884. ISSN: 1432-0541. DOI: 10.1007\/s00453-024-01245-0.","DOI":"10.1007\/s00453-024-01245-0"},{"key":"ref9","doi-asserted-by":"crossref","unstructured":"L. \u0160t\u011bp\u00e1nek, F. Habarta, I. Mal\u00e1, and L. Marek. \u201cA lower \n\tbound for proportion of visibility polygon\u2019s surface to entire \n\tpolygon\u2019s surface: Estimated by Art Gallery Problem and \n\tproven that cannot be greatly improved\u201d. In: Proceedings of \n\tthe 18th Conference on Computer Science and Intelligence \n\tSystems. Vol. 35. FedCSIS 2023. IEEE, Sept. 2023, pp. 1229\u20131233. DOI: 10.15439\/2023f4335.","DOI":"10.15439\/2023F4335"},{"key":"ref10","doi-asserted-by":"crossref","unstructured":"L. \u0160t\u011bp\u00e1nek, F. Habarta, I. Mal\u00e1, and L. Marek. \u201cA Proportion \n\tof Visibility Polygon\u2019s Surface to the Entire Polygon\u2019s Surface: A Lower Bound of the Proportion Derived for General \n\tPolygons of Any Shape and Orthogonal Polygons\u201d. In: Recent \n\tAdvances in Computational Optimization. Springer Nature \n\tSwitzerland, 2025, pp. 73\u201398. ISBN: 9783031747588. DOI: 10.1007\/978-3-031-74758-8_4.","DOI":"10.1007\/978-3-031-74758-8_4"},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"C. Lavor, L. Liberti, N. Maculan, and A. Mucherino. \u201cThe \n\tdiscretizable molecular distance geometry problem\u201d. In: Computational Optimization and Applications 52.1 (Mar. 2011), \n\tpp. 115\u2013146. ISSN: 1573-2894. DOI: 10.1007\/s10589-011-9402-6. URL: http:\/\/dx.doi.org\/10.1007\/s10589-011-9402-6.","DOI":"10.1007\/s10589-011-9402-6"}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:51:52Z","timestamp":1761119512000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/4752.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":11,"URL":"https:\/\/doi.org\/10.15439\/2025f4752","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}