R. Burkard and J. Krarup, A linear algorithm for the pos/neg-weighted 1-median problem on a cactus, Computing, vol.37, issue.3, pp.193-216, 1998.
DOI : 10.1007/BF02684332

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, International Journal of Parallel, vol.27, issue.5, p.2012
URL : https://hal.archives-ouvertes.fr/hal-00847001

C. Dutta, G. Pandurangan, R. Rajaraman, and Z. Sun, Information spreading in dynamic networks, 2011.

A. Ferreira, Building a Reference Combinatorial Model for Dynamic Networks: Initial Results in Evolving Graphs, p.5041, 2003.

D. Ilcinkas and A. M. Wade, Exploration of the T-Interval-Connected Dynamic Graphs: The Case of the Ring, Structural Information and Communication Complexity (SIROCCO), pp.13-23, 2013.
DOI : 10.1145/1959045.1959064
URL : https://hal.archives-ouvertes.fr/hal-00847771

F. Kuhn, N. A. 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

F. Kuhn and R. Oshman, Dynamic networks, ACM SIGACT News, vol.42, issue.1, pp.82-96, 2011.
DOI : 10.1145/1959045.1959064

T. Mömke and O. Svensson, Approximating Graphic TSP by Matchings, 2011 IEEE 52nd Annual Symposium on Foundations of Computer Science, pp.560-569, 2011.
DOI : 10.1109/FOCS.2011.56

M. Mucha, $\frac{13}{9}$ -Approximation for Graphic TSP, 29th Int. Symposium on Theoretical Aspects of Computer Science (STACS, pp.30-41, 2012.
DOI : 10.1007/s00224-012-9439-7

R. O. Dell and R. Wattenhofer, Information dissemination in highly dynamic graphs, pp.104-110, 2005.

A. Sebö and J. , Vygen: Shorter Tours by Nicer Ears: 7/5-approximation for graphic TSP, 3/2 for the path version

C. E. Shannon, Presentation of a maze-solving machine, 8th Conf. of the Josiah Macy Jr. Found. (Cybernetics), pp.173-180, 1951.