{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,8]],"date-time":"2025-09-08T06:35:00Z","timestamp":1757313300308,"version":"3.40.3"},"publisher-location":"Cham","reference-count":17,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031630200"},{"type":"electronic","value":"9783031630217"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-3-031-63021-7_36","type":"book-chapter","created":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:02:29Z","timestamp":1718974949000},"page":"472-484","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["The Minimum Algorithm Size of k-Grouping by Silent Oblivious Robots"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3584-5727","authenticated-orcid":false,"given":"Paola","family":"Flocchini","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2862-2795","authenticated-orcid":false,"given":"Debasish","family":"Pattanayak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7954-3918","authenticated-orcid":false,"given":"Nicola","family":"Santoro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Masafumi","family":"Yamashita","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,6,22]]},"reference":[{"issue":"1","key":"36_CR1","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1137\/050645221","volume":"36","author":"N Agmon","year":"2006","unstructured":"Agmon, N., Peleg, D.: Fault-tolerant gathering algorithms for autonomous mobile robots. SIAM J. Comput. 36(1), 56\u201382 (2006). https:\/\/doi.org\/10.1137\/050645221","journal-title":"SIAM J. Comput."},{"key":"36_CR2","doi-asserted-by":"crossref","unstructured":"Asahiro, Y., Yamashita, M.: Minimum algorithm sizes for self-stabilizing gathering and related problems of autonomous mobile robots (extended abstract). In: 25th International Symposium on Stabilization Safety and Security of Distributed Systems, pp. 312\u2013327 (2023)","DOI":"10.1007\/978-3-031-44274-2_23"},{"key":"36_CR3","doi-asserted-by":"publisher","first-page":"50","DOI":"10.1016\/j.jda.2015.10.005","volume":"36","author":"S Bhagat","year":"2016","unstructured":"Bhagat, S., Gan Chaudhuri, S., Mukhopadhyaya, K.: Fault-tolerant gathering of asynchronous oblivious mobile robots under one-axis agreement. J. Discret. Algorithms 36, 50\u201362 (2016). https:\/\/doi.org\/10.1016\/j.jda.2015.10.005","journal-title":"J. Discret. Algorithms"},{"key":"36_CR4","doi-asserted-by":"publisher","first-page":"88177","DOI":"10.1109\/ACCESS.2021.3089081","volume":"9","author":"S Cicerone","year":"2021","unstructured":"Cicerone, S., Di Stefano, G., Navarra, A.: Solving the pattern formation by mobile robots with chirality. IEEE Access 9, 88177\u201388204 (2021)","journal-title":"IEEE Access"},{"issue":"4","key":"36_CR5","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1137\/100796534","volume":"41","author":"M Cieliebak","year":"2012","unstructured":"Cieliebak, M., Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by mobile robots: gathering. SIAM J. Comput. 41(4), 829\u2013879 (2012). https:\/\/doi.org\/10.1137\/100796534","journal-title":"SIAM J. Comput."},{"issue":"2","key":"36_CR6","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s00446-014-0220-9","volume":"28","author":"S Das","year":"2015","unstructured":"Das, S., Flocchini, P., Santoro, N., Yamashita, M.: Forming sequences of geometric patterns with oblivious mobile robots. Distrib. Comput. 28(2), 131\u2013145 (2015). https:\/\/doi.org\/10.1007\/s00446-014-0220-9","journal-title":"Distrib. Comput."},{"issue":"1","key":"36_CR7","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1142\/S0129626409000146","volume":"19","author":"Y Dieudonn\u00e9","year":"2009","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Scatter of robots. Parallel Process. Lett. 19(1), 175\u2013184 (2009). https:\/\/doi.org\/10.1142\/S0129626409000146","journal-title":"Parallel Process. Lett."},{"key":"36_CR8","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.tcs.2011.12.010","volume":"428","author":"Y Dieudonn\u00e9","year":"2012","unstructured":"Dieudonn\u00e9, Y., Petit, F.: Self-stabilizing gathering with strong multiplicity detection. Theor. Comput. Sci. 428, 47\u201357 (2012). https:\/\/doi.org\/10.1016\/j.tcs.2011.12.010","journal-title":"Theor. Comput. Sci."},{"key":"36_CR9","doi-asserted-by":"crossref","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Oblivious Mobile Robots. Morgan & Claypool, San Rafael (2012)","DOI":"10.1007\/978-3-031-02008-7"},{"key":"36_CR10","doi-asserted-by":"publisher","first-page":"412","DOI":"10.1016\/j.tcs.2008.07.026","volume":"407","author":"P Flocchini","year":"2008","unstructured":"Flocchini, P., Prencipe, G., Santoro, N., Widmayer, P.: Arbitrary pattern formation by asynchronous oblivious robots. Theor. Comput. Sci. 407, 412\u2013447 (2008)","journal-title":"Theor. Comput. Sci."},{"key":"36_CR11","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/s00446-016-0291-x","volume":"30","author":"P Flocchini","year":"2017","unstructured":"Flocchini, P., Prencipe, P., Santoro, N., Viglietta, G.: Distributed computing by mobile robots: uniform circle formation. Distrib. Comput. 30, 413\u2013457 (2017)","journal-title":"Distrib. Comput."},{"key":"36_CR12","doi-asserted-by":"crossref","unstructured":"Flocchini, P.: Gathering. Chapter 4 of Distributed Computing by Mobile Entities, pp. 63\u201382 (2019)","DOI":"10.1007\/978-3-030-11072-7_4"},{"key":"36_CR13","doi-asserted-by":"publisher","unstructured":"Flocchini, P., Prencipe, G., Santoro, N. (eds.): Distributed Computing by Mobile Entities, Current Research in Moving and Computing, LNCS, vol. 11340. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7","DOI":"10.1007\/978-3-030-11072-7"},{"issue":"1","key":"36_CR14","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1137\/100797916","volume":"41","author":"T Izumi","year":"2012","unstructured":"Izumi, T., et al.: The gathering problem for two oblivious robots with unreliable compasses. SIAM J. Comput. 41(1), 26\u201346 (2012)","journal-title":"SIAM J. Comput."},{"key":"36_CR15","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/j.jpdc.2018.09.015","volume":"123","author":"D Pattanayak","year":"2019","unstructured":"Pattanayak, D., Mondal, K., Ramesh, H., Mandal, P.: Gathering of mobile robots with weak multiplicity detection in presence of crash-faults. J. Parallel Distrib. Comput. 123, 145\u2013155 (2019). https:\/\/doi.org\/10.1016\/j.jpdc.2018.09.015","journal-title":"J. Parallel Distrib. Comput."},{"issue":"4","key":"36_CR16","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1137\/S009753979628292X","volume":"28","author":"I Suzuki","year":"1999","unstructured":"Suzuki, I., Yamashita, M.: Distributed anonymous mobile robots: formation of geometric patterns. SIAM J. Comput. 28(4), 1347\u20131363 (1999). https:\/\/doi.org\/10.1137\/S009753979628292X","journal-title":"SIAM J. Comput."},{"issue":"26\u201328","key":"36_CR17","doi-asserted-by":"publisher","first-page":"2433","DOI":"10.1016\/j.tcs.2010.01.037","volume":"411","author":"M Yamashita","year":"2010","unstructured":"Yamashita, M., Suzuki, I.: Characterizing geometric patterns formable by oblivious anonymous mobile robots. Theor. Comput. Sci. 411(26\u201328), 2433\u20132453 (2010). https:\/\/doi.org\/10.1016\/j.tcs.2010.01.037","journal-title":"Theor. Comput. Sci."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-63021-7_36","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,21]],"date-time":"2024-06-21T13:18:53Z","timestamp":1718975933000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-63021-7_36"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9783031630200","9783031630217"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-63021-7_36","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"22 June 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ischia","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","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":"1 July 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"35","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/iwoca2024.di.unisa.it","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}