{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,29]],"date-time":"2024-10-29T10:43:03Z","timestamp":1730198583944,"version":"3.28.0"},"reference-count":20,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,8]]},"DOI":"10.1109\/asonam.2018.8508847","type":"proceedings-article","created":{"date-parts":[[2018,10,25]],"date-time":"2018-10-25T23:19:29Z","timestamp":1540509569000},"page":"41-46","source":"Crossref","is-referenced-by-count":2,"title":["Listing All Maximal k-Plexes in Temporal Graphs"],"prefix":"10.1109","author":[{"given":"Matthias","family":"Bentert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anne-Sophie","family":"Himmel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hendrik","family":"Molter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Morik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rolf","family":"Niedermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rene","family":"Saitenmacher","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"431","article-title":"Efficient enumeration of maximal k-plexes","author":"berlowitz","year":"2015","journal-title":"Proc SIGMOD ‘12"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-017-0455-0"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipl.2018.01.006"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2016.1177801"},{"journal-title":"Stream graphs and link streams for the modeling of interactions over time","year":"2017","author":"latapy","key":"ref17"},{"key":"ref18","first-page":"598","article-title":"Massive quasi-clique detection","author":"abello","year":"2002","journal-title":"Proc of LATIN ‘02"},{"key":"ref19","article-title":"Listing all maximal k-plexes in temporal graphs","author":"bentert","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/3097983.3098031"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1038\/srep30098"},{"key":"ref5","first-page":"919","article-title":"A fast algorithm to compute maximum k-plexes in social network analysis","author":"xiao","year":"2017","journal-title":"Proc AAAI ‘94"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-011-9391-5"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-010-9338-2"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2005.05.026"},{"key":"ref1","first-page":"76","article-title":"Clustering algorithms for ad hoc wireless networks","volume":"28","author":"chen","year":"2004","journal-title":"Ad Hoc and Sensor Networks"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2012.10.021"},{"key":"ref20","doi-asserted-by":"crossref","first-page":"3.1:1","DOI":"10.1145\/2543629","article-title":"Listing all maximal cliques in large sparse real-world graphs in near-optimal time","volume":"18","author":"eppstein","year":"2013","journal-title":"Journal of Experimental Algorithmics"}],"event":{"name":"2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)","start":{"date-parts":[[2018,8,28]]},"location":"Barcelona","end":{"date-parts":[[2018,8,31]]}},"container-title":["2018 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8488381\/8508239\/08508847.pdf?arnumber=8508847","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,26]],"date-time":"2022-01-26T18:12:12Z","timestamp":1643220732000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8508847\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,8]]},"references-count":20,"URL":"https:\/\/doi.org\/10.1109\/asonam.2018.8508847","relation":{},"subject":[],"published":{"date-parts":[[2018,8]]}}}