{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:26:38Z","timestamp":1767093998904,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":24,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2026,1,6]]},"DOI":"10.1145\/3772290.3772305","type":"proceedings-article","created":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:18Z","timestamp":1767093858000},"page":"31-40","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Optimal Maximal Independent Set Computation by Robots in Unoriented Grid and Torus"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0001-6989-8686","authenticated-orcid":false,"given":"Himani","family":"Himani","sequence":"first","affiliation":[{"name":"Dhirubhai Ambani University, Gandhinagar, Gujarat, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4908-7165","authenticated-orcid":false,"given":"Supantha","family":"Pandit","sequence":"additional","affiliation":[{"name":"Dhirubhai Ambani University, Gandhinagar, Gujarat, India"}]}],"member":"320","published-online":{"date-parts":[[2026,1,5]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"crossref","unstructured":"Ozkan Arapoglu Vahid\u00a0Khalilpour Akram and Orhan Dagdeviren. 2019. An energy-efficient self-stabilizing and distributed algorithm for maximal independent set construction in wireless sensor networks. COMPUT STAND INTER 62 (2019) 32\u201342.","DOI":"10.1016\/j.csi.2018.07.004"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/3154273.3154293"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-74580-5_3"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-48882-5_10"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Raja Das Avisek Sharma and Buddhadeb Sau. 2025. Maximum independent set formation on a finite grid by myopic robots. Theoretical Computer Science 1031 115077.","DOI":"10.1016\/j.tcs.2025.115077"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"St\u00e9phane Devismes Anissa Lamani Franck Petit and S\u00e9bastien Tixeuil. 2019. Optimal torus exploration by oblivious robots. Computing 101 (2019) 1241\u20131264.","DOI":"10.1007\/s00607-018-0595-8"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-52213-0_4"},{"key":"e_1_3_3_1_9_2","first-page":"75","volume-title":"International Conference on Distributed Computing and Intelligent Technology","year":"2024","unstructured":"Himani and Supantha Pandit. 2024. Optimal Dispersion in Triangular Grids: Achieving Efficiency Without Prior Knowledge. In International Conference on Distributed Computing and Intelligent Technology. 75\u201391."},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-55706-7_29"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"crossref","unstructured":"Sayaka Kamei and S\u00e9bastien Tixeuil. 2024. An asynchronous maximum independent set algorithm by myopic luminous robots on grids. Comput. J. 67 1 (2024) 57\u201377.","DOI":"10.1093\/comjnl\/bxac158"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-37765-5_12"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3288599.3288610"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3694906.3743317"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34405-4_2"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3369740.3369775"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-39881-1_16"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Ajay\u00a0D Kshemkalyani and Gokarna Sharma. 2025. Near-optimal dispersion on arbitrary anonymous graphs. J. Comput. System Sci. (2025) 103656.","DOI":"10.1016\/j.jcss.2025.103656"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1145\/1073814.1073842"},{"key":"e_1_3_3_1_20_2","first-page":"447","volume-title":"FSTTCS","author":"Parthasarathy Srinivasan","year":"2005","unstructured":"Srinivasan Parthasarathy and Rajiv Gandhi. 2005. Distributed algorithms for coloring and domination in wireless ad hoc networks. In FSTTCS. 447\u2013459."},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/3631461.3631543"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-24848-1_1"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"crossref","unstructured":"Glaydston\u00a0M Ribeiro Geraldo\u00a0R Mauri and Luiz Antonio\u00a0N Lorena. 2011. A lagrangean decomposition for the maximum independent set problem applied to map labeling. Oper. Res. 11 (2011) 229\u2013243.","DOI":"10.1007\/s12351-009-0075-1"},{"key":"e_1_3_3_1_24_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-64348-5_22"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48481-7_37"}],"event":{"name":"ICDCN 2026: 27th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2026","location":"Nara Japan"},"container-title":["Proceedings of the 27th International Conference on Distributed Computing and Networking"],"original-title":[],"deposited":{"date-parts":[[2025,12,30]],"date-time":"2025-12-30T11:24:26Z","timestamp":1767093866000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3772290.3772305"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,5]]},"references-count":24,"alternative-id":["10.1145\/3772290.3772305","10.1145\/3772290"],"URL":"https:\/\/doi.org\/10.1145\/3772290.3772305","relation":{},"subject":[],"published":{"date-parts":[[2026,1,5]]},"assertion":[{"value":"2026-01-05","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}