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

C. Cattuto, W. Van-den-broeck, A. Barrat, V. Colizza, J. Pinton et al., Dynamics of Person-to-Person Interactions from Distributed RFID Sensor Networks, PLoS ONE, vol.41, issue.7, p.11596, 2010.
DOI : 10.1371/journal.pone.0011596.s007
URL : https://hal.archives-ouvertes.fr/hal-00503275

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.

J. Fournet and A. Barrat, Contact Patterns among High School Students, PLoS ONE, vol.59, issue.9, p.107878, 2014.
DOI : 10.1371/journal.pone.0107878.s001
URL : https://hal.archives-ouvertes.fr/hal-01065922

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

T. Hossmann, T. Spyropoulos, and F. Legendre, A complex network analysis of human mobility, 2011 IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS), 2011.
DOI : 10.1109/INFCOMW.2011.5928936

T. Hossmann, T. Spyropoulos, and F. Legendre, Putting contacts into context, Proceedings of the Twelfth ACM International Symposium on Mobile Ad Hoc Networking and Computing, MobiHoc '11, pp.1-18, 2011.
DOI : 10.1145/2107502.2107526

D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou, On generating all maximal independent sets, Information Processing Letters, vol.27, issue.3, pp.119-123, 1988.
DOI : 10.1016/0020-0190(88)90065-8

A. Pietilänen and C. Diot, Dissemination in opportunistic social networks, Proceedings of the thirteenth ACM international symposium on Mobile Ad Hoc Networking and Computing, MobiHoc '12, pp.165-174
DOI : 10.1145/2248371.2248396

M. Starnini, A. Baronchelli, and R. Pastor-satorras, Modeling Human Dynamics of Face-to-Face Interaction Networks, Physical Review Letters, vol.110, issue.16, p.168701, 2013.
DOI : 10.1103/PhysRevLett.110.168701

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, Source code in python for drawing link streams: https://github.com/TiphaineV, 2014.

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 and M. Latapy, Source code in python for computing cliques in link streams: https://github, 2014.

T. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams, Theoretical Computer Science, vol.609, 2015.
DOI : 10.1016/j.tcs.2015.09.030
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