{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:31:46Z","timestamp":1759638706318,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,1,4]],"date-time":"2023-01-04T00:00:00Z","timestamp":1672790400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,1,4]]},"DOI":"10.1145\/3571306.3571401","type":"proceedings-article","created":{"date-parts":[[2023,1,3]],"date-time":"2023-01-03T16:17:12Z","timestamp":1672762632000},"page":"150-159","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["The Geodesic Mutual Visibility Problem for Oblivious Robots: the case of Trees"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8893-9335","authenticated-orcid":false,"given":"Serafino","family":"Cicerone","sequence":"first","affiliation":[{"name":"University of L'Aquila, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9093-0679","authenticated-orcid":false,"given":"Alessia","family":"Di Fonso","sequence":"additional","affiliation":[{"name":"University of L'Aquila, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4521-8356","authenticated-orcid":false,"given":"Gabriele","family":"Di Stefano","sequence":"additional","affiliation":[{"name":"University of L'Aquila, Italy"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8547-5934","authenticated-orcid":false,"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[{"name":"Universit\u00e0 degli Studi di Perugia, Italy"}]}],"member":"320","published-online":{"date-parts":[[2023,1,4]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018(Lecture Notes in Computer Science, Vol.\u00a011410)","author":"Adhikary Ranendu","year":"2018","unstructured":"Ranendu Adhikary , Kaustav Bose , Manash\u00a0Kumar Kundu , and Buddhadeb Sau . 2018 . Mutual Visibility by Asynchronous Robots on Infinite Grid. In Algorithms for Sensor Systems - 14th Int . Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018(Lecture Notes in Computer Science, Vol.\u00a011410) . Springer, 83\u2013101. Ranendu Adhikary, Kaustav Bose, Manash\u00a0Kumar Kundu, and Buddhadeb Sau. 2018. Mutual Visibility by Asynchronous Robots on Infinite Grid. In Algorithms for Sensor Systems - 14th Int. Symposium on Algorithms and Experiments for Wireless Sensor Networks, ALGOSENSORS 2018(Lecture Notes in Computer Science, Vol.\u00a011410). Springer, 83\u2013101."},{"key":"e_1_3_2_1_2_1","volume-title":"Complete Visitability for Autonomous Robots on Graphs. In 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018","author":"Aljohani Aisha","year":"2018","unstructured":"Aisha Aljohani , Pavan Poudel , and Gokarna Sharma . 2018 . Complete Visitability for Autonomous Robots on Graphs. In 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018 , Vancouver, BC, Canada , May 21-25, 2018. IEEE Computer Society, 733\u2013742. Aisha Aljohani, Pavan Poudel, and Gokarna Sharma. 2018. Complete Visitability for Autonomous Robots on Graphs. In 2018 IEEE International Parallel and Distributed Processing Symposium, IPDPS 2018, Vancouver, BC, Canada, May 21-25, 2018. IEEE Computer Society, 733\u2013742."},{"key":"e_1_3_2_1_3_1","volume-title":"WALCOM 2020(Lecture Notes in Computer Science, Vol.\u00a012049)","author":"Bhagat Subhash","year":"2020","unstructured":"Subhash Bhagat . 2020 . Optimum Algorithm for the Mutual Visibility Problem. In WALCOM: Algorithms and Computation - 14th International Conference , WALCOM 2020(Lecture Notes in Computer Science, Vol.\u00a012049) . Springer, 31\u201342. Subhash Bhagat. 2020. Optimum Algorithm for the Mutual Visibility Problem. In WALCOM: Algorithms and Computation - 14th International Conference, WALCOM 2020(Lecture Notes in Computer Science, Vol.\u00a012049). Springer, 31\u201342."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-24922-9_24"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-69084-1_24"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-18126-0_13"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-63385-5_30"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/3427796.3427833"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0325-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-018-0333-7"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.10.011"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2021.3064880"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-014-0220-9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2018.09.010"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ic.2016.09.005"},{"key":"e_1_3_2_1_16_1","volume-title":"Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014","author":"Di Luna Giuseppe\u00a0Antonio","year":"2014","unstructured":"Giuseppe\u00a0Antonio Di Luna , Paola Flocchini , Federico Poloni , Nicola Santoro , and Giovanni Viglietta . 2014 . The Mutual Visibility Problem for Oblivious Robots . In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014 . Carleton University, Ottawa, Canada. Giuseppe\u00a0Antonio Di Luna, Paola Flocchini, Federico Poloni, Nicola Santoro, and Giovanni Viglietta. 2014. The Mutual Visibility Problem for Oblivious Robots. In Proceedings of the 26th Canadian Conference on Computational Geometry, CCCG 2014. Carleton University, Ottawa, Canada."},{"key":"e_1_3_2_1_17_1","first-page":"126850","article-title":"Mutual visibility in graphs","volume":"419","author":"Stefano Gabriele Di","year":"2022","unstructured":"Gabriele Di Stefano . 2022 . Mutual visibility in graphs . Appl. Math. Comput. 419 (2022), 126850 . Gabriele Di Stefano. 2022. Mutual visibility in graphs. Appl. Math. Comput. 419(2022), 126850.","journal-title":"Appl. Math. Comput."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Paola Flocchini Giuseppe Prencipe and Nicola Santoro (Eds.). 2019. Distributed Computing by Mobile Entities Current Research in Moving and Computing. Lecture Notes in Computer Science Vol.\u00a011340. Springer.  Paola Flocchini Giuseppe Prencipe and Nicola Santoro (Eds.). 2019. Distributed Computing by Mobile Entities Current Research in Moving and Computing. Lecture Notes in Computer Science Vol.\u00a011340. Springer.","DOI":"10.1007\/978-3-030-11072-7"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-016-0291-x"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"Paola Flocchini Giuseppe Prencipe and Nicola Santoro (Eds.). 2019. Distributed Computing by Mobile Entities Current Research in Moving and Computing. LNCS Vol.\u00a011340. Springer.  Paola Flocchini Giuseppe Prencipe and Nicola Santoro (Eds.). 2019. Distributed Computing by Mobile Entities Current Research in Moving and Computing. LNCS Vol.\u00a011340. Springer.","DOI":"10.1007\/978-3-030-11072-7"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0220070"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2020.10.033"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3288599.3288602"},{"volume-title":"Design and Analysis of Distributed Algorithms","author":"Santoro Nicola","key":"e_1_3_2_1_24_1","unstructured":"Nicola Santoro . 2007. Design and Analysis of Distributed Algorithms . John Wiley & Sons . Nicola Santoro. 2007. Design and Analysis of Distributed Algorithms. John Wiley & Sons."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-28472-9_15"},{"key":"e_1_3_2_1_26_1","first-page":"50","article-title":"Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with","volume":"11","author":"Sharma Gokarna","year":"2021","unstructured":"Gokarna Sharma , Ramachandran Vaidyanathan , and Jerry\u00a0 L. Trahan . 2021 . Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights. Int. J. Netw. Comput. 11 , 1 (2021), 50 \u2013 77 . Gokarna Sharma, Ramachandran Vaidyanathan, and Jerry\u00a0L. Trahan. 2021. Optimal Randomized Complete Visibility on a Grid for Asynchronous Robots with Lights. Int. J. Netw. Comput. 11, 1 (2021), 50\u201377.","journal-title":"Lights. Int. J. Netw. Comput."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2010.01.037"}],"event":{"name":"ICDCN 2023: 24th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2023","location":"Kharagpur India"},"container-title":["Proceedings of the 24th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571401","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3571306.3571401","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T18:07:53Z","timestamp":1750183673000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3571306.3571401"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,4]]},"references-count":27,"alternative-id":["10.1145\/3571306.3571401","10.1145\/3571306"],"URL":"https:\/\/doi.org\/10.1145\/3571306.3571401","relation":{},"subject":[],"published":{"date-parts":[[2023,1,4]]},"assertion":[{"value":"2023-01-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}