D. Avis and K. Fukuda, Reverse search for enumeration, Discrete Applied Mathematics, vol.65, issue.1-3, pp.21-46, 1996.
DOI : 10.1016/0166-218X(95)00026-N

C. Bron and J. Kerbosch, Algorithm 457: finding all cliques of an undirected graph, Communications of the ACM, vol.16, issue.9, 1973.
DOI : 10.1145/362342.362367

A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00847001

N. Chiba and T. Nishizeki, Arboricity and Subgraph Listing Algorithms, SIAM Journal on Computing, vol.14, issue.1, pp.210-223, 1985.
DOI : 10.1137/0214017

D. Eppstein and D. Strash, Listing all maximal cliques in large sparse real-world graphs. Experimental Algorithms, pp.364-375, 2011.

P. Holme and J. Saramäki, Temporal networks, Physics Reports, vol.519, issue.3, pp.97-125, 2012.
DOI : 10.1016/j.physrep.2012.03.001

E. Tomita, A. Tanaka, and H. Takahashi, The worst-case time complexity for generating all maximal cliques and computational experiments, Theoretical Computer Science, vol.363, issue.1, pp.28-42, 2006.
DOI : 10.1016/j.tcs.2006.06.015

T. Viard and M. Latapy, Identifying roles in an IP network with temporal and structural density, 2014 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), pp.801-806, 2014.
DOI : 10.1109/INFCOMW.2014.6849333
URL : https://hal.archives-ouvertes.fr/hal-01009382

T. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams. ArXiv e-prints, 2015.
URL : https://hal.archives-ouvertes.fr/hal-01112627

K. Wehmuth, A. Ziviani, and E. Fleury, A unifying model for representing time-varying graphs, 2015 IEEE International Conference on Data Science and Advanced Analytics (DSAA), 2014.
DOI : 10.1109/DSAA.2015.7344810
URL : https://hal.archives-ouvertes.fr/hal-00941622