@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},
%}

{"_id":"hRFM3qcKxgBptA3Wy","bibbaseid":"bentert-himmel-molter-morik-niedermeier-saitenmacher-listingallmaximalkplexesintemporalgraphs-2019","author_short":["Bentert, M.","Himmel, A.","Molter, H.","Morik, M.","Niedermeier, R.","Saitenmacher, R."],"bibdata":{"bibtype":"article","type":"article","title":"Listing All Maximal $k$-Plexes in Temporal Graphs","author":[{"firstnames":["Matthias"],"propositions":[],"lastnames":["Bentert"],"suffixes":[]},{"firstnames":["Anne-Sophie"],"propositions":[],"lastnames":["Himmel"],"suffixes":[]},{"firstnames":["Hendrik"],"propositions":[],"lastnames":["Molter"],"suffixes":[]},{"firstnames":["Marco"],"propositions":[],"lastnames":["Morik"],"suffixes":[]},{"firstnames":["Rolf"],"propositions":[],"lastnames":["Niedermeier"],"suffixes":[]},{"firstnames":["René"],"propositions":[],"lastnames":["Saitenmacher"],"suffixes":[]}],"journal":"ACM Journal of Experimental Algorithmics","year":"2019","publisher":"ACM","volume":"24","number":"1","pages":"13:1–13:27","bibtex":"@article{HimmelMNS17, \n\tTitle = {Listing All Maximal $k$-Plexes in Temporal Graphs},\n\tAuthor = {Matthias Bentert and Anne-Sophie Himmel and Hendrik Molter and Marco Morik and Rolf Niedermeier and Ren\\'{e} Saitenmacher},\n journal={ACM Journal of Experimental Algorithmics},\n year={2019},\n publisher={ACM},\n volume = {24},\n number = {1},\n pages = {13:1--13:27}\n}\n%\tAuthor = {Anne{-}Sophie Himmel and Hendrik Molter and Rolf Niedermeier and Manuel Sorge},\n%\tJournal = {Social Network Analysis and Mining},\n%\tNumber = {1},\n%\tPages = {35:1--35:16},\n%\tTitle = {Adapting the {B}ron-{K}erbosch algorithm for enumerating maximal cliques in temporal graphs},\n%\tVolume = {7},\n%\tYear = {2017},\n%}\n\n","author_short":["Bentert, M.","Himmel, A.","Molter, H.","Morik, M.","Niedermeier, R.","Saitenmacher, R."],"key":"HimmelMNS17","id":"HimmelMNS17","bibbaseid":"bentert-himmel-molter-morik-niedermeier-saitenmacher-listingallmaximalkplexesintemporalgraphs-2019","role":"author","urls":{},"metadata":{"authorlinks":{}},"html":""},"bibtype":"article","biburl":"https://bibbase.org/network/files/BZWfBuZY3E6mypcu8","dataSources":["5GsqcumS3vErfsixj"],"keywords":[],"search_terms":["listing","maximal","plexes","temporal","graphs","bentert","himmel","molter","morik","niedermeier","saitenmacher"],"title":"Listing All Maximal $k$-Plexes in Temporal Graphs","year":2019}