1. Aaron, E., Krizanc, D., Meyerson, E.: DMVP: foremost waypoint coverage of time-varying graphs. In: 40th international workshop on graph-theoretic concepts in computer science (WG), LNCS, vol. 8147, pp 29–41 (2014)
2. Aaron, E., Krizanc, D., Meyerson, E.: Multi-robot foremost coverage of time-varying graphs. In: 10th international symposium on algorithms and experiments for sensor systems, wireless networks and distributed robotics (ALGOSENSORS), LNCS, vol. 8847, pp 22–38 (2014)
3. Agarwalla, A., Augustine, J., Moses, W.K. Jr, Madhav, S.K., Sridhar, A.K.: Deterministic dispersion of mobile robots in dynamic rings. In: 19th international conference on distributed computing and networking, ICDCN 2018, pp 19:1–19:4 (2018)
4. Bodlaender, H.L., van der Zanden, T.C.: On exploring always-connected temporal graphs of small pathwidth In. Inform Process Lett 142, 68–71 (2019)
5. Bournat, M., Dubois, S., Petit, F: Computability of perpetual exploration in highly dynamic rings. In: 37th IEEE international conference on distributed computing systems (ICDCS), IEEE computer society, pp 794–804 (2017)