{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T14:01:25Z","timestamp":1784815285988,"version":"3.55.0"},"reference-count":39,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,11,1]],"date-time":"2026-11-01T00:00:00Z","timestamp":1793491200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100018978","name":"Indian Institute of Technology Ropar","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100018978","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001412","name":"Council of Scientific and Industrial Research","doi-asserted-by":"publisher","award":["09\/1005(0048)\/2020-EMR-I"],"award-info":[{"award-number":["09\/1005(0048)\/2020-EMR-I"]}],"id":[{"id":"10.13039\/501100001412","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[2026,11]]},"DOI":"10.1016\/j.jcss.2026.103829","type":"journal-article","created":{"date-parts":[[2026,6,11]],"date-time":"2026-06-11T17:56:26Z","timestamp":1781200586000},"page":"103829","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["Balanced dispersion on time-varying dynamic graphs"],"prefix":"10.1016","volume":"161","author":[{"given":"Ashish","family":"Saxena","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Tanvir","family":"Kaur","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9606-9293","authenticated-orcid":false,"given":"Kaushik","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/j.jcss.2026.103829_br0010","series-title":"Proceedings of the 26th International Conference on Distributed Computing and Networking","first-page":"269","article-title":"Dispersion on time varying graphs","author":"Saxena","year":"2025"},{"key":"10.1016\/j.jcss.2026.103829_br0020","series-title":"ICDCN","article-title":"Dispersion of mobile robots: a study of memory-time trade-offs","author":"Augustine","year":"2018"},{"key":"10.1016\/j.jcss.2026.103829_br0030","series-title":"ICDCN '19","first-page":"218","article-title":"Efficient dispersion of mobile robots on graphs","author":"Kshemkalyani","year":"2019"},{"key":"10.1016\/j.jcss.2026.103829_br0040","series-title":"Algorithms for Sensor Systems","first-page":"23","article-title":"Fast dispersion of mobile robots on arbitrary graphs","author":"Kshemkalyani","year":"2019"},{"key":"10.1016\/j.jcss.2026.103829_br0050","series-title":"SSS","first-page":"280","article-title":"Efficient dispersion of mobile agents without global knowledge","author":"Shintaku","year":"2020"},{"key":"10.1016\/j.jcss.2026.103829_br0060","series-title":"OPODIS","article-title":"Near-optimal dispersion on arbitrary anonymous graphs","volume":"vol. 217","author":"Kshemkalyani","year":"2021"},{"key":"10.1016\/j.jcss.2026.103829_br0070","series-title":"38th International Symposium on Distributed Computing (DISC 2024)","first-page":"38:1","article-title":"Near-linear time dispersion of mobile agents","volume":"vol. 319","author":"Sudo","year":"2024"},{"key":"10.1016\/j.jcss.2026.103829_br0080","series-title":"Theory and Applications of Models of Computation","first-page":"481","article-title":"Dispersion of mobile robots: the power of randomness","author":"Molla","year":"2019"},{"key":"10.1016\/j.jcss.2026.103829_br0090","doi-asserted-by":"crossref","first-page":"171","DOI":"10.1016\/j.dam.2023.07.005","article-title":"Memory optimal dispersion by anonymous mobile robots","volume":"340","author":"Das","year":"2023","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/j.jcss.2026.103829_br0100","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.104852","article-title":"Collaborative dispersion by silent robots","volume":"188","author":"Gorain","year":"2024","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0110","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2025.105139","article-title":"Dispersion of mobile robots on directed anonymous graphs","volume":"204","author":"Italiano","year":"2025","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0120","doi-asserted-by":"crossref","DOI":"10.1016\/j.jcss.2025.103656","article-title":"Near-optimal dispersion on arbitrary anonymous graphs","volume":"152","author":"Kshemkalyani","year":"2025","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103829_br0130","doi-asserted-by":"crossref","first-page":"100","DOI":"10.1016\/j.jpdc.2021.11.007","article-title":"Dispersion of mobile robots using global communication","volume":"161","author":"Kshemkalyani","year":"2022","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0140","series-title":"Dispersion Is (Almost) Optimal Under (a)Synchrony","author":"Kshemkalyani","year":"2025"},{"key":"10.1016\/j.jcss.2026.103829_br0150","author":"Pattanayak"},{"issue":"8","key":"10.1016\/j.jcss.2026.103829_br0160","doi-asserted-by":"crossref","first-page":"783","DOI":"10.1016\/j.tcs.2010.11.023","article-title":"Uniform multi-agent deployment on a ring","volume":"412","author":"Elor","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103829_br0170","doi-asserted-by":"crossref","first-page":"92","DOI":"10.1016\/j.jpdc.2018.03.008","article-title":"Uniform deployment of mobile agents in asynchronous rings","volume":"119","author":"Shibata","year":"2018","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0180","doi-asserted-by":"crossref","DOI":"10.1016\/j.ic.2022.104949","article-title":"Almost uniform deployment of mobile agents in dynamic rings","volume":"289","author":"Shibata","year":"2022","journal-title":"Inf. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0190","series-title":"LATIN 2004: Theoretical Informatics","first-page":"141","article-title":"Collective tree exploration","author":"Fraigniaud","year":"2004"},{"issue":"2","key":"10.1016\/j.jcss.2026.103829_br0200","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1016\/0743-7315(89)90021-X","article-title":"Dynamic load balancing for distributed memory multiprocessors","volume":"7","author":"Cybenko","year":"1989","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0210","series-title":"7th International Symposium on Parallel Architectures, Algorithms and Networks, Proceedings","first-page":"193","article-title":"Load balancing in dynamic networks","author":"Elsasser","year":"2004"},{"key":"10.1016\/j.jcss.2026.103829_br0220","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.tcs.2016.04.006","article-title":"Traveling salesman problems in temporal graphs","volume":"634","author":"Michail","year":"2016","journal-title":"Theor. Comput. Sci."},{"key":"10.1016\/j.jcss.2026.103829_br0230","series-title":"STOC '10","article-title":"Distributed computation in dynamic networks","author":"Kuhn","year":"2010"},{"key":"10.1016\/j.jcss.2026.103829_br0240","doi-asserted-by":"crossref","DOI":"10.1016\/j.tcs.2025.115390","article-title":"Path connected dynamic graphs with a study of dispersion and exploration","volume":"1050","author":"Saxena","year":"2025","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"10.1016\/j.jcss.2026.103829_br0250","doi-asserted-by":"crossref","first-page":"2016","DOI":"10.1016\/j.jpdc.2013.07.007","article-title":"Causality, influence, and computation in possibly disconnected synchronous dynamic networks","volume":"74","author":"Michail","year":"2014","journal-title":"J. Parallel Distrib. Comput."},{"issue":"3","key":"10.1016\/j.jcss.2026.103829_br0260","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1002\/net.21453","article-title":"Deterministic rendezvous in networks: a comprehensive survey","volume":"59","author":"Pelc","year":"2012","journal-title":"Networks"},{"key":"10.1016\/j.jcss.2026.103829_br0270","series-title":"ICDCS 2018","first-page":"775","article-title":"Group exploration of dynamic tori","author":"Gotoh","year":"2018"},{"key":"10.1016\/j.jcss.2026.103829_br0280","series-title":"SSS","first-page":"165","article-title":"Exploration of dynamic ring networks by a single agent with the h-hops and s-time steps view","author":"Gotoh","year":"2019"},{"key":"10.1016\/j.jcss.2026.103829_br0290","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.jcss.2021.04.003","article-title":"Exploration of dynamic networks: tight bounds on the number of agents","volume":"122","author":"Gotoh","year":"2021","journal-title":"J. Comput. Syst. Sci."},{"key":"10.1016\/j.jcss.2026.103829_br0300","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/s00446-018-0339-1","article-title":"Distributed exploration of dynamic rings","volume":"33","author":"Di Luna","year":"2020","journal-title":"Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0310","series-title":"ICDCS 2017","first-page":"794","article-title":"Computability of perpetual exploration in highly dynamic rings","author":"Bournat","year":"2017"},{"key":"10.1016\/j.jcss.2026.103829_br0320","doi-asserted-by":"crossref","DOI":"10.1016\/j.jpdc.2024.104998","article-title":"Locating a black hole in a dynamic ring","volume":"196","author":"Di Luna","year":"2025","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1016\/j.jcss.2026.103829_br0330","series-title":"ICDCS","first-page":"732","article-title":"Efficient dispersion of mobile robots on dynamic graphs","author":"Kshemkalyani","year":"2020"},{"key":"10.1016\/j.jcss.2026.103829_br0340","series-title":"39th International Symposium on Distributed Computing (DISC 2025)","article-title":"Natural calamities demand more rescuers: exploring connectivity time dynamic graphs","volume":"vol. 356","author":"Saxena","year":"2025"},{"issue":"5","key":"10.1016\/j.jcss.2026.103829_br0350","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1080\/17445760.2012.668546","article-title":"Time-varying graphs and dynamic networks","volume":"27","author":"Casteigts","year":"2012","journal-title":"Int. J. Parallel Emerg. Distrib. Syst."},{"issue":"3","key":"10.1016\/j.jcss.2026.103829_br0360","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1002\/net.20127","article-title":"Collective tree exploration","volume":"48","author":"Fraigniaud","year":"2006","journal-title":"Networks"},{"key":"10.1016\/j.jcss.2026.103829_br0370","series-title":"ICDCN '20","article-title":"Dispersion of mobile robots in the global communication model","author":"Kshemkalyani","year":"2020"},{"key":"10.1016\/j.jcss.2026.103829_br0380","series-title":"ICDCN '18","article-title":"Deterministic dispersion of mobile robots in dynamic rings","author":"Agarwalla","year":"2018"},{"key":"10.1016\/j.jcss.2026.103829_br0390","series-title":"Algorithms for Sensor Systems","first-page":"140","article-title":"Fast Byzantine gathering with visibility in graphs","author":"Miller","year":"2020"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000759?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0022000026000759?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,7,23]],"date-time":"2026-07-23T13:13:38Z","timestamp":1784812418000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0022000026000759"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,11]]},"references-count":39,"alternative-id":["S0022000026000759"],"URL":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103829","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[2026,11]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Balanced dispersion on time-varying dynamic graphs","name":"articletitle","label":"Article Title"},{"value":"Journal of Computer and System Sciences","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.jcss.2026.103829","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier Inc. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"103829"}}