{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:10:08Z","timestamp":1750205408987,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T00:00:00Z","timestamp":1557705600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,5,13]]},"DOI":"10.1145\/3308560.3314190","type":"proceedings-article","created":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T12:17:59Z","timestamp":1557749879000},"page":"22-26","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Cores and Other Dense Structures in Complex Networks"],"prefix":"10.1145","author":[{"given":"Edoardo","family":"Galimberti","sequence":"first","affiliation":[{"name":"University of Turin &amp; ISI Foundation, Italy"}]}],"member":"320","published-online":{"date-parts":[[2019,5,13]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"J\u00a0Ignacio Alvarez-Hamelin Luca Dall\u2019Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems. 41\u201350.   J\u00a0Ignacio Alvarez-Hamelin Luca Dall\u2019Asta Alain Barrat and Alessandro Vespignani. 2006. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in neural information processing systems. 41\u201350."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.90.032816"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46648-7_9"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11634-010-0079-y"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.101"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_9_1","unstructured":"Moses Charikar Yonatan Naamad and Jimmy Wu. 2018. On Finding Dense Common Subgraphs. arXiv preprint arXiv:1802.06361(2018).  Moses Charikar Yonatan Naamad and Jimmy Wu. 2018. On Finding Dense Common Subgraphs. arXiv preprint arXiv:1802.06361(2018)."},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-87744-8_26"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271767"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_3_2_1_13_1","unstructured":"Edoardo Galimberti Francesco Bonchi Francesco Gullo and Tommaso Lanciano. 2018. Core Decomposition in Multilayer Networks: Theory Algorithms and Applications. CoRR abs\/1812.08712(2018). arxiv:1812.08712http:\/\/arxiv.org\/abs\/1812.08712  Edoardo Galimberti Francesco Bonchi Francesco Gullo and Tommaso Lanciano. 2018. Core Decomposition in Multilayer Networks: Theory Algorithms and Applications. CoRR abs\/1812.08712(2018). arxiv:1812.08712http:\/\/arxiv.org\/abs\/1812.08712"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/0165-4896(80)90010-4"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1080\/0308108031000053611"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10114-004-0437-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-017-0525-y"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"crossref","unstructured":"Vinay Jethava and Niko Beerenwinkel. 2015. Finding dense subgraphs in relational graphs. In ECML-PKDD. 641\u2013654.  Vinay Jethava and Niko Beerenwinkel. 2015. Finding dense subgraphs in relational graphs. In ECML-PKDD. 641\u2013654.","DOI":"10.1007\/978-3-319-23525-7_39"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460797.1460799"},{"key":"e_1_3_2_1_21_1","volume-title":"Identification of influential spreaders in complex networks. Nature physics 6, 11","author":"Kitsak Maksim","year":"2010","unstructured":"Maksim Kitsak , Lazaros\u00a0 K Gallos , Shlomo Havlin , Fredrik Liljeros , Lev Muchnik , H\u00a0Eugene Stanley , and Hern\u00e1n\u00a0 A Makse . 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 ( 2010 ), 888. Maksim Kitsak, Lazaros\u00a0K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H\u00a0Eugene Stanley, and Hern\u00e1n\u00a0A Makse. 2010. Identification of influential spreaders in complex networks. Nature physics 6, 11 (2010), 888."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91947-8_2"},{"key":"e_1_3_2_1_23_1","unstructured":"Victor\u00a0E. Lee Ning Ruan Ruoming Jin and Charu\u00a0C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data.  Victor\u00a0E. Lee Ning Ruan Ruoming Jin and Charu\u00a0C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_26_1","unstructured":"Konstantinos Semertzidis Evaggelia Pitoura Evimaria Terzi and Panayiotis Tsaparas. 2016. Best Friends Forever (BFF): Finding Lasting Dense Subgraphs. arXiv preprint arXiv:1612.05440(2016).  Konstantinos Semertzidis Evaggelia Pitoura Evimaria Terzi and Panayiotis Tsaparas. 2016. Best Friends Forever (BFF): Finding Lasting Dense Subgraphs. arXiv preprint arXiv:1612.05440(2016)."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2956185"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2015.09.030"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363809"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3115404.3115406"}],"event":{"name":"WWW '19: The Web Conference","sponsor":["IW3C2 International World Wide Web Conference Committee"],"location":"San Francisco USA","acronym":"WWW '19"},"container-title":["Companion Proceedings of The 2019 World Wide Web Conference"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308560.3314190","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3308560.3314190","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:23Z","timestamp":1750204403000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3308560.3314190"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,5,13]]},"references-count":30,"alternative-id":["10.1145\/3308560.3314190","10.1145\/3308560"],"URL":"https:\/\/doi.org\/10.1145\/3308560.3314190","relation":{},"subject":[],"published":{"date-parts":[[2019,5,13]]},"assertion":[{"value":"2019-05-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}