{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,9]],"date-time":"2025-09-09T21:40:27Z","timestamp":1757454027003,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":17,"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:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research, India","doi-asserted-by":"publisher","award":["09\/096(1031)\/2020-EMR-I"],"award-info":[{"award-number":["09\/096(1031)\/2020-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["1132\/(CSIR-UGC NET JUNE 2017)"],"award-info":[{"award-number":["1132\/(CSIR-UGC NET JUNE 2017)"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001501","name":"University Grants Commission","doi-asserted-by":"publisher","award":["4722\/(CSIR-UGC NET JUNE 2019)"],"award-info":[{"award-number":["4722\/(CSIR-UGC NET JUNE 2019)"]}],"id":[{"id":"10.13039\/501100001501","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001843","name":"Science and Engineering Research Board","doi-asserted-by":"publisher","award":["MTR\/2021\/000835"],"award-info":[{"award-number":["MTR\/2021\/000835"]}],"id":[{"id":"10.13039\/501100001843","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.3700841","type":"proceedings-article","created":{"date-parts":[[2025,1,2]],"date-time":"2025-01-02T12:58:12Z","timestamp":1735822692000},"page":"249-253","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Rectangle Enclosed Triangular Grid Exploration with Myopic Luminous Robots"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0002-0161-5341","authenticated-orcid":false,"given":"Raja","family":"Das","sequence":"first","affiliation":[{"name":"Department of Mathematics, Jadavpur University, Kolkata, West Bengal, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0546-3894","authenticated-orcid":false,"given":"Pritam","family":"Goswami","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Sister Nivedita University, Kolkata, West Bengal, India"}]},{"ORCID":"https:\/\/orcid.org\/0009-0001-3017-9924","authenticated-orcid":false,"given":"Brati","family":"Mondal","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jadavpur University, Kolkata, West Bengal, India"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7008-6135","authenticated-orcid":false,"given":"Buddhadeb","family":"Sau","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Jadavpur University, Kolkata, West Bengal, India"}]}],"member":"320","published-online":{"date-parts":[[2025,1,4]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-15763-9_29"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25873-2_18"},{"key":"e_1_3_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-67087-0_9"},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","unstructured":"Quentin Bramas Pascal Lafourcade and St\u00e9phane Devismes. 2023. Optimal exclusive perpetual grid exploration by luminous myopic opaque robots with common chirality. Theor. Comput. Sci. 977 (2023) 114162. 10.1016\/J.TCS.2023.114162","DOI":"10.1016\/J.TCS.2023.114162"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16926-7_20"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICDCS.2013.55"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-03089-0_31"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"St\u00e9phane Devismes Anissa Lamani Franck Petit Pascal Raymond and S\u00e9bastien Tixeuil. 2021. Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64 1 (2021) 132\u2013154. 10.1093\/COMJNL\/BXZ166","DOI":"10.1093\/COMJNL\/BXZ166"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"publisher","unstructured":"St\u00e9phane Devismes Anissa Lamani Franck Petit Pascal Raymond and S\u00e9bastien Tixeuil. 2021. Terminating Exploration Of A Grid By An Optimal Number Of Asynchronous Oblivious Robots. Comput. J. 64 1 (2021) 132\u2013154. 10.1093\/COMJNL\/BXZ166","DOI":"10.1093\/COMJNL\/BXZ166"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","unstructured":"St\u00e9phane Devismes Anissa Lamani Franck Petit and S\u00e9bastien Tixeuil. 2019. Optimal torus exploration by oblivious robots. Computing 101 9 (2019) 1241\u20131264. 10.1007\/S00607-018-0595-8","DOI":"10.1007\/S00607-018-0595-8"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"St\u00e9phane Devismes Franck Petit and S\u00e9bastien Tixeuil. 2013. Optimal probabilistic ring exploration by semi-synchronous oblivious robots. Theor. Comput. Sci. 498 (2013) 10\u201327. 10.1016\/J.TCS.2013.05.031","DOI":"10.1016\/J.TCS.2013.05.031"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","unstructured":"Paola Flocchini David Ilcinkas Andrzej Pelc and Nicola Santoro. 2010. Remembering without memory: Tree exploration by asynchronous oblivious robots. Theor. Comput. Sci. 411 14-15 (2010) 1583\u20131598. 10.1016\/J.TCS.2010.01.007","DOI":"10.1016\/J.TCS.2010.01.007"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Paola Flocchini David Ilcinkas Andrzej Pelc and Nicola Santoro. 2011. How many oblivious robots can explore a line. Inf. Process. Lett. 111 20 (2011) 1027\u20131031. 10.1016\/J.IPL.2011.07.018","DOI":"10.1016\/J.IPL.2011.07.018"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","unstructured":"Paola Flocchini David Ilcinkas Andrzej Pelc and Nicola Santoro. 2013. Computing Without Communicating: Ring Exploration by Asynchronous Oblivious Robots. Algorithmica 65 3 (2013) 562\u2013583. 10.1007\/S00453-011-9611-5","DOI":"10.1007\/S00453-011-9611-5"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13284-1_15"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-91014-3_7"},{"key":"e_1_3_3_1_18_2","unstructured":"Honghai Zhang and Jennifer\u00a0C. Hou. 2005. Maintaining Sensing Coverage and Connectivity in Large Sensor Networks. Ad Hoc Sens. Wirel. Networks 1 1-2 (2005) 89\u2013124. http:\/\/www.oldcitypublishing.com\/journals\/ahswn-home\/ahswn-issue-contents\/ahswn-volume-1-number-1-2-2005\/ahswn-1-1-2-p-89-124\/"}],"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.3700841","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3700838.3700841","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.3700841"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,1,4]]},"references-count":17,"alternative-id":["10.1145\/3700838.3700841","10.1145\/3700838"],"URL":"https:\/\/doi.org\/10.1145\/3700838.3700841","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"}}]}}