{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:42:27Z","timestamp":1763415747378,"version":"3.40.3"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031744976"},{"type":"electronic","value":"9783031744983"}],"license":[{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,10,20]],"date-time":"2024-10-20T00:00:00Z","timestamp":1729382400000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-74498-3_12","type":"book-chapter","created":{"date-parts":[[2024,10,19]],"date-time":"2024-10-19T11:02:30Z","timestamp":1729335750000},"page":"161-176","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Optimal Algorithm for\u00a0Geodesic Mutual Visibility on\u00a0Hexagonal Grids"],"prefix":"10.1007","author":[{"given":"Sahar","family":"Badri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Serafino","family":"Cicerone","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alessia","family":"Di Fonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,10,20]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Adhikary, R., Bose, K., Kundu, M.K., Sau, B.: Mutual visibility by asynchronous robots on infinite grid. In: Algorithms for Sensor Systems\u2014ALGOSENSORS 2018. LNCS, vol. 11410, pp. 83\u2013101. Springer (2018). https:\/\/doi.org\/10.1007\/978-3-030-14094-6_6","key":"12_CR1","DOI":"10.1007\/978-3-030-14094-6_6"},{"doi-asserted-by":"publisher","unstructured":"Bose, K., Adhikary, R., Kundu, M.K., Sau, B.: Arbitrary pattern formation on infinite grid by asynchronous oblivious robots. Theor. Comput. Sci. 815, 213\u2013227 (202https:\/\/doi.org\/10.1016\/J.TCS.2020.02.016","key":"12_CR2","DOI":"10.1016\/J.TCS.2020.02.016"},{"key":"12_CR3","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2023.128411","volume":"465","author":"B Bre\u0161ar","year":"2024","unstructured":"Bre\u0161ar, B., Yero, I.G.: Lower (total) mutual-visibility number in graphs. Appl. Math. Comput. 465, 128411 (2024). https:\/\/doi.org\/10.1016\/j.amc.2023.128411","journal-title":"Appl. Math. Comput."},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: Arbitrary pattern formation on infinite regular tessellation graphs. Theor. Comput. Sci. 942, 1\u201320 (2023https:\/\/doi.org\/10.1016\/j.tcs.2022.11.021","key":"12_CR4","DOI":"10.1016\/j.tcs.2022.11.021"},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: The geodesic mutual visibility problem for oblivious robots: the case of trees. In: 24th International Conference on Distributed Computing and Networking, ICDCN 2023, pp. 150\u2013159. ACM (2023). https:\/\/doi.org\/10.1145\/3571306.3571401","key":"12_CR5","DOI":"10.1145\/3571306.3571401"},{"key":"12_CR6","doi-asserted-by":"publisher","DOI":"10.1016\/j.pmcj.2023.101842","volume":"95","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: The geodesic mutual visibility problem: Oblivious robots on grids and trees. Pervasive Mob. Comput. 95, 101842 (2023). https:\/\/doi.org\/10.1016\/j.pmcj.2023.101842","journal-title":"Pervasive Mob. Comput."},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di\u00a0Fonso, A., Di\u00a0Stefano, G., Navarra, A.: Time-optimal geodesic mutual visibility of robots on grids within minimum area. In: Proceedings of the Stabilization, Safety, and Security of Distributed Systems, pp. 385\u2013399. Springer (2023). https:\/\/doi.org\/10.1007\/978-3-031-44274-2_29","key":"12_CR7","DOI":"10.1007\/978-3-031-44274-2_29"},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di\u00a0Fonso, A., Di\u00a0Stefano, G., Navarra, A., Piselli, F.: Mutual Visibility in Hypercube-Like Graphs. In: Structural Information and Communication Complexity\u2014SIROCCO 2024. LNCS, vol. 14662, pp. 192\u2013207. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-60603-8_11","key":"12_CR8","DOI":"10.1007\/978-3-031-60603-8_11"},{"key":"12_CR9","doi-asserted-by":"publisher","first-page":"104","DOI":"10.1016\/J.PROCS.2023.08.219","volume":"223","author":"S Cicerone","year":"2023","unstructured":"Cicerone, S., Di Stefano, G.: Mutual-visibility in distance-hereditary graphs: a linear-time algorithm. Procedia Comput. Sci. 223, 104\u2013111 (2023). https:\/\/doi.org\/10.1016\/J.PROCS.2023.08.219","journal-title":"Procedia Comput. Sci."},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Stefano, G., Klav\u017ear, S.: On the mutual visibility in cartesian products and triangle-free graphs. Appl. Math. Comput. 438, 127619 (2023). https:\/\/doi.org\/10.1016\/j.amc.2022.127619","key":"12_CR10","DOI":"10.1016\/j.amc.2022.127619"},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: A structured methodology for designing distributed algorithms for mobile entities. Inform. Sci. 574, 111\u2013132 (2021). https:\/\/doi.org\/10.1016\/j.ins.2021.05.043","key":"12_CR11","DOI":"10.1016\/j.ins.2021.05.043"},{"doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Stefano, G., Klav\u017ear, S., Yero, I.G.: Mutual-visibility problems on graphs of diameter two. Eur. J. Combinatorics 120 (2024). https:\/\/doi.org\/10.1016\/j.ejc.2024.103995","key":"12_CR12","DOI":"10.1016\/j.ejc.2024.103995"},{"doi-asserted-by":"publisher","unstructured":"Daymude, J.J., Hinnenthal, K., Richa, A.W., Scheideler, C.: Computing by programmable particles. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, LNCS, vol. 11340, pp. 615\u2013681. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_22","key":"12_CR13","DOI":"10.1007\/978-3-030-11072-7_22"},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"392","DOI":"10.1016\/j.ic.2016.09.005","volume":"254","author":"GA Di Luna","year":"2017","unstructured":"Di Luna, G.A., Flocchini, P., Chaudhuri, S.G., Poloni, F., Santoro, N., Viglietta, G.: Mutual visibility by luminous robots without collisions. Inf. Comput. 254, 392\u2013418 (2017)","journal-title":"Inf. Comput."},{"doi-asserted-by":"publisher","unstructured":"Di Stefano, G.: Mutual visibility in graphs. Appl. Math. Comput. 419, 126850 (2022). https:\/\/doi.org\/10.1016\/j.amc.2021.126850","key":"12_CR15","DOI":"10.1016\/j.amc.2021.126850"},{"key":"12_CR16","volume-title":"Amusements in Mathematics","author":"HE Dudeney","year":"1917","unstructured":"Dudeney, H.E.: Amusements in Mathematics. Nelson, Edinburgh (1917)"},{"doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Moving and computing models: robots. In: Distributed Computing by Mobile Entities, Current Research in Moving and Computing, LNCS, vol. 11340, pp. 3\u201314. Springer (2019).https:\/\/doi.org\/10.1007\/978-3-030-11072-7_1","key":"12_CR17","DOI":"10.1007\/978-3-030-11072-7_1"},{"issue":"1","key":"12_CR18","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1080\/17445760.2022.2124411","volume":"38","author":"S Ghosh","year":"2023","unstructured":"Ghosh, S., Goswami, P., Sharma, A., Sau, B.: Move optimal and time optimal arbitrary pattern formations by asynchronous robots on infinite grid. Int. J. Parallel Emerg. Distrib. Syst. 38(1), 35\u201357 (2023). https:\/\/doi.org\/10.1080\/17445760.2022.2124411","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"2","key":"12_CR19","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1017\/S0004972718000473","volume":"98","author":"P Manuel","year":"2018","unstructured":"Manuel, P., Klav\u017ear, S.: A general position problem in graph theory. Bull. Aust. Math. Soc. 98(2), 177\u2013187 (2018). https:\/\/doi.org\/10.1017\/S0004972718000473","journal-title":"Bull. Aust. Math. Soc."},{"doi-asserted-by":"publisher","unstructured":"Roy, D., Klav\u017ear, S., Lakshmanan, A.: Mutual-visibility and general position in double graphs and in mycielskians. CoRR abs\/2403.05120 (2024).https:\/\/doi.org\/10.48550\/arXiv.2403.05120","key":"12_CR20","DOI":"10.48550\/arXiv.2403.05120"},{"unstructured":"Wolfram MathWorld: Hexagonal Grid Graph. https:\/\/mathworld.wolfram.com\/HexagonalGridGraph.html (2023) [Online; Entries Last Updated: Sat Jul 29 2023]","key":"12_CR21"}],"container-title":["Lecture Notes in Computer Science","Stabilization, Safety, and Security of Distributed Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-74498-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T22:03:25Z","timestamp":1735596205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-74498-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,10,20]]},"ISBN":["9783031744976","9783031744983"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-74498-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024,10,20]]},"assertion":[{"value":"20 October 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Stabilizing, Safety, and Security of Distributed Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nagoya","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Japan","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 October 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 October 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sss2024.github.io\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}