{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,2]],"date-time":"2026-02-02T20:46:24Z","timestamp":1770065184328,"version":"3.49.0"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031377648","type":"print"},{"value":"9783031377655","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"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":[[2023]]},"DOI":"10.1007\/978-3-031-37765-5_12","type":"book-chapter","created":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T19:01:53Z","timestamp":1688670113000},"page":"157-173","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Distance-2-Dispersion: Dispersion with\u00a0Further Constraints"],"prefix":"10.1007","author":[{"given":"Tanvir","family":"Kaur","sequence":"first","affiliation":[]},{"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"12_CR1","doi-asserted-by":"crossref","unstructured":"John Augustine and William K. Moses Jr. Dispersion of mobile robots: a study of memory-time trade-offs. In: ICDCN, pp. 1:1\u20131:10 (2018)","DOI":"10.1145\/3154273.3154293"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"Molla, A.R., Mondal, K., Moses Jr., W.K.: Byzantine dispersion on graphs. In: IPDPS, pp. 942\u2013951. IEEE (2021)","DOI":"10.1109\/IPDPS49936.2021.00103"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1007\/978-3-030-14812-6_30","volume-title":"Theory and Applications of Models of Computation","author":"AR Molla","year":"2019","unstructured":"Molla, A.R., Moses, W.K.: Dispersion of mobile robots: the power of randomness. In: Gopal, T.V., Watada, J. (eds.) TAMC 2019. LNCS, vol. 11436, pp. 481\u2013500. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-14812-6_30"},{"key":"12_CR4","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1016\/j.tcs.2021.07.008","volume":"887","author":"AR Molla","year":"2021","unstructured":"Molla, A.R., Mondal, K., Moses, W.K., Jr.: Optimal dispersion on an anonymous ring in the presence of weak byzantine robots. Theor. Comput. Sci. 887, 111\u2013121 (2021)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/978-3-030-64348-5_22","volume-title":"Stabilization, Safety, and Security of Distributed Systems","author":"T Shintaku","year":"2020","unstructured":"Shintaku, T., Sudo, Y., Kakugawa, H., Masuzawa, T.: Efficient dispersion of mobile agents without global knowledge. In: Devismes, S., Mittal, N. (eds.) SSS 2020. LNCS, vol. 12514, pp. 280\u2013294. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-64348-5_22"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"100","DOI":"10.1016\/j.jpdc.2021.11.007","volume":"161","author":"AD Kshemkalyani","year":"2022","unstructured":"Kshemkalyani, A.D., Molla, A.R., Sharma, G.: Dispersion of mobile robots using global communication. J. Parallel Distrib. Comput. 161, 100\u2013117 (2022)","journal-title":"J. Parallel Distrib. Comput."},{"key":"12_CR7","doi-asserted-by":"publisher","unstructured":"Barun Gorain, Partha Sarathi Mandal, Kaushik Mondal, and Supantha Pandit. Collaborative dispersion by silent robots. In: Devismes, S., Petit, F., Altisen, K., Di Luna, G.A., Fernandez Anta, A. (eds.) SSS, vol. 13751, pp. 254\u2013269. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-21017-4_17","DOI":"10.1007\/978-3-031-21017-4_17"},{"key":"12_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"426","DOI":"10.1007\/978-3-030-67899-9_34","volume-title":"Algorithms and Discrete Applied Mathematics","author":"A Das","year":"2021","unstructured":"Das, A., Bose, K., Sau, B.: Memory optimal dispersion by anonymous mobile robots. In: Mudgal, A., Subramanian, C.R. (eds.) CALDAM 2021. LNCS, vol. 12601, pp. 426\u2013439. Springer, Cham (2021). https:\/\/doi.org\/10.1007\/978-3-030-67899-9_34"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1007\/978-3-030-39881-1_16","volume-title":"WALCOM: Algorithms and Computation","author":"AD Kshemkalyani","year":"2020","unstructured":"Kshemkalyani, A.D., Molla, A.R., Sharma, G.: Dispersion of mobile robots on grids. In: Rahman, M.S., Sadakane, K., Sung, W.-K. (eds.) WALCOM 2020. LNCS, vol. 12049, pp. 183\u2013197. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-39881-1_16"},{"key":"12_CR10","doi-asserted-by":"crossref","unstructured":"Agarwalla, A., Augustine, J., Moses Jr., W.K., Sankar Madhav, K., Sridhar, A.K.: Deterministic dispersion of mobile robots in dynamic rings. In: ICDCN, pp. 19:1\u201319:4. ACM (2018)","DOI":"10.1145\/3154273.3154294"},{"key":"12_CR11","doi-asserted-by":"publisher","unstructured":"Das, S.:: Graph explorations with mobile agents. In: Flocchini, P., Prencipe, G., Santoro, N. (eds) Distributed Computing by Mobile Entities. LNCS, vol. 11340, pp. 403\u2013422. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-11072-7_16","DOI":"10.1007\/978-3-030-11072-7_16"},{"key":"12_CR12","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. 243, 37\u201349 (2015)","journal-title":"Inf. Comput."},{"key":"12_CR13","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Sharma, G.: Near-optimal dispersion on arbitrary anonymous graphs. OPODIS 8:1\u20138:19 (2021)","DOI":"10.2139\/ssrn.4282040"},{"issue":"4","key":"12_CR14","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 7(4), 567\u2013583 (1986)","journal-title":"J. Algorithms"},{"issue":"3","key":"12_CR15","doi-asserted-by":"publisher","first-page":"20:1","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 63(3), 20:1-20:45 (2016)","journal-title":"J. ACM"},{"key":"12_CR16","doi-asserted-by":"crossref","unstructured":"Elkin, M., Pettie, S., Su, H.-H.: (2$$\\Delta $$ - l)-edge-coloring is much easier than maximal matching in the distributed setting. In: SODA, pp. 355\u2013370 (2015)","DOI":"10.1137\/1.9781611973730.26"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Fischer, M., Noever, A.: Tight analysis of parallel randomized greedy MIS. In: SODA, pp. 2152\u20132160 (2018)","DOI":"10.1137\/1.9781611975031.140"},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"Ghaffari, M.: An improved distributed algorithm for maximal independent set. In: SODA, pp. 270\u2013277 (2016)","DOI":"10.1137\/1.9781611974331.ch20"},{"key":"12_CR19","doi-asserted-by":"crossref","unstructured":"Harris, D.G., Schneider, J., Su, H.-H.: Distributed ($$\\Delta +1$$)-coloring in sublogarithmic rounds. In: STOC, pp. 465\u2013478 (2016)","DOI":"10.1145\/2897518.2897533"},{"issue":"2","key":"12_CR20","doi-asserted-by":"publisher","first-page":"17:1","DOI":"10.1145\/2742012","volume":"63","author":"F Kuhn","year":"2016","unstructured":"Kuhn, F., Moscibroda, T., Wattenhofer, R.: Local computation: lower and upper bounds. J. ACM 63(2), 17:1-17:44 (2016)","journal-title":"J. ACM"},{"key":"12_CR21","doi-asserted-by":"crossref","unstructured":"Lenzen, C., Wattenhofer, R.: MIS on trees. In: Proceedings of the 30th Annual ACM Symposium on Principles of Distributed Computing (PODC), pp. 41\u201348 (2011)","DOI":"10.1145\/1993806.1993813"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"Luby, M.: A simple parallel algorithm for the maximal independent set problem. In: STOC, pp. 1\u201310 (1985)","DOI":"10.1145\/22145.22146"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Ali, F.: Efficient dispersion of mobile robots on graphs. In: ICDCN, pp. 218\u2013227 (2019)","DOI":"10.1145\/3288599.3288610"},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Kshemkalyani, A.D., Molla, A.R., Sharma, G.: Fast dispersion of mobile robots on arbitrary graphs. In: ALGOSENSORS, pp. 23\u201340 (2019)","DOI":"10.1007\/978-3-030-34405-4_2"},{"key":"12_CR25","doi-asserted-by":"crossref","unstructured":"Barri\u00e8re, L., Flocchini, P., Barrameda, E.M., Santoro, N.: Uniform scattering of autonomous mobile robots in a grid. In: IPDPS, pp. 1\u20138 (2009)","DOI":"10.1109\/IPDPS.2009.5160871"},{"issue":"8\u201310","key":"12_CR26","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, A.M.: Uniform multi-agent deployment on a ring. Theor. Comput. Sci. 412(8\u201310), 783\u2013795 (2011)","journal-title":"Theor. Comput. Sci."},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1016\/j.jpdc.2018.03.008","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. J. Parallel Distributed Comput. 119, 92\u2013106 (2018)","journal-title":"J. Parallel Distributed Comput."},{"key":"12_CR28","doi-asserted-by":"publisher","unstructured":"Pramanick, S., Samala, S.V., Pattanayak, D., Mandal, P.S.: Filling MIS vertices of a graph by myopic luminous robots. In: Molla, A.R., Sharma, G., Kumar, P., Rawat, S. (eds.) ICDCIT 2023. LNCS, vol. 13776, pp. 3\u201319. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-24848-1_1","DOI":"10.1007\/978-3-031-24848-1_1"}],"container-title":["Lecture Notes in Computer Science","Networked Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37765-5_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T19:03:25Z","timestamp":1688670205000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37765-5_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031377648","9783031377655"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37765-5_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NETYS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Networked Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Benguerir","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Morocco","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 May 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24 May 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"netys2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/netys.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"31","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"9","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"29% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.6","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.2","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}