{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:36Z","timestamp":1775912916684,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T00:00:00Z","timestamp":1650844800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,4,25]]},"DOI":"10.1145\/3485447.3512205","type":"proceedings-article","created":{"date-parts":[[2022,4,25]],"date-time":"2022-04-25T05:11:23Z","timestamp":1650863483000},"page":"1589-1600","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":25,"title":["FirmCore Decomposition of Multilayer Networks"],"prefix":"10.1145","author":[{"given":"Farnoosh","family":"Hashemi","sequence":"first","affiliation":[{"name":"University of British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Behrouz","sequence":"additional","affiliation":[{"name":"University of British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Laks V.S.","family":"Lakshmanan","sequence":"additional","affiliation":[{"name":"University of British Columbia, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,4,25]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Finding large and small dense subgraphs. Arxiv (03","author":"Andersen Reid","year":"2007","unstructured":"Reid Andersen. 2007. Finding large and small dense subgraphs. Arxiv (03 2007)."},{"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.1007\/s11634-010-0079-y"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"crossref","unstructured":"F. Bonchi F. Gullo Andreas Kaltenbrunner and Yana Volkovich. 2014. Core decomposition of uncertain graphs. In KDD \u201914.","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"crossref","unstructured":"Francesco Bonchi Lorenzo Severini and Mauro Sozio. 2020. Better Fewer but Better: Community Search with Outliers. arxiv:2012.00356\u00a0[cs.DS]","DOI":"10.1109\/WIIAT50758.2020.00019"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12079-4_43"},{"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","doi-asserted-by":"publisher","DOI":"10.1109\/ICDMW.2019.00017"},{"key":"e_1_3_2_1_10_1","unstructured":"The dblp team. [n. d.]. dblp computer science bibliography. https:\/\/dblp.uni-trier.de\/xml\/."},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"M. De\u00a0Domenico A. Lima P. Mougel and M. Musolesi. 2013. The Anatomy of a Scientific Rumor. Scientific Reports 3 1 (2013).","DOI":"10.1038\/srep02980"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781139941907"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"M.\u00a0De Domenico V. Nicosia A. Arenas and V. Latora. 2015. Structural reducibility of multilayer networks.Nature communications 6(2015) 6864.","DOI":"10.1038\/ncomms7864"},{"key":"e_1_3_2_1_15_1","unstructured":"Xiaoxi Du Ruoming Jin Liang Ding Victor\u00a0E. Lee and John H.\u00a0Thornton Jr.2009. Migration motif: a spatial - temporal pattern mining approach for financial markets. In KDD. 1135\u20131144."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"crossref","unstructured":"David Eppstein Maarten L\u00f6ffler and Darren Strash. 2010. Listing All Maximal Cliques in Sparse Graphs in Near-optimal Time. arxiv:1006.5440\u00a0[cs.DS]","DOI":"10.1007\/978-3-642-17517-6_36"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3380750.3380756"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics"},{"key":"e_1_3_2_1_19_1","volume-title":"Core Decomposition and Densest Subgraph in Multilayer Networks. In Conference on Information and Knowledge Management (CIKM).","author":"Galimberti Edoardo","year":"2017","unstructured":"Edoardo Galimberti, Francesco Bonchi, and Francesco Gullo. 2017. Core Decomposition and Densest Subgraph in Multilayer Networks. In Conference on Information and Knowledge Management (CIKM)."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/3369872"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/3418226"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.46"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/276627.276652"},{"key":"e_1_3_2_1_24_1","unstructured":"David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB (Trondheim Norway). 721\u2013732."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2398776.2398792"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"crossref","unstructured":"V. Jethava and N. Beerenwinkel. 2015. Finding Dense Subgraphs in Relational Graphs. In Machine Learning and Knowledge Discovery in Databases Annalisa Appice Pedro\u00a0Pereira Rodrigues V\u00edtor Santos\u00a0Costa Jo\u00e3o Gama Al\u00edpio Jorge and Carlos Soares (Eds.). Springer International Publishing Cham 641\u2013654.","DOI":"10.1007\/978-3-319-23525-7_39"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1460797.1460799"},{"key":"e_1_3_2_1_29_1","volume-title":"Analyzing the structure of large graphs","author":"Kannan Ravi","unstructured":"Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs. University of Bonn (1999)."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1970-125-1"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/3308558.3313522"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-34223-4_44"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"crossref","unstructured":"Xueming Liu Enrico Maiorino Arda Halu Kimberly Glass Rashmi\u00a0B. Prasad and Joseph Loscalzo. 2020. Robustness and lethality in multilayer biological molecular networks. Nature Communications 11(2020).","DOI":"10.1038\/s41467-020-19841-3"},{"key":"e_1_3_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471485.3471494"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.3389\/fphy.2015.00059"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/srep05547"},{"key":"e_1_3_2_1_41_1","unstructured":"Kaiyan Peng Zheng Lu Vanessa Lin Michael\u00a0R. Lindstrom Christian Parkinson Chuntian Wang Andrea\u00a0L. Bertozzi and Mason\u00a0A. Porter. 2021. A Multilayer Network Model of the Coevolution of the Spread of a Disease and Competing Opinions. arxiv:2107.01713\u00a0[cs.SI]"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-018-0602-x"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-017-1077-6"},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_47_1","doi-asserted-by":"crossref","unstructured":"Nate Veldt Austin\u00a0R. Benson and Jon Kleinberg. 2021. The Generalized Mean Densest Subgraph Problem. arxiv:2106.00909\u00a0[cs.DS]","DOI":"10.1145\/3447548.3467398"},{"key":"e_1_3_2_1_48_1","doi-asserted-by":"publisher","DOI":"10.1109\/BigData.2015.7363809"},{"key":"e_1_3_2_1_49_1","unstructured":"F. Yanghe and W.J. Teng. 2013. Peeling the drug target proteins network by a core decomposition method. Research Journal of Biotechnology 8 (10 2013) 66\u201370."},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3407790.3407846"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2018.00069"}],"event":{"name":"WWW '22: The ACM Web Conference 2022","location":"Virtual Event, Lyon France","acronym":"WWW '22","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2022"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3485447.3512205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:31:15Z","timestamp":1750188675000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3485447.3512205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,4,25]]},"references-count":50,"alternative-id":["10.1145\/3485447.3512205","10.1145\/3485447"],"URL":"https:\/\/doi.org\/10.1145\/3485447.3512205","relation":{},"subject":[],"published":{"date-parts":[[2022,4,25]]},"assertion":[{"value":"2022-04-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}