{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:04:18Z","timestamp":1750309458626,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":25,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,1,4]],"date-time":"2025-01-04T00:00:00Z","timestamp":1735948800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board, Department of Science and Technology, Govt. of India","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\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OAC-2104078."],"award-info":[{"award-number":["OAC-2104078."]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,1,4]]},"DOI":"10.1145\/3700838.3700863","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"161-170","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Collision-free Exploration by Mobile Agents Using Pebbles"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9471-0868","authenticated-orcid":false,"given":"Sajal K.","family":"Das","sequence":"first","affiliation":[{"name":"Department of Computer Science, Missouri University of Science and Technology, Rolla, Missouri, United States"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-8350-0148","authenticated-orcid":false,"given":"Amit Kumar","family":"Dhar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bhilai, Bhilai, Chhattisgarh, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2296-3222","authenticated-orcid":false,"given":"Barun","family":"Gorain","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bhilai, Bhilai, Chhattisgarh, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-7851-6772","authenticated-orcid":false,"given":"Madhuri","family":"Mahawar","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Indian Institute of Technology Bhilai, Bhilai, Chhattisgarh, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","unstructured":"E. Bar-Eli P. Berman A. Fiat and P. Yan. 1994. Online Navigation in a Room. J. Algorithms 17 3 (1994) 319\u2013341. 10.1006\/jagm.1994.1039","DOI":"10.1006\/jagm.1994.1039"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","unstructured":"M.\u00a0A. Bender A. Fern\u00e1ndez D. Ron A. Sahai and S.\u00a0P. Vadhan. 2002. The Power of a Pebble: Exploring and Mapping Directed Graphs. Inf. Comput. 176 1 (2002) 1\u201321. 10.1006\/inco.2001.3081","DOI":"10.1006\/inco.2001.3081"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1994.365703"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"S. Bhagat and A. Pelc. 2024. Deterministic Collision-Free Exploration of Unknown Anonymous Graphs. CoRR abs\/2401.13044 (2024). 10.48550\/ARXIV.2401.13044 arXiv:https:\/\/arXiv.org\/abs\/2401.13044","DOI":"10.48550\/ARXIV.2401.13044"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-031-21017-4_7"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","unstructured":"A. Blum P. Raghavan and B. Schieber. 1997. Navigating in Unfamiliar Geometric Terrain. SIAM J. Comput. 26 1 (1997) 110\u2013137. 10.1137\/S0097539791194931","DOI":"10.1137\/S0097539791194931"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1978.30"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.20"},{"key":"e_1_3_3_1_10_2","unstructured":"S.\u00a0N. Chandra L. Vachhani and A. Sinha. 2015. A Decentralized Approach for Autonomous Multi-Robot Exploration and Map Building for Tree Structures."},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"J. Czyzowicz D. Dereniowski L. Gasieniec R. Klasing A. Kosowski and D. Pajak. 2017. Collision-free network exploration. J. Comput. Syst. Sci. 86 (2017) 70\u201381. 10.1016\/j.jcss.2016.11.008","DOI":"10.1016\/j.jcss.2016.11.008"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-79527-6_11"},{"key":"e_1_3_3_1_13_2","unstructured":"Sajal\u00a0K. Das Amit\u00a0Kumar Dhar Barun Gorain and Madhuri Mahawar. 2024. Collision-free Exploration by Mobile Agents Using Pebbles. arxiv:https:\/\/arXiv.org\/abs\/2410.17542\u00a0[cs.DS] https:\/\/arxiv.org\/abs\/2410.17542"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"X. Deng and C.\u00a0H. Papadimitriou. 1999. Exploring an unknown graph. J. Graph Theory 32 3 (1999) 265\u2013297. 10.1002\/FSCS.1990.89554","DOI":"10.1002\/FSCS.1990.89554"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"D. Dereniowski Y. Disser A. Kosowski D. Pajak and P. Uznanski. 2015. Fast collaborative graph exploration. Inf. Comput. 243 (2015) 37\u201349. 10.1016\/j.ic.2014.12.005","DOI":"10.1016\/j.ic.2014.12.005"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"K. Diks P. Fraigniaud E. Kranakis and A.j Pelc. 2004. Tree exploration with little memory. J. Algorithms 51 1 (2004) 38\u201363. 10.1016\/j.jalgor.2003.10.002","DOI":"10.1016\/j.jalgor.2003.10.002"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","unstructured":"Y. Disser J. Hackfeld and M. Klimm. 2019. Tight Bounds for Undirected Graph Exploration with Pebbles and Multiple Agents. J. ACM 66 6 (2019) 40:1\u201340:41. 10.1145\/3356883","DOI":"10.1145\/3356883"},{"key":"e_1_3_3_1_18_2","first-page":"807","volume-title":"Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA","author":"Duncan C.\u00a0A.","year":"2001","unstructured":"C.\u00a0A. Duncan, S.\u00a0G. Kobourov, and V.\u00a0S.\u00a0Anil Kumar. 2001. Optimal constrained graph exploration. In Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA, S.\u00a0Rao Kosaraju (Ed.). ACM\/SIAM, 807\u2013814. http:\/\/dl.acm.org\/citation.cfm?id=365411.365786"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","unstructured":"P. Fraigniaud L. Gasieniec D.\u00a0R. Kowalski and A. Pelc. 2006. Collective tree exploration. Networks 48 3 (2006) 166\u2013177. 10.1002\/net.20127","DOI":"10.1002\/net.20127"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974331.ch44"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","unstructured":"B. Gorain K. Mondal H. Nayak and S. Pandit. 2022. Pebble guided optimal treasure hunt in anonymous graphs. Theor. Comput. Sci. 922 (2022) 61\u201380. 10.1016\/j.tcs.2022.04.011","DOI":"10.1016\/j.tcs.2022.04.011"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-10854-8_47"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"M. Kouck\u00fd. 2002. Universal traversal sequences with backtracking. J. Comput. System Sci. 65 4 (2002) 717\u2013726. 10.1016\/S0022-0000(02)00023-5Special Issue on Complexity 2001.","DOI":"10.1016\/S0022-0000(02)00023-5"},{"key":"e_1_3_3_1_24_2","unstructured":"Y. Nakaminami T. Masuzawa and T. Herman. 2004. Self-Stabilizing Agent Traversal on Tree Networks. IEICE Trans. Inf. Syst. 87-D 12 (2004) 2773\u20132780. http:\/\/search.ieice.org\/bin\/summary.php?id=e87-d_12_2773"},{"key":"e_1_3_3_1_25_2","doi-asserted-by":"publisher","unstructured":"O. Reingold. 2008. Undirected connectivity in log-space. J. ACM 55 4 Article 17 (sep 2008) 24\u00a0pages. 10.1145\/1391289.1391291","DOI":"10.1145\/1391289.1391291"},{"key":"e_1_3_3_1_26_2","doi-asserted-by":"publisher","unstructured":"A.\u00a0N. Shah. 1974. Pebble automata on arrays. Comput. Graph. Image Process. 3 3 (1974) 236\u2013246. 10.1016\/0146-664X(74)90017-3","DOI":"10.1016\/0146-664X(74)90017-3"}],"event":{"name":"ICDCN 2025: 26th International Conference on Distributed Computing and Networking","acronym":"ICDCN 2025","location":"Hyderabad India"},"container-title":["Proceedings of the 26th International Conference on Distributed Computing and Networking"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700863","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700863","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700863","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:10:22Z","timestamp":1750295422000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3700838.3700863"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":25,"alternative-id":["10.1145\/3700838.3700863","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700863","relation":{},"subject":[],"published":{"date-parts":[[2025,1,4]]},"assertion":[{"value":"2025-01-04","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}