{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,21]],"date-time":"2026-05-21T05:56:38Z","timestamp":1779342998728,"version":"3.51.4"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030344047","type":"print"},{"value":"9783030344054","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-34405-4_2","type":"book-chapter","created":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T14:02:44Z","timestamp":1574085764000},"page":"23-40","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":29,"title":["Fast Dispersion of Mobile Robots on Arbitrary Graphs"],"prefix":"10.1007","author":[{"given":"Ajay D.","family":"Kshemkalyani","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anisur Rahaman","family":"Molla","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gokarna","family":"Sharma","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,11,5]]},"reference":[{"key":"2_CR1","unstructured":"Augustine, J., Moses Jr., W.K.: Dispersion of mobile robots: a study of memory-time trade-offs. CoRR, abs\/1707.05629, [v4] (2018). (A preliminary version in ICDCN 2018)"},{"key":"2_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/978-3-642-04355-0_44","volume-title":"Distributed Computing","author":"E Bampas","year":"2009","unstructured":"Bampas, E., G\u0105sieniec, L., Hanusse, N., Ilcinkas, D., Klasing, R., Kosowski, A.: Euler tour lock-in problem in the rotor-router model. In: Keidar, I. (ed.) DISC 2009. LNCS, vol. 5805, pp. 423\u2013435. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04355-0_44"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Barriere, L., Flocchini, P., Mesa-Barrameda, E., Santoro, N.: Uniform scattering of autonomous mobile robots in a grid. In: IPDPS, pp. 1\u20138 (2009)","DOI":"10.1109\/IPDPS.2009.5160871"},{"issue":"4","key":"2_CR4","doi-asserted-by":"publisher","first-page":"42:1","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 4(4), 42:1\u201342:18 (2008)","journal-title":"ACM Trans. Algorithms"},{"key":"2_CR5","volume-title":"Introduction to Algorithms","author":"TH Cormen","year":"2009","unstructured":"Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 3rd edn. The MIT Press, Cambridge (2009)","edition":"3"},{"issue":"2","key":"2_CR6","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","volume":"7","author":"G Cybenko","year":"1989","unstructured":"Cybenko, G.: Dynamic load balancing for distributed memory multiprocessors. J. Parallel Distrib. Comput. 7(2), 279\u2013301 (1989)","journal-title":"J. Parallel Distrib. Comput."},{"key":"2_CR7","doi-asserted-by":"publisher","first-page":"171","DOI":"10.1016\/j.tcs.2015.09.018","volume":"609","author":"S Das","year":"2016","unstructured":"Das, S., Flocchini, P., Prencipe, G., Santoro, N., Yamashita, M.: Autonomous mobile robots with lights. Theor. Comput. Sci. 609, 171\u2013184 (2016)","journal-title":"Theor. Comput. Sci."},{"issue":"C","key":"2_CR8","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., Uzna\u0144ski, P.: Fast collaborative graph exploration. Inf. Comput. 243(C), 37\u201349 (2015)","journal-title":"Inf. Comput."},{"issue":"8\u201310","key":"2_CR9","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."},{"issue":"2","key":"2_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.2200\/S00440ED1V01Y201208DCT010","volume":"3","author":"P Flocchini","year":"2012","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed computing by oblivious mobile robots. Synth. Lect. Distrib. Comput. Theory 3(2), 1\u2013185 (2012)","journal-title":"Synth. Lect. Distrib. Comput. Theory"},{"key":"2_CR11","series-title":"Theoretical Computer Science and General Issues","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-11072-7","volume-title":"Distributed Computing by Mobile Entities","author":"P Flocchini","year":"2019","unstructured":"Flocchini, P., Prencipe, G., Santoro, N.: Distributed Computing by Mobile Entities. Theoretical Computer Science and General Issues, vol. 1. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-11072-7"},{"issue":"3","key":"2_CR12","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1002\/net.20127","volume":"48","author":"P Fraigniaud","year":"2006","unstructured":"Fraigniaud, P., Gasieniec, L., Kowalski, D.R., Pelc, A.: Collective tree exploration. Networks 48(3), 166\u2013177 (2006)","journal-title":"Networks"},{"issue":"2\u20133","key":"2_CR13","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. 345(2\u20133), 331\u2013344 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"2_CR14","doi-asserted-by":"crossref","unstructured":"Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S., Mitchell, J.S.B.: Online dispersion algorithms for swarms of robots. In: SoCG, pp. 382\u2013383 (2003)","DOI":"10.1145\/777792.777854"},{"key":"2_CR15","series-title":"Springer Tracts in Advanced Robotics","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1007\/978-3-540-45058-0_6","volume-title":"Algorithmic Foundations of Robotics V","author":"T-R Hsiang","year":"2004","unstructured":"Hsiang, T.-R., Arkin, E.M., Bender, M.A., Fekete, S.P., Mitchell, J.S.B.: Algorithms for rapidly dispersing robot swarms in unknown environments. In: Boissonnat, J.-D., Burdick, J., Goldberg, K., Hutchinson, S. (eds.) Algorithmic Foundations of Robotics V. STAR, vol. 7, pp. 77\u201393. Springer, Heidelberg (2004). \nhttps:\/\/doi.org\/10.1007\/978-3-540-45058-0_6"},{"key":"2_CR16","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":"2_CR17","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1016\/j.ipl.2017.06.010","volume":"127","author":"A Menc","year":"2017","unstructured":"Menc, A., Pajak, D., Uznanski, P.: Time and space optimality of rotor-router graph exploration. Inf. Process. Lett. 127, 17\u201320 (2017)","journal-title":"Inf. Process. Lett."},{"key":"2_CR18","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). \nhttps:\/\/doi.org\/10.1007\/978-3-030-14812-6_30"},{"key":"2_CR19","doi-asserted-by":"crossref","unstructured":"Poudel, P., Sharma, G.: Time-optimal uniform scattering in a grid. In: ICDCN, pp. 228\u2013237 (2019)","DOI":"10.1145\/3288599.3288622"},{"key":"2_CR20","doi-asserted-by":"crossref","unstructured":"Shibata, M., Mega, T., Ooshita, F., Kakugawa, H., Masuzawa, T.: Uniform deployment of mobile agents in asynchronous rings. In: PODC, pp. 415\u2013424 (2016)","DOI":"10.1145\/2933057.2933093"},{"key":"2_CR21","doi-asserted-by":"crossref","unstructured":"Subramanian, R., Scherson, I.D.: An analysis of diffusive load-balancing. In: SPAA, pp. 220\u2013225 (1994)","DOI":"10.1145\/181014.181361"}],"container-title":["Lecture Notes in Computer Science","Algorithms for Sensor Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-34405-4_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,18]],"date-time":"2019-11-18T14:04:45Z","timestamp":1574085885000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-34405-4_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030344047","9783030344054"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-34405-4_2","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"5 November 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALGOSENSORS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Symposium on Algorithms and Experiments for Sensor Systems, Wireless Networks and Distributed Robotics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"algosensors2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo2019.ak.in.tum.de\/index.php\/menue-algosensors\/algosensors-overview","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":"16","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":"11","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":"0","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":"69% - 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","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":"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)"}}]}}