A. Casteigts, P. Flocchini, W. Quattrociocchi, and N. Santoro, Time-varying graphs and dynamic networks, IJPEDS, vol.27, issue.5, pp.387-408, 2012.
DOI : 10.1080/17445760.2012.668546
URL : https://hal.archives-ouvertes.fr/hal-00854287

A. Himmel, H. Molter, R. Niedermeier, and M. Sorge, Adapting the bronkerbosch algorithm for enumerating maximal cliques in temporal graphs, Social Netw. Analys. Mining, vol.735, issue.1, pp.1-3516, 2017.
DOI : 10.1007/s13278-017-0455-0
URL : http://arxiv.org/pdf/1605.03871

M. Latapy, T. Viard, and C. Magnien, Stream graphs and link streams for the modeling of interactions over time. CoRR, abs, 1710.
URL : https://hal.archives-ouvertes.fr/hal-01665084

T. Viard, M. Latapy, and C. Magnien, Computing maximal cliques in link streams, Theoretical Computer Science, vol.609, pp.245-252, 2016.
DOI : 10.1016/j.tcs.2015.09.030
URL : https://hal.archives-ouvertes.fr/hal-01112627

T. Viard, C. Magnien, and M. Latapy, Enumerating maximal cliques in link streams with durations. CoRR, abs/1712, 2017.
DOI : 10.1016/j.ipl.2018.01.006
URL : http://arxiv.org/pdf/1712.06970