{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T23:04:22Z","timestamp":1768950262393,"version":"3.49.0"},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T00:00:00Z","timestamp":1768867200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/501100001410","name":"Human Resource Development Group","doi-asserted-by":"publisher","award":["09\/1005 (0048)\/2020-EMR-I)"],"award-info":[{"award-number":["09\/1005 (0048)\/2020-EMR-I)"]}],"id":[{"id":"10.13039\/501100001410","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["CRG\/2020\/00596"],"award-info":[{"award-number":["CRG\/2020\/00596"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2021\/000118"],"award-info":[{"award-number":["MTR\/2021\/000118"]}],"id":[{"id":"10.13039\/501100001843","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100018978","name":"Indian Institute of Technology Ropar","doi-asserted-by":"publisher","award":["ISIRD"],"award-info":[{"award-number":["ISIRD"]}],"id":[{"id":"10.13039\/501100018978","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["SN COMPUT. SCI."],"DOI":"10.1007\/s42979-026-04726-x","type":"journal-article","created":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:58:31Z","timestamp":1768903111000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Maximal Independent Set via Leader Election by Mobile Agents from Arbitrary Initial Configuration Without Global Knowledge"],"prefix":"10.1007","volume":"7","author":[{"given":"Tanvir","family":"Kaur","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Barun","family":"Gorain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9606-9293","authenticated-orcid":false,"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2026,1,20]]},"reference":[{"key":"4726_CR1","doi-asserted-by":"crossref","unstructured":"Gorain B, Kaur T, Mondal K. Distance-2-dispersion with termination by a strong team. In: CALDAM, 2024. pp. 44\u201358.","DOI":"10.1007\/978-3-031-52213-0_4"},{"issue":"4","key":"4726_CR2","doi-asserted-by":"publisher","first-page":"567","DOI":"10.1016\/0196-6774(86)90019-2","volume":"7","author":"N Alon","year":"1986","unstructured":"Alon N, Babai L, Itai A. A fast and simple randomized parallel algorithm for the maximal independent set problem. J Algorithms. 1986;7(4):567\u201383.","journal-title":"J Algorithms"},{"key":"4726_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1137\/0221015","volume":"21","author":"N Linial","year":"1992","unstructured":"Linial N. Locality in distributed graph algorithms. SIAM J Comput. 1992;21:193\u2013201.","journal-title":"SIAM J Comput"},{"key":"4726_CR4","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1145\/2903137","volume":"63","author":"L Barenboim","year":"2016","unstructured":"Barenboim L, Elkin M, Pettie S, Schneider J. The locality of distributed symmetry breaking. J ACM. 2016;63:20\u201312045.","journal-title":"J ACM"},{"key":"4726_CR5","doi-asserted-by":"crossref","unstructured":"Fischer M, Noever A. Tight analysis of parallel randomized greedy MIS. In: SODA, 2018. pp. 2152\u201360.","DOI":"10.1137\/1.9781611975031.140"},{"key":"4726_CR6","doi-asserted-by":"crossref","unstructured":"Ghaffari M. An improved distributed algorithm for maximal independent set. In: SODA, 2016. pp. 270\u201377.","DOI":"10.1137\/1.9781611974331.ch20"},{"issue":"2","key":"4726_CR7","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0020-0190(86)90144-4","volume":"22","author":"A Israeli","year":"1986","unstructured":"Israeli A, Itai A. A fast and simple randomized parallel algorithm for maximal matching. Inf Process Lett. 1986;22(2):77\u201380.","journal-title":"Inf Process Lett"},{"issue":"4","key":"4726_CR8","doi-asserted-by":"publisher","first-page":"1036","DOI":"10.1137\/0215074","volume":"15","author":"M Luby","year":"1986","unstructured":"Luby M. A simple parallel algorithm for the maximal independent set problem. SIAM J Comput. 1986;15(4):1036\u201353.","journal-title":"SIAM J Comput"},{"key":"4726_CR9","doi-asserted-by":"crossref","unstructured":"Pattanayak D, Bhagat S, Chaudhuri SG, Molla AR. Maximal independent set via mobile agents. In: ICDCN, 2024. pp. 74\u201383.","DOI":"10.1145\/3631461.3631543"},{"key":"4726_CR10","unstructured":"Kshemkalyani AD, Kumar M, Molla AR, Sharma G. Brief announcement: agent-based leader election, mst, and beyond. In: DISC, 2024. vol. 319, pp. 50\u20131507."},{"key":"4726_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2023.114187","volume":"978","author":"S Pramanick","year":"2023","unstructured":"Pramanick S, Samala SV, Pattanayak D, Mandal PS. Distributed algorithms for filling mis vertices of an arbitrary graph by myopic luminous robots. TCS. 2023;978:114187.","journal-title":"TCS"},{"key":"4726_CR12","doi-asserted-by":"publisher","unstructured":"Kshemkalyani AD, Kumar M, Molla AR, Sharma G. Near-linear time leader election in multiagent networks. In: AAMAS, 2025. pp. 1218\u201326. https:\/\/doi.org\/10.5555\/3709347.3743753.","DOI":"10.5555\/3709347.3743753"},{"issue":"2","key":"4726_CR13","doi-asserted-by":"publisher","first-page":"356","DOI":"10.1006\/JAGM.1996.0017","volume":"20","author":"A Panconesi","year":"1996","unstructured":"Panconesi A, Srinivasan A. On the complexity of distributed network decomposition. J Algorithms. 1996;20(2):356\u201374. https:\/\/doi.org\/10.1006\/JAGM.1996.0017.","journal-title":"J Algorithms"},{"key":"4726_CR14","doi-asserted-by":"crossref","unstructured":"Kuhn F, Moscibroda T, Nieberg T, Wattenhofer R. Fast deterministic distributed maximal independent set computation on growth-bounded graphs. In: DISC, 2005. pp. 273\u201387.","DOI":"10.1007\/11561927_21"},{"issue":"5","key":"4726_CR15","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/s00446-010-0097-1","volume":"22","author":"J Schneider","year":"2010","unstructured":"Schneider J, Wattenhofer R. An optimal maximal independent set algorithm for bounded-independence graphs. Distrib Comput. 2010;22(5):349\u201361.","journal-title":"Distrib Comput"},{"key":"4726_CR16","doi-asserted-by":"publisher","unstructured":"Rozhon V, Ghaffari M. Polylogarithmic-time deterministic network decomposition and distributed derandomization. In: STOC, 2020. pp. 350\u201363. https:\/\/doi.org\/10.1145\/3357713.3384298.","DOI":"10.1145\/3357713.3384298"},{"issue":"3\u20134","key":"4726_CR17","doi-asserted-by":"publisher","first-page":"349","DOI":"10.1007\/S00446-020-00376-1","volume":"33","author":"K Censor-Hillel","year":"2020","unstructured":"Censor-Hillel K, Parter M, Schwartzman G. Derandomizing local distributed algorithms under bandwidth restrictions. Distrib Comput. 2020;33(3\u20134):349\u201366. https:\/\/doi.org\/10.1007\/S00446-020-00376-1.","journal-title":"Distrib Comput"},{"key":"4726_CR18","doi-asserted-by":"publisher","unstructured":"Ghaffari M, Grunau C, Rozhon V. Improved deterministic network decomposition. In: SODA, 2021. pp. 2904\u201323. https:\/\/doi.org\/10.1137\/1.9781611976465.173.","DOI":"10.1137\/1.9781611976465.173"},{"key":"4726_CR19","doi-asserted-by":"publisher","unstructured":"Bampas E, Gasieniec L, Hanusse N, Ilcinkas D, Klasing R, Kosowski A. Euler tour lock-in problem in the rotor-router model. In: Distributed Computing, 23rd International Symposium, DISC 2009, Elche, Spain, September 23-25, 2009. Proceedings, vol. 5805, pp. 423\u201335 (2009). https:\/\/doi.org\/10.1007\/978-3-642-04355-0_44.","DOI":"10.1007\/978-3-642-04355-0_44"},{"issue":"4","key":"4726_CR20","doi-asserted-by":"publisher","first-page":"42","DOI":"10.1145\/1383369.1383373","volume":"4","author":"R Cohen","year":"2008","unstructured":"Cohen R, Fraigniaud P, Ilcinkas D, Korman A, Peleg D. Label-guided graph exploration by a finite automaton. ACM Trans Algorithms. 2008;4(4):42\u201314218. https:\/\/doi.org\/10.1145\/1383369.1383373.","journal-title":"ACM Trans Algorithms"},{"key":"4726_CR21","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/J.IC.2014.12.005","volume":"243","author":"D Dereniowski","year":"2015","unstructured":"Dereniowski D, Disser Y, Kosowski A, Pajak D, Uznanski P. Fast collaborative graph exploration. Inf Comput. 2015;243:37\u201349. https:\/\/doi.org\/10.1016\/J.IC.2014.12.005.","journal-title":"Inf Comput"},{"issue":"2\u20133","key":"4726_CR22","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/J.TCS.2005.07.014","volume":"345","author":"P Fraigniaud","year":"2005","unstructured":"Fraigniaud P, Ilcinkas D, Peer G, Pelc A, Peleg D. Graph exploration by a finite automaton. Theor Comput Sci. 2005;345(2\u20133):331\u201344. https:\/\/doi.org\/10.1016\/J.TCS.2005.07.014.","journal-title":"Theor Comput Sci"},{"key":"4726_CR23","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re L, Flocchini P, Barrameda EM, Santoro N. Uniform scattering of autonomous mobile robots in a grid. In: IPDPS, 2009. pp. 1\u20138.","DOI":"10.1109\/IPDPS.2009.5160871"},{"key":"4726_CR24","first-page":"92","volume":"119","author":"M Shibata","year":"2018","unstructured":"Shibata M, Mega T, Ooshita F, Kakugawa H, Masuzawa T. Uniform deployment of mobile agents in asynchronous rings. JPDC. 2018;119:92\u2013106.","journal-title":"JPDC"},{"issue":"8\u201310","key":"4726_CR25","doi-asserted-by":"publisher","first-page":"783","DOI":"10.1016\/j.tcs.2010.11.023","volume":"412","author":"Y Elor","year":"2011","unstructured":"Elor Y, Bruckstein AM. Uniform multi-agent deployment on a ring. TCS. 2011;412(8\u201310):783\u201395.","journal-title":"TCS"},{"key":"4726_CR26","doi-asserted-by":"crossref","unstructured":"Molla AR, Mondal K Moses WK Jr. Fast deterministic gathering with detection on arbitrary graphs: The power of many robots. In: IPDPS, 2023. pp. 47\u201357.","DOI":"10.1109\/IPDPS54959.2023.00015"},{"issue":"5","key":"4726_CR27","doi-asserted-by":"publisher","first-page":"222","DOI":"10.3390\/A16050222","volume":"16","author":"S Dobrev","year":"2023","unstructured":"Dobrev S, Flocchini P, Prencipe G, Santoro N. Asynchronous gathering in a dangerous ring. Algorithms. 2023;16(5):222. https:\/\/doi.org\/10.3390\/A16050222.","journal-title":"Algorithms"},{"issue":"4","key":"4726_CR28","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. 2012;41(4):829\u201379. https:\/\/doi.org\/10.1137\/100796534.","journal-title":"SIAM J Comput"},{"key":"4726_CR29","doi-asserted-by":"crossref","unstructured":"Kshemkalyani AD, Molla AR, Sharma G. Dispersion of mobile robots on grids. In: WALCOM 2020.","DOI":"10.1007\/978-3-030-39881-1_16"},{"key":"4726_CR30","doi-asserted-by":"crossref","unstructured":"Molla AR, Moses WK Jr. Dispersion of mobile robots: the power of randomness. In: TAMC, 2019. pp. 481\u2013500.","DOI":"10.1007\/978-3-030-14812-6_30"},{"key":"4726_CR31","doi-asserted-by":"crossref","unstructured":"Augustine J, Moses WK Jr. Dispersion of mobile robots: a study of memory-time trade-offs. In: ICDCN, 2018. pp. 1\u20131110.","DOI":"10.1145\/3154273.3154293"},{"key":"4726_CR32","doi-asserted-by":"crossref","unstructured":"Kshemkalyani AD, Ali F. Efficient dispersion of mobile robots on graphs. In: ICDCN, 2019. pp. 218\u201327.","DOI":"10.1145\/3288599.3288610"},{"key":"4726_CR33","doi-asserted-by":"crossref","unstructured":"Kshemkalyani AD, Molla AR, Sharma G. Fast dispersion of mobile robots on arbitrary graphs. In: ALGOSENSORS, 2019. pp. 23\u201340.","DOI":"10.1007\/978-3-030-34405-4_2"},{"key":"4726_CR34","doi-asserted-by":"crossref","unstructured":"Shintaku T, Sudo Y, Kakugawa H, Masuzawa T. Efficient dispersion of mobile agents without global knowledge. In: SSS, 2020. pp. 280\u201394.","DOI":"10.1007\/978-3-030-64348-5_22"},{"key":"4726_CR35","doi-asserted-by":"crossref","unstructured":"Kshemkalyani AD, Sharma G. Near-optimal dispersion on arbitrary anonymous graphs. In: OPODIS, 2021. pp. 8\u20131819.","DOI":"10.2139\/ssrn.4282040"},{"key":"4726_CR36","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2021.07.008","volume":"887","author":"AR Molla","year":"2021","unstructured":"Molla AR, Mondal K, Moses WK Jr. Optimal dispersion on an anonymous ring in presence of weak byzantine robots. TCS. 2021;887:111\u201321.","journal-title":"TCS"},{"key":"4726_CR37","doi-asserted-by":"crossref","unstructured":"Pattanayak D, Sharma G, Mandal PS. Dispersion of mobile robots tolerating faults. In: ICDCN, 2021. pp. 133\u201338.","DOI":"10.1145\/3427477.3429464"},{"key":"4726_CR38","first-page":"100","volume":"161","author":"AD Kshemkalyani","year":"2022","unstructured":"Kshemkalyani AD, Molla AR, Sharma G. Dispersion of mobile robots using global communication. JPDC. 2022;161:100\u201317.","journal-title":"JPDC"},{"key":"4726_CR39","doi-asserted-by":"crossref","unstructured":"Agarwalla A, Augustine J, Moses WK Jr, Madhav SK, Sridhar AK. Deterministic dispersion of mobile robots in dynamic rings. In: ICDCN, 2018. pp. 19\u20131194. ACM.","DOI":"10.1145\/3154273.3154294"},{"key":"4726_CR40","first-page":"171","volume":"340","author":"A Das","year":"2023","unstructured":"Das A, Bose K, Sau B. Memory optimal dispersion by anonymous mobile robots. DAM. 2023;340:171\u201382.","journal-title":"DAM"},{"key":"4726_CR41","unstructured":"Sudo Y, Shibata M, Nakamura J, Kim Y, Masuzawa T. Near-linear time dispersion of mobile agents. In: DISC, 2024. pp. 38\u201313822."}],"container-title":["SN Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-026-04726-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s42979-026-04726-x","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s42979-026-04726-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,20]],"date-time":"2026-01-20T09:58:37Z","timestamp":1768903117000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s42979-026-04726-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,20]]},"references-count":41,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2026,1]]}},"alternative-id":["4726"],"URL":"https:\/\/doi.org\/10.1007\/s42979-026-04726-x","relation":{},"ISSN":["2661-8907"],"issn-type":[{"value":"2661-8907","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,20]]},"assertion":[{"value":"7 April 2025","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"3 January 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 January 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"On behalf of all authors, the corresponding author states that there is no conflict of interest.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}},{"value":"Not applicable.","order":3,"name":"Ethics","group":{"name":"EthicsHeading","label":"Human and Animal Rights"}},{"value":"Not applicable.","order":4,"name":"Ethics","group":{"name":"EthicsHeading","label":"Informed Consent"}}],"article-number":"125"}}