E. C. Akrida, G. B. Mertzios, P. G. Spirakis, and V. Zamaraev, Temporal vertex cover with a sliding time window, Journal of Computer and System Sciences, vol.107, pp.108-123, 2020.

B. M. Bui-xuan, A. Ferreira, and A. Jarry, Computing shortest, fastest, and foremost journeys in dynamic networks, International Journal of Foundations of Computer Science, vol.14, issue.2, pp.267-285, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00071996

A. Casteigts, P. Flocchini, E. Godard, N. Santoro, and M. Yamashita, Expressivity of Time-Varying Graphs, Fundamentals of Computation Theory, pp.95-106, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00846875

B. Dean, Continuous-Time Dynamic Shortest Path Algorithms. Ph.D. thesis, Massachusetts Institute of Technology, 1999.

J. Dibbelt, T. Pajor, B. Strasser, and D. Wagner, Connection Scan Algorithm, ACM Journal of Experimental Algorithmics, vol.23, pp.1-56, 2018.

A. Ehrenfeucht, T. Harju, and G. Rozenberg, The Theory of 2-Structures, 1999.

T. Erlebach, M. Hoffmann, and F. Kammer, On Temporal Graph Exploration, Automata, Languages, and Programming, vol.9134, pp.444-455, 2015.

L. Foschini, J. Hershberger, and S. Suri, On the Complexity of Time-Dependent Shortest Paths, Algorithmica, vol.68, issue.4, pp.1075-1097, 2012.

M. Habib and C. Paul, A survey of the algorithmic aspects of modular decomposition, Computer Science Review, vol.4, issue.1, pp.41-59, 2010.

M. Habib, C. Paul, and L. Viennot, PARTITION REFINEMENT TECHNIQUES: AN INTERESTING ALGORITHMIC TOOL KIT, International Journal of Foundations of Computer Science, vol.10, issue.02, pp.147-170, 1999.

D. Kempe, J. Kleinberg, and A. Kumar, Connectivity and Inference Problems for Temporal Networks, Journal of Computer and System Sciences, vol.64, issue.4, pp.820-842, 2002.

B. Klimt and Y. Yang, The Enron Corpus: A New Dataset for Email Classification Research, Machine Learning: ECML 2004, pp.217-226, 2004.

M. Latapy, T. Viard, and C. Magnien, Stream graphs and link streams for the modeling of interactions over time, Social Network Analysis and Mining, vol.8, issue.1, 2018.
URL : https://hal.archives-ouvertes.fr/hal-01665084

F. J. Ros, P. M. Ruiz, and I. Stojmenovic, Acknowledgment-Based Broadcast Protocol for Reliable and Efficient Data Dissemination in Vehicular Ad Hoc Networks, IEEE Transactions on Mobile Computing, vol.11, issue.1, pp.33-46, 2012.

J. Spinrad, Efficient Graph Representations, Efficient Graph Representations. Field Institute Monographs, vol.19, 2003.

P. U. Tournoux, J. Leguay, F. Benbadis, V. Conan, M. Dias-de-amorim et al., The Accordion Phenomenon: Analysis, Characterization, and Impact on DTN Routing, IEEE INFOCOM 2009 - The 28th Conference on Computer Communications, 2009.
URL : https://hal.archives-ouvertes.fr/hal-01295162

I. Tsalouchidou, R. Baeza-yates, F. Bonchi, K. Liao, and T. Sellis, Temporal betweenness centrality in dynamic graphs, International Journal of Data Science and Analytics, vol.9, issue.3, pp.257-272, 2019.

T. Viard, C. Magnien, and M. Latapy, Enumerating maximal cliques in link streams with durations, Information Processing Letters, vol.133, pp.44-48, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02085259