{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T21:17:44Z","timestamp":1763414264033,"version":"3.45.0"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032111265","type":"print"},{"value":"9783032111272","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T00:00:00Z","timestamp":1763424000000},"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-3-032-11127-2_14","type":"book-chapter","created":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:55Z","timestamp":1763409835000},"page":"153-170","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Gathering in\u00a0Non-vertex-Transitive Graphs Under Round Robin"],"prefix":"10.1007","author":[{"given":"Serafino","family":"Cicerone","sequence":"first","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"}]},{"given":"Alfredo","family":"Navarra","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,11,18]]},"reference":[{"key":"14_CR1","doi-asserted-by":"publisher","unstructured":"Babai, L.: Canonical form for graphs in quasipolynomial time: preliminary report. In: Charikar, M., Cohen, E. (eds.) Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing, STOC 2019, pp. 1237\u20131246. ACM (2019). https:\/\/doi.org\/10.1145\/3313276.3316356","DOI":"10.1145\/3313276.3316356"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1007\/978-3-319-40509-4_22","volume-title":"Ad-hoc, Mobile, and Wireless Networks","author":"F Bonnet","year":"2016","unstructured":"Bonnet, F., Potop-Butucaru, M., Tixeuil, S.: Asynchronous gathering in rings with 4 robots. In: Mitton, N., Loscri, V., Mouradian, A. (eds.) ADHOC-NOW 2016. LNCS, vol. 9724, pp. 311\u2013324. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-40509-4_22"},{"key":"14_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-030-14094-6_7","volume-title":"Algorithms for Sensor Systems","author":"K Bose","year":"2019","unstructured":"Bose, K., Kundu, M.K., Adhikary, R., Sau, B.: Optimal gathering by asynchronous oblivious robots in hypercubes. In: Gilbert, S., Hughes, D., Krishnamachari, B. (eds.) ALGOSENSORS 2018. LNCS, vol. 11410, pp. 102\u2013117. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14094-6_7"},{"key":"14_CR4","doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Fonso, A., Di Stefano, G., Navarra, A.: Gathering of robots in butterfly networks. In: Masuzawa, T., Katayama, Y., Kakugawa, H., Nakamura, J., Kim, Y. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2024. LNCS, vol. 14931, pp. 106\u2013120. Springer (2024). https:\/\/doi.org\/10.1007\/978-3-031-74498-3_7","DOI":"10.1007\/978-3-031-74498-3_7"},{"key":"14_CR5","doi-asserted-by":"publisher","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Asynchronous robots on graphs: gathering. In: Flocchini, P., Prencipe, G., Santoro, N. (eds.) Distributed Computing by Mobile Entities, Current Research in Moving and Computing, LNCS, vol. 11340, pp. 184\u2013217. Springer (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_8","DOI":"10.1007\/978-3-030-11072-7_8"},{"key":"14_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/978-3-030-34992-9_7","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"S Cicerone","year":"2019","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: On gathering of semi-synchronous robots in graphs. In: Ghaffari, M., Nesterenko, M., Tixeuil, S., Tucci, S., Yamauchi, Y. (eds.) SSS 2019. LNCS, vol. 11914, pp. 84\u201398. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-34992-9_7"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1016\/j.tcs.2020.10.011","volume":"849","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Gathering robots in graphs: the central role of synchronicity. Theor. Comput. Sci. 849, 99\u2013120 (2021). https:\/\/doi.org\/10.1016\/j.tcs.2020.10.011","journal-title":"Theor. Comput. Sci."},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.ins.2021.05.043","volume":"574","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: A structured methodology for designing distributed algorithms for mobile entities. Inf. Sci. 574, 111\u2013132 (2021). https:\/\/doi.org\/10.1016\/j.ins.2021.05.043","journal-title":"Inf. Sci."},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1016\/j.tcs.2014.06.045","volume":"610","author":"G D\u2019Angelo","year":"2016","unstructured":"D\u2019Angelo, G., Di Stefano, G., Klasing, R., Navarra, A.: Gathering of robots on anonymous grids and trees without multiplicity detection. Theor. Comput. Sci. 610, 158\u2013168 (2016)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"197","DOI":"10.1007\/978-1-4614-6825-7_13","volume-title":"Search Theory","author":"G D\u2019Angelo","year":"2013","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering asynchronous and oblivious robots on basic graph topologies under the look-compute-move model. In: Alpern, S., Fokkink, R., G\u0105sieniec, L., Lindelauf, R., Subrahmanian, V. (eds.) Search Theory, pp. 197\u2013222. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6825-7_13"},{"issue":"4","key":"14_CR11","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/s00446-014-0212-9","volume":"27","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering on rings under the look-compute-move model. Distrib. Comput. 27(4), 255\u2013285 (2014)","journal-title":"Distrib. Comput."},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"16","DOI":"10.1016\/j.jda.2013.09.006","volume":"26","author":"G D\u2019Angelo","year":"2014","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A.: Gathering six oblivious robots on anonymous symmetric rings. J. Discrete Algorithms 26, 16\u201327 (2014)","journal-title":"J. Discrete Algorithms"},{"issue":"4","key":"14_CR13","doi-asserted-by":"publisher","first-page":"1055","DOI":"10.1007\/s00453-014-9892-6","volume":"72","author":"G D\u2019Angelo","year":"2015","unstructured":"D\u2019Angelo, G., Di Stefano, G., Navarra, A., Nisse, N., Suchan, K.: Computing on rings by oblivious robots: a unified approach for different tasks. Algorithmica 72(4), 1055\u20131096 (2015)","journal-title":"Algorithmica"},{"issue":"1","key":"14_CR14","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/s00446-016-0274-y","volume":"30","author":"G D\u2019Angelo","year":"2017","unstructured":"D\u2019Angelo, G., Navarra, A., Nisse, N.: A unified approach for gathering and exclusive searching on rings under weak assumptions. Distrib. Comput. 30(1), 17\u201348 (2017)","journal-title":"Distrib. Comput."},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.ic.2018.09.010","volume":"263","author":"M D\u2019Emidio","year":"2018","unstructured":"D\u2019Emidio, M., Di Stefano, G., Frigioni, D., Navarra, A.: Characterizing the computational power of mobile robots on graphs and implications for the Euclidean plane. Inf. Comput. 263, 57\u201374 (2018)","journal-title":"Inf. Comput."},{"key":"14_CR16","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/j.ic.2016.09.004","volume":"254","author":"G Di Stefano","year":"2017","unstructured":"Di Stefano, G., Navarra, A.: Gathering of oblivious robots on infinite grids with minimum traveled distance. Inf. Comput. 254, 377\u2013391 (2017)","journal-title":"Inf. Comput."},{"issue":"2","key":"14_CR17","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/s00446-016-0278-7","volume":"30","author":"G Di Stefano","year":"2017","unstructured":"Di Stefano, G., Navarra, A.: Optimal gathering of oblivious robots in anonymous graphs and its application on trees and rings. Distrib. Comput. 30(2), 75\u201386 (2017)","journal-title":"Distrib. Comput."},{"key":"14_CR18","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing. Lecture Notes in Computer Science, vol. 11340. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"key":"14_CR19","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Oblivious Mobile Robots. Synthesis Lectures on Distributed Computing Theory. Morgan & Claypool Publishers (2012)","DOI":"10.1007\/978-3-031-02008-7"},{"key":"14_CR20","doi-asserted-by":"publisher","unstructured":"Frei, F., Wada, K.: Brief announcement: distinct gathering under round robin. In: 38th International Symposium on Distributed Computing (DISC 2024). LIPIcs, vol.\u00a0319, pp. 48:1\u201348:8. Schloss Dagstuhl \u2013 Leibniz-Zentrum f\u00fcr Informatik (2024). https:\/\/doi.org\/10.4230\/LIPIcs.DISC.2024.48","DOI":"10.4230\/LIPIcs.DISC.2024.48"},{"key":"14_CR21","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.tcs.2012.07.004","volume":"509","author":"S Guilbault","year":"2013","unstructured":"Guilbault, S., Pelc, A.: Gathering asynchronous oblivious agents with local vision in regular bipartite graphs. Theor. Comput. Sci. 509, 86\u201396 (2013)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR22","doi-asserted-by":"crossref","unstructured":"Izumi, T., Izumi, T., Kamei, S., Ooshita, F.: Time-optimal gathering algorithm of mobile robots with local weak multiplicity detection in rings. IEICE Transactions 96-A(6), 1072\u20131080 (2013)","DOI":"10.1587\/transfun.E96.A.1072"},{"key":"14_CR23","unstructured":"Kamei, S., Lamani, A., Ooshita, F., Tixeuil, S., Wada, K.: Asynchronous gathering in a torus. In: 25th International Conference on Principles of Distributed Systems (OPODIS). LIPIcs, vol.\u00a0217, pp. 9:1\u20139:17. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"14_CR24","doi-asserted-by":"publisher","first-page":"3235","DOI":"10.1016\/j.tcs.2010.05.020","volume":"411","author":"R Klasing","year":"2010","unstructured":"Klasing, R., Kosowski, A., Navarra, A.: Taking advantage of symmetries: gathering of many asynchronous oblivious robots on a ring. Theor. Comput. Sci. 411, 3235\u20133246 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR25","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.tcs.2007.09.032","volume":"390","author":"R Klasing","year":"2008","unstructured":"Klasing, R., Markou, E., Pelc, A.: Gathering asynchronous oblivious mobile robots in a ring. Theor. Comput. Sci. 390, 27\u201339 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"14_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1007\/978-981-96-8312-3_13","volume-title":"Frontiers of Algorithmics","author":"A Navarra","year":"2025","unstructured":"Navarra, A., Piselli, F.: Oblivious robots under round robin: gathering on rings. In: Chau, V., D\u00fcrr, C., Li, M., Lu, P. (eds.) IJTCS-FAW 2025. LNCS, vol. 15828, pp. 166\u2013180. Springer, Singapore (2025). https:\/\/doi.org\/10.1007\/978-981-96-8312-3_13"},{"key":"14_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1007\/978-3-642-33536-5_6","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"F Ooshita","year":"2012","unstructured":"Ooshita, F., Tixeuil, S.: On the self-stabilization of mobile oblivious robots in uniform rings. In: Richa, A.W., Scheideler, C. (eds.) SSS 2012. LNCS, vol. 7596, pp. 49\u201363. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-33536-5_6"}],"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-032-11127-2_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,17]],"date-time":"2025-11-17T20:03:56Z","timestamp":1763409836000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-11127-2_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,18]]},"ISBN":["9783032111265","9783032111272"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-11127-2_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,11,18]]},"assertion":[{"value":"18 November 2025","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":"Kathmandu","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nepal","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9 October 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 October 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sss2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}