P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, Computing without communicating: Ring exploration by asynchronous oblivious robots, International Conference on Principles of Distributed Systems (OPODIS), pp.105-118, 2007.
DOI : 10.1007/s00453-011-9611-5
URL : https://hal.archives-ouvertes.fr/hal-00339884

S. Devismes, F. Petit, and S. Tixeuil, Optimal probabilistic ring exploration by semi-synchronous oblivious robots, Theoretical Computer Science, vol.498, pp.10-27, 2013.
DOI : 10.1016/j.tcs.2013.05.031
URL : https://hal.archives-ouvertes.fr/hal-00930045

S. Devismes, A. Lamani, F. Petit, and S. Tixeuil, Optimal Torus Exploration by Oblivious Robots, Third International Conference on Networked Systems (NETYS 2015), ser. Lecture Notes in Computer Science (LNCS), pp.183-199, 2015.
DOI : 10.1007/978-3-319-26850-7_13
URL : https://hal.archives-ouvertes.fr/hal-01131962

R. Baldoni, F. Bonnet, A. Milani, and M. , On the Solvability of Anonymous Partial Grids Exploration by Mobile Robots, 12th International Conference on Principles of Distributed Systems, pp.428-445, 2008.
DOI : 10.1109/AINA.2007.44
URL : https://hal.archives-ouvertes.fr/inria-00277344

L. Blin, A. Milani, M. Potop-butucaru, and S. Tixeuil, Exclusive Perpetual Ring Exploration without Chirality, 24th International Symposium on Distributed Computing ser. Lecture Notes in Computer Science, pp.312-327, 2010.
DOI : 10.1007/978-3-642-15763-9_29
URL : https://hal.archives-ouvertes.fr/inria-00464206

K. Diks, P. Fraigniaud, E. Kranakis, and A. Pelc, Tree exploration with little memory, Journal of Algorithms, vol.51, issue.1, pp.38-63, 2004.
DOI : 10.1016/j.jalgor.2003.10.002
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.10.8049

F. Bonnet, X. Défago, F. Petit, M. Potop-butucaru, and S. Tixeuil, Discovering and Assessing Fine-Grained Metrics in Robot Networks Protocols, 2014 IEEE 33rd International Symposium on Reliable Distributed Systems Workshops, pp.50-59, 2014.
DOI : 10.1109/SRDSW.2014.34
URL : https://hal.archives-ouvertes.fr/hal-00934186

P. Flocchini, D. Ilcinkas, A. Pelc, and N. Santoro, How many oblivious robots can explore a line, Information Processing Letters, vol.111, issue.20, pp.1027-1031, 2011.
DOI : 10.1016/j.ipl.2011.07.018
URL : https://hal.archives-ouvertes.fr/hal-00643668

J. Chalopin, P. Flocchini, B. Mans, and N. Santoro, Network Exploration by Silent and Oblivious Robots, Theoretic Concepts in Computer Science (WG), pp.208-219, 2010.
DOI : 10.1016/j.tcs.2010.01.037
URL : https://hal.archives-ouvertes.fr/hal-01198880

P. Flocchini, G. Prencipe, N. Santoro, A. Casteigts, P. Flocchini et al., Distributed Computing by Oblivious Mobile Robots, ser. Synthesis Lectures on Distributed Computing Theory Timevarying graphs and dynamic networks, International Journal of Parallel , Emergent and Distributed Systems, vol.27, issue.5, pp.387-408, 2012.
DOI : 10.2200/s00440ed1v01y201208dct010

P. Flocchini, B. Mans, and N. Santoro, Exploration of Periodically Varying Graphs, International Symposium on Algorithms and Computation, pp.534-543, 2009.
DOI : 10.1007/978-3-642-10631-6_55

D. Ilcinkas and A. M. Wade, On the Power of Waiting When Exploring Public Transportation Systems, International Conference on Principles of Distributed Systems (OPODIS), pp.451-464, 2011.
DOI : 10.1007/978-3-642-25873-2_31
URL : https://hal.archives-ouvertes.fr/hal-00656607

D. Ilcinkas, R. Klasing, and A. M. Wade, Exploration of Constantly Connected Dynamic Graphs Based on Cactuses, Colloquium on Structural Information & Communication Complexity (SIROCCO), pp.250-262, 2014.
DOI : 10.1007/978-3-319-09620-9_20
URL : https://hal.archives-ouvertes.fr/hal-01068904

G. , D. Luna, S. Dobrev, P. Flocchini, and N. Santoro, Live exploration of dynamic rings, IEEE International Conference on Distributed Computing Systems (ICDCS), pp.570-579, 2016.
DOI : 10.1109/icdcs.2016.59
URL : http://arxiv.org/abs/1512.05306

F. Kuhn, N. Lynch, and R. Oshman, Distributed computation in dynamic networks, Proceedings of the 42nd ACM symposium on Theory of computing, STOC '10, pp.513-522, 2010.
DOI : 10.1145/1806689.1806760
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.148.1598

M. Bournat, A. K. Datta, and S. Dubois, Self-stabilizing Robots in Highly Dynamic Environments, Stabilization, Safety, and Security of Distributed Systems (SSS), pp.54-69, 2016.
DOI : 10.1007/978-3-319-21741-3_4
URL : https://hal.archives-ouvertes.fr/hal-01416308

R. Klasing, E. Markou, and A. Pelc, Gathering asynchronous oblivious mobile robots in a ring, International Symposium on Algorithms and Computation (ISAAC), pp.744-753, 2006.
DOI : 10.1007/11940128_74
URL : https://hal.archives-ouvertes.fr/hal-00307237

B. Xuan, A. Ferreira, and A. Jarry, COMPUTING SHORTEST, FASTEST, AND FOREMOST JOURNEYS IN DYNAMIC NETWORKS, International Journal of Foundations of Computer Science, vol.4, issue.02, pp.267-285, 2003.
DOI : 10.1002/0471224561
URL : https://hal.archives-ouvertes.fr/inria-00071996

S. Dubois, M. Kaaouachi, and F. Petit, Enabling Minimal Dominating Set in Highly Dynamic Distributed Systems, International Symposium on Stabilization, Safety, and Security of Distributed Systems (SSS), pp.51-66, 2015.
DOI : 10.1007/978-3-319-21741-3_4
URL : https://hal.archives-ouvertes.fr/hal-01111610

M. Bournat, S. Dubois, and F. Petit, Computability of perpetual exploration in highly dynamic rings
URL : https://hal.archives-ouvertes.fr/hal-01417565

N. Braud-santoni, S. Dubois, M. Kaaouachi, and F. Petit, The Next 700 Impossibility Results in Time-Varying Graphs, International Journal of Networking and Computing, vol.6, issue.1, pp.27-41116, 2016.
DOI : 10.15803/ijnc.6.1_27
URL : https://hal.archives-ouvertes.fr/hal-01344422