{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T01:13:20Z","timestamp":1755825200074,"version":"3.44.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100006374","name":"Danmarks Frie Forskningsfond","doi-asserted-by":"publisher","award":["9041-00382B"],"award-info":[{"award-number":["9041-00382B"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589335.3651507","type":"proceedings-article","created":{"date-parts":[[2024,5,12]],"date-time":"2024-05-12T18:41:21Z","timestamp":1715539281000},"page":"553-556","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Finding Dense and Persistently Expansive Subgraphs"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3524-6073","authenticated-orcid":false,"given":"Petros","family":"Petsinis","sequence":"first","affiliation":[{"name":"Aarhus University, Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5591-3585","authenticated-orcid":false,"given":"Charalampos E.","family":"Tsourakakis","sequence":"additional","affiliation":[{"name":"Boston University, Boston, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0509-9129","authenticated-orcid":false,"given":"Panagiotis","family":"Karras","sequence":"additional","affiliation":[{"name":"U. of Copenhagen & Aarhus U., Aarhus, Denmark"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-conmatphys-031218-013259"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(85)90092-9"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_2_4_1","volume-title":"Finding densest ??-connected subgraphs. Discrete Applied Mathematics, 305:34--47","author":"Bonchi Francesco","year":"2021","unstructured":"Francesco Bonchi, David Garc\u00eda-Soriano, Atsushi Miyauchi, and Charalampos E Tsourakakis. Finding densest ??-connected subgraphs. Discrete Applied Mathematics, 305:34--47, 2021."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-008-0223-z"},{"key":"e_1_3_2_2_6_1","first-page":"195","volume-title":"Problems in analysis","author":"Cheeger Jeff","year":"2015","unstructured":"Jeff Cheeger. A lower bound for the smallest eigenvalue of the laplacian. In Problems in analysis, pages 195--200. Princeton University Press, 2015."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977172.41"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/s41019-018-0078-0"},{"key":"e_1_3_2_2_9_1","volume-title":"Shortest paths in fifo time-dependent networks: Theory and algorithms. Rapport technique","author":"Dean Brian C","year":"2004","unstructured":"Brian C Dean. Shortest paths in fifo time-dependent networks: Theory and algorithms. Rapport technique, Massachusetts Institute of Technology, 13, 2004."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/2946645.3007036"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2006.377282"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physrep.2012.03.001"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0273-0979-06-01126-8"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2011\/11\/P11005"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2665063"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.106"},{"key":"e_1_3_2_2_18_1","volume-title":"Predicting and controlling infectious disease epidemics using temporal networks. F1000prime reports, 5","author":"Masuda Naoki","year":"2013","unstructured":"Naoki Masuda and Petter Holme. Predicting and controlling infectious disease epidemics using temporal networks. F1000prime reports, 5, 2013."},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.84.016105"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3018661.3018731"},{"key":"e_1_3_2_2_21_1","volume-title":"The Netzschleuder network catalogue and repository","author":"Peixoto Tiago P.","year":"2023","unstructured":"Tiago P. Peixoto. The Netzschleuder network catalogue and repository, 2023."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.26493\/1855-3974.810.5de"},{"key":"e_1_3_2_2_23_1","first-page":"4292","volume-title":"AAAI","author":"Ryan","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. The network data repository with interactive graph analytics and visualization. In AAAI, pages 4292--4293, 2015."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0602-x"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2007.56"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1137\/08074489X"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219991"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447713"},{"key":"e_1_3_2_2_29_1","first-page":"378","volume-title":"ECML PKDD","author":"Tsourakakis Charalampos E.","year":"2019","unstructured":"Charalampos E. Tsourakakis, Tianyi Chen, Naonori Kakimura, and Jakub Pachocki. Novel dense subgraph discovery primitives: Risk aversion and exclusion queries. In ECML PKDD, pages 378--394, 2019."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevX.5.021005"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1137\/1038003"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2015.7113344"},{"key":"e_1_3_2_2_33_1","volume-title":"When engagement meets similarity: efficient (k, r)-core computation on social networks. arXiv preprint arXiv:1611.03254","author":"Zhang Fan","year":"2016","unstructured":"Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, and Xuemin Lin. When engagement meets similarity: efficient (k, r)-core computation on social networks. arXiv preprint arXiv:1611.03254, 2016."}],"event":{"name":"WWW '24: The ACM Web Conference 2024","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"location":"Singapore Singapore","acronym":"WWW '24"},"container-title":["Companion Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3651507","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589335.3651507","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:35:24Z","timestamp":1755822924000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589335.3651507"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":33,"alternative-id":["10.1145\/3589335.3651507","10.1145\/3589335"],"URL":"https:\/\/doi.org\/10.1145\/3589335.3651507","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}