{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T19:32:18Z","timestamp":1786217538767,"version":"3.56.0"},"reference-count":34,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2018,11,28]],"date-time":"2018-11-28T00:00:00Z","timestamp":1543363200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Data Min Knowl Disc"],"published-print":{"date-parts":[[2019,9]]},"DOI":"10.1007\/s10618-018-0602-x","type":"journal-article","created":{"date-parts":[[2018,11,27]],"date-time":"2018-11-27T22:38:36Z","timestamp":1543358316000},"page":"1417-1445","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":30,"title":["Finding lasting dense subgraphs"],"prefix":"10.1007","volume":"33","author":[{"given":"Konstantinos","family":"Semertzidis","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evaggelia","family":"Pitoura","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Evimaria","family":"Terzi","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Panayiotis","family":"Tsaparas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2018,11,28]]},"reference":[{"key":"602_CR1","unstructured":"Alvarez-Hamelin JI, Dall\u2019Asta L, Barrat A, Vespignani A (2005) Large scale networks fingerprinting and visualization using the k-core decomposition. In: Advances in neural information processing systems, [neural information processing systems, NIPS 2005, December 5\u20138, 2005, Vancouver, British Columbia, Canada], 2005, vol 18. MIT Press Cambridge, MA, USA, pp 41\u201350"},{"issue":"3","key":"602_CR2","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/s10115-015-0847-2","volume":"46","author":"M Araujo","year":"2016","unstructured":"Araujo M, G\u00fcnnemann S, Papadimitriou S, Faloutsos C, Basu P, Swami A, Papalexakis EE, Koutra D (2016) Discovery of \u201ccomet\u201d communities in temporal and labeled graphs com\n                    \n                      \n                    \n                    $$^{2}$$\n                    \n                      \n                        \n                          \n                          2\n                        \n                      \n                    \n                  . Knowl Inf Syst 46(3):657\u2013677. \n                    https:\/\/doi.org\/10.1007\/s10115-015-0847-2","journal-title":"Knowl Inf Syst"},{"key":"602_CR3","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1006\/jagm.1999.1062","volume":"34","author":"Y Asahiro","year":"2000","unstructured":"Asahiro Y, Iwama K, Tamaki H, Tokuyama T (2000) Greedily finding a dense subgraph. J Algorithms 34:203\u2013221. \n                    https:\/\/doi.org\/10.1006\/jagm.1999.1062","journal-title":"J Algorithms"},{"issue":"5","key":"602_CR4","doi-asserted-by":"publisher","first-page":"454","DOI":"10.14778\/2140436.2140442","volume":"5","author":"B Bahmani","year":"2012","unstructured":"Bahmani B, Kumar R, Vassilvitskii S (2012) Densest subgraph in streaming and mapreduce. PVLDB 5(5):454\u2013465. \n                    https:\/\/doi.org\/10.14778\/2140436.2140442","journal-title":"PVLDB"},{"key":"602_CR5","doi-asserted-by":"publisher","unstructured":"Bhattacharya S, Henzinger M, Nanongkai D, Tsourakakis CE (2015) Space- and time-efficient algorithm for maintaining dense subgraphs on one-pass dynamic streams. In: Proceedings of the forty-seventh annual ACM on symposium on theory of computing, STOC 2015, Portland, OR, USA, June 14\u201317, 2015, pp 173\u2013182. \n                    https:\/\/doi.org\/10.1145\/2746539.2746592","DOI":"10.1145\/2746539.2746592"},{"key":"602_CR6","doi-asserted-by":"publisher","unstructured":"Bogdanov P, Mongiov\u00ec M, Singh AK (2011) Mining heavy subgraphs in time-evolving networks. In: 11th IEEE international conference on data mining, ICDM 2011, Vancouver, BC, Canada, December 11\u201314, 2011, pp 81\u201390. \n                    https:\/\/doi.org\/10.1109\/ICDM.2011.101","DOI":"10.1109\/ICDM.2011.101"},{"issue":"1","key":"602_CR7","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0377-2217(01)00133-3","volume":"138","author":"J-M Bourjolly","year":"2002","unstructured":"Bourjolly J-M, Laporte G, Pesant G (2002) An exact algorithm for the maximum k-club problem in an undirected graph. Eur J Oper Res 138(1):21\u201328. \n                    https:\/\/doi.org\/10.1016\/S0377-2217(01)00133-3","journal-title":"Eur J Oper Res"},{"key":"602_CR8","doi-asserted-by":"publisher","unstructured":"Cerf L, Besson J, Robardet C, Boulicaut J-F (2008) Data peeler: contraint-based closed pattern mining in n-ary relations. In: Proceedings of the SIAM international conference on data mining, SDM 2008, April 24\u201326, 2008, Atlanta, Georgia, USA, pp 37\u201348. \n                    https:\/\/doi.org\/10.1137\/1.9781611972788.4","DOI":"10.1137\/1.9781611972788.4"},{"key":"602_CR9","doi-asserted-by":"publisher","unstructured":"Charikar M (2000) Greedy approximation algorithms for finding dense components in a graph. In: Approximation algorithms for combinatorial optimization, third international workshop, APPROX 2000, Saarbr\u00fccken, Germany, September 5\u20138, 2000, proceedings, pp 84\u201395. \n                    https:\/\/doi.org\/10.1007\/3-540-44436-X_10","DOI":"10.1007\/3-540-44436-X_10"},{"key":"602_CR10","doi-asserted-by":"publisher","unstructured":"Epasto A, Lattanzi S, Sozio M (2015) Efficient densest subgraph computation in evolving graphs. In: Proceedings of the 24th international conference on world wide web, WWW 2015, Florence, Italy, May 18\u201322, 2015, pp 300\u2013310. \n                    https:\/\/doi.org\/10.1145\/2736277.2741638","DOI":"10.1145\/2736277.2741638"},{"key":"602_CR11","unstructured":"Fortunato S (2009) Community detection in graphs. CoRR. \n                    arXiv:0906.0612"},{"key":"602_CR12","unstructured":"Goldberg AV (1984) Finding a maximum density subgraph. Technical report"},{"key":"602_CR13","doi-asserted-by":"publisher","unstructured":"Jethava V, Beerenwinkel N (2015) Finding dense subgraphs in relational graphs. In: Machine learning and knowledge discovery in databases\u2014European conference, ECML PKDD 2015, Porto, Portugal, September 7\u201311, 2015, Proceedings, Part II, pp 641\u2013654. \n                    https:\/\/doi.org\/10.1007\/978-3-319-23525-7_39","DOI":"10.1007\/978-3-319-23525-7_39"},{"key":"602_CR14","doi-asserted-by":"publisher","unstructured":"Khuller S, Saha B (2009) On finding dense subgraphs. In: Automata, languages and programming, 36th international colloquium, ICALP 2009, Rhodes, Greece, July 5\u201312, 2009, Proceedings, Part I, pp 597\u2013608. \n                    https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"602_CR15","doi-asserted-by":"publisher","unstructured":"Khurana U, Deshpande A (2013) Efficient snapshot retrieval over historical graph data. In: 29th IEEE international conference on data engineering, ICDE 2013, Brisbane, Australia, April 8\u201312, 2013, pp 997\u20131008. \n                    https:\/\/doi.org\/10.1109\/ICDE.2013.6544892","DOI":"10.1109\/ICDE.2013.6544892"},{"issue":"1","key":"602_CR16","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1145\/1217299.1217301","volume":"1","author":"J Leskovec","year":"2007","unstructured":"Leskovec J, Kleinberg JM, Faloutsos C (2007) Graph evolution: densification and shrinking diameters. TKDD 1(1):2. \n                    https:\/\/doi.org\/10.1145\/1217299.1217301","journal-title":"TKDD"},{"key":"602_CR17","doi-asserted-by":"publisher","unstructured":"Ma S, Hu R, Wang L, Lin X, Huai J (2017) Fast computation of dense temporal subgraphs. In: 33rd IEEE international conference on data engineering, ICDE 2017, San Diego, CA, USA, April 19\u201322, 2017, pp 361\u2013372. \n                    https:\/\/doi.org\/10.1109\/ICDE.2017.95","DOI":"10.1109\/ICDE.2017.95"},{"key":"602_CR18","doi-asserted-by":"publisher","unstructured":"Makino K, Uno T (2004) New algorithms for enumerating all maximal cliques. In: Algorithm theory\u2014SWAT 2004, 9th Scandinavian workshop on algorithm theory, Humlebaek, Denmark, July 8\u201310, 2004, Proceedings, pp 260\u2013272. \n                    https:\/\/doi.org\/10.1007\/978-3-540-27810-8_23","DOI":"10.1007\/978-3-540-27810-8_23"},{"issue":"1","key":"602_CR19","doi-asserted-by":"publisher","first-page":"29","DOI":"10.1007\/s10878-010-9338-2","volume":"23","author":"B McClosky","year":"2012","unstructured":"McClosky B, Hicks IV (2012) Combinatorial algorithms for the maximum k-plex problem. J. Comb. Optim. 23(1):29\u201349. \n                    https:\/\/doi.org\/10.1007\/s10878-010-9338-2","journal-title":"J. Comb. Optim."},{"key":"602_CR20","doi-asserted-by":"publisher","unstructured":"Moffitt VZ, Stoyanovich J (2016) Towards a distributed infrastructure for evolving graph analytics. In: Proceedings of the 25th international conference on world wide web, WWW 2016, Montreal, Canada, April 11\u201315, 2016, Companion Volume, pp 843\u2013848. \n                    https:\/\/doi.org\/10.1145\/2872518.2889290","DOI":"10.1145\/2872518.2889290"},{"key":"602_CR21","doi-asserted-by":"publisher","unstructured":"Myra S (2011) Evolution in social networks: a survey. In: Social network data analytics, pp 149\u2013175. \n                    https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_6","DOI":"10.1007\/978-1-4419-8462-3_6"},{"key":"602_CR22","doi-asserted-by":"publisher","unstructured":"Nguyen K-N, Cerf L, Plantevit M, Boulicaut J-F (2011) Multidimensional association rules in boolean tensors. In: Proceedings of the eleventh SIAM international conference on data mining, SDM 2011, April 28\u201330, Mesa, Arizona, USA, pp 570\u2013581. \n                    https:\/\/doi.org\/10.1137\/1.9781611972818.49","DOI":"10.1137\/1.9781611972818.49"},{"issue":"1","key":"602_CR23","doi-asserted-by":"publisher","first-page":"49","DOI":"10.3233\/IDA-120567","volume":"17","author":"K-N Nguyen","year":"2013","unstructured":"Nguyen K-N, Cerf L, Plantevit M, Boulicaut J-F (2013) Discovering descriptive rules in relational dynamic graphs. Intell. Data Anal. 17(1):49\u201369. \n                    https:\/\/doi.org\/10.3233\/IDA-120567","journal-title":"Intell. Data Anal."},{"issue":"11","key":"602_CR24","first-page":"726","volume":"4","author":"C Ren","year":"2011","unstructured":"Ren C, Lo E, Kao B, Zhu X, Cheng R (2011) On querying historical evolving graph sequences. PVLDB 4(11):726\u2013737","journal-title":"PVLDB"},{"issue":"3","key":"602_CR25","doi-asserted-by":"publisher","first-page":"27:1","DOI":"10.1145\/3046791","volume":"11","author":"P Rozenshtein","year":"2017","unstructured":"Rozenshtein P, Nikolaj T, Aristides G (2017) Finding dynamic dense subgraphs. TKDD 11(3):27:1\u201327:30. \n                    https:\/\/doi.org\/10.1145\/3046791","journal-title":"TKDD"},{"key":"602_CR26","doi-asserted-by":"publisher","unstructured":"Rozenshtein P, Tatti N, Gionis A (2014) Discovering dynamic communities in interaction networks. In: Machine learning and knowledge discovery in databases\u2014European conference, ECML PKDD 2014, Nancy, France, September 15\u201319, 2014. Proceedings, Part II, pp 678\u2013693. \n                    https:\/\/doi.org\/10.1007\/978-3-662-44851-9_43","DOI":"10.1007\/978-3-662-44851-9_43"},{"issue":"99","key":"602_CR27","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1109\/TKDE.2018.2823754","volume":"PP","author":"K Semertzidis","year":"2018","unstructured":"Semertzidis K, Pitoura E (2018) Top-k durable graph pattern queries on temporal graphs. IEEE Trans Knowl Data Eng PP(99):1\u20131. \n                    https:\/\/doi.org\/10.1109\/TKDE.2018.2823754","journal-title":"IEEE Trans Knowl Data Eng"},{"key":"602_CR28","doi-asserted-by":"publisher","unstructured":"Semertzidis K, Pitoura E (2016) Durable graph pattern queries on historical graphs. In: 32nd IEEE international conference on data engineering, ICDE 2016, Helsinki, Finland, May 16\u201320, 2016, pp 541\u2013552. \n                    https:\/\/doi.org\/10.1109\/ICDE.2016.7498269","DOI":"10.1109\/ICDE.2016.7498269"},{"key":"602_CR29","doi-asserted-by":"publisher","unstructured":"Semertzidis K, Pitoura E (2017) Historical traversals in native graph databases. In: Advances in databases and information systems\u201421st European conference, ADBIS 2017, Nicosia, Cyprus, September 24\u201327, 2017, proceedings, pp 167\u2013181. \n                    https:\/\/doi.org\/10.1007\/978-3-319-66917-5_12","DOI":"10.1007\/978-3-319-66917-5_12"},{"key":"602_CR30","doi-asserted-by":"publisher","unstructured":"Semertzidis K, Pitoura E, Lillis K (2015) Timereach: historical reachability queries on evolving graphs. In: Proceedings of the 18th international conference on extending database technology, EDBT 2015, Brussels, Belgium, March 23\u201327, 2015, pp 121\u2013132. \n                    https:\/\/doi.org\/10.5441\/002\/edbt.2015.12","DOI":"10.5441\/002\/edbt.2015.12"},{"key":"602_CR31","unstructured":"Semertzidis K, Pitoura E, Terzi E, Tsaparas P (2016) Best friends forever (BFF): finding lasting dense subgraphs. In: CoRR. \n                    arXiv:1612.05440"},{"key":"602_CR32","doi-asserted-by":"publisher","unstructured":"Sozio M, Gionis A (2010) The community-search problem and how to plan a successful cocktail party. In: Proceedings of the 16th ACM SIGKDD international conference on knowledge discovery and data mining, Washington, DC, USA, July 25\u201328, 2010, pp 939\u2013948. \n                    https:\/\/doi.org\/10.1145\/1835804.1835923","DOI":"10.1145\/1835804.1835923"},{"key":"602_CR33","unstructured":"Tsantarliotis P, Pitoura E (2015) Topic detectionusing a critical term graph on news-related tweets. In: Proceedings of the workshops of the EDBT\/ICDT 2015 joint conference (EDBT\/ICDT), Brussels, Belgium, March 27th, 2015, pp 177\u2013182"},{"key":"602_CR34","doi-asserted-by":"publisher","unstructured":"Tsourakakis CE, Bonchi F, Gionis A, Gullo F, Tsiarli MA (2013) Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: The 19th ACM SIGKDD international conference on knowledge discovery and data mining, KDD 2013, Chicago, IL, USA, August 11\u201314, 2013, pp 104\u2013112. \n                    https:\/\/doi.org\/10.1145\/2487575.2487645","DOI":"10.1145\/2487575.2487645"}],"container-title":["Data Mining and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0602-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10618-018-0602-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10618-018-0602-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,11,27]],"date-time":"2019-11-27T19:21:31Z","timestamp":1574882491000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10618-018-0602-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11,28]]},"references-count":34,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2019,9]]}},"alternative-id":["602"],"URL":"https:\/\/doi.org\/10.1007\/s10618-018-0602-x","relation":{},"ISSN":["1384-5810","1573-756X"],"issn-type":[{"value":"1384-5810","type":"print"},{"value":"1573-756X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,11,28]]},"assertion":[{"value":"28 January 2018","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"10 October 2018","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"28 November 2018","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}