Listing All Maximal $k$-Plexes in Temporal Graphs. Bentert, M., Himmel, A., Molter, H., Morik, M., Niedermeier, R., & Saitenmacher, R. ACM Journal of Experimental Algorithmics, 24(1):13:1–13:27, ACM, 2019.
bibtex   
@article{HimmelMNS17, 
	Title = {Listing All Maximal $k$-Plexes in Temporal Graphs},
	Author = {Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and Ren\'{e} Saitenmacher},
  journal={ACM Journal of Experimental Algorithmics},
  year={2019},
  publisher={ACM},
  volume    = {24},
  number    = {1},
  pages     = {13:1--13:27}
}
%	Author = {Anne{-}Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge},
%	Journal = {Social Network Analysis and Mining},
%	Number = {1},
%	Pages = {35:1--35:16},
%	Title = {Adapting the {B}ron-{K}erbosch algorithm for enumerating maximal cliques in temporal graphs},
%	Volume = {7},
%	Year = {2017},
%}

Downloads: 0