{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,1]],"date-time":"2026-08-01T00:10:35Z","timestamp":1785543035265,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":45,"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:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"funder":[{"name":"ERC Advanced Grant REBOUND","award":["834862"],"award-info":[{"award-number":["834862"]}]},{"name":"EC H2020 RIA project SoBigData++","award":["871042"],"award-info":[{"award-number":["871042"]}]},{"name":"Wallenberg AI, Autonomous Systems and Software Program"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645647","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"936-947","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Finding Densest Subgraphs with Edge-Color Constraints"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2526-8762","authenticated-orcid":false,"given":"Lutz","family":"Oettershagen","sequence":"first","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-6463-392X","authenticated-orcid":false,"given":"Honglian","family":"Wang","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5211-112X","authenticated-orcid":false,"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"KTH Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0340-z"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_2_5_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An O(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_3_2_2_8_1","volume-title":"Emergence of network features from multiplexity. Scientific reports","author":"Cardillo Alessio","year":"2013","unstructured":"Alessio Cardillo, Jes\u00fas G\u00f3mez-Gardenes, Massimiliano Zanin, Miguel Romance, David Papo, Francisco del Pozo, and Stefano Boccaletti. 2013. Emergence of network features from multiplexity. Scientific reports, Vol. 3, 1 (2013), 1344."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.64"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_2_13_1","volume-title":"Structural reducibility of multilayer networks. Nature communications","author":"Domenico Manlio De","year":"2015","unstructured":"Manlio De Domenico, Vincenzo Nicosia, Alexandre Arenas, and Vito Latora. 2015. Structural reducibility of multilayer networks. Nature communications, Vol. 6, 1 (2015), 6864."},{"key":"e_1_3_2_2_14_1","volume-title":"Multilayer Social Networks","author":"Dickison Mark E.","unstructured":"Mark E. Dickison, Matteo Magnani, and Luca Rossi. 2016. Multilayer Social Networks. Cambridge University Press."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_2_16_1","unstructured":"Uriel Feige and Michael Seltser. 1997. On the densest k-subgraph problem."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.15"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132993"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/1083592.1083676"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_2_21_1","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph. (1984)."},{"key":"e_1_3_2_2_22_1","volume-title":"The strength of weak ties. American journal of sociology","author":"Granovetter Mark S","year":"1973","unstructured":"Mark S Granovetter. 1973. The strength of weak ties. American journal of sociology , Vol. 78, 6 (1973), 1360--1380."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/3485447.3512205"},{"key":"e_1_3_2_2_24_1","volume-title":"Online social networks: A survey of a global phenomenon. Computer networks","author":"Heidemann Julia","year":"2012","unstructured":"Julia Heidemann, Mathias Klier, and Florian Probst. 2012. Online social networks: A survey of a global phenomenon. Computer networks, Vol. 56, 18 (2012), 3866--3878."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-020-00716-6"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jtbi.2010.11.033"},{"key":"e_1_3_2_2_27_1","volume-title":"Analyzing the structure of large graphs. Universit\"at Bonn","author":"Kannan Ravindran","unstructured":"Ravindran Kannan and V Vinay. 1999. Analyzing the structure of large graphs. Universit\"at Bonn. Institut f\u00fcr \u00d6konometrie und Operations Research."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International colloquium on automata languages and programming (ICALP). 597--608.","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnu016"},{"key":"e_1_3_2_2_30_1","first-page":"22","article-title":"Algorithmic fairness. In Aea papers and proceedings, Vol. 108. American Economic Association 2014 Broadway","volume":"37203","author":"Kleinberg Jon","year":"2018","unstructured":"Jon Kleinberg, Jens Ludwig, Sendhil Mullainathan, and Ashesh Rambachan. 2018. Algorithmic fairness. In Aea papers and proceedings, Vol. 108. American Economic Association 2014 Broadway, Suite 305, Nashville, TN 37203, 22--27.","journal-title":"Suite 305, Nashville, TN"},{"key":"e_1_3_2_2_31_1","volume-title":"A survey on the densest subgraph problem and its variants. arXiv preprint arXiv:2303.14467","author":"Lanciano Tommaso","year":"2023","unstructured":"Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, and Francesco Bonchi. 2023. A survey on the densest subgraph problem and its variants. arXiv preprint arXiv:2303.14467 (2023)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/1753326.1753532"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.5555\/646491.694954"},{"key":"e_1_3_2_2_35_1","volume-title":"Combinatorial analysis of multiple networks. arXiv preprint arXiv:1303.4986","author":"Magnani Matteo","year":"2013","unstructured":"Matteo Magnani, Barbora Micenkova, and Luca Rossi. 2013. Combinatorial analysis of multiple networks. arXiv preprint arXiv:1303.4986 (2013)."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev-statistics-042720-125902"},{"key":"e_1_3_2_2_37_1","volume-title":"Tsourakakis","author":"Miyauchi Atsushi","year":"2023","unstructured":"Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos, and Charalampos E. Tsourakakis. 2023. Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity. 1710--1721."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488482"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Barna Saha Allison Hoch Samir Khuller Louiqa Raschid and Xiao-Ning Zhang. 2010. Dense subgraphs with restrictions and applications to gene annotation graphs. In Research in Computational Molecular Biology (RECOMB). 456--472.","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_2_40_1","volume-title":"Anatomy of an online misinformation network. Plos one","author":"Shao Chengcheng","year":"2018","unstructured":"Chengcheng Shao, Pik-Mai Hui, Lei Wang, Xinwen Jiang, Alessandro Flammini, Filippo Menczer, and Giovanni Luca Ciampaglia. 2018. Anatomy of an online misinformation network. Plos one, Vol. 13, 4 (2018)."},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623664"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D15-1174"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0073970"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3219819.3219854"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645647","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645647","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:24:38Z","timestamp":1755822278000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645647"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":45,"alternative-id":["10.1145\/3589334.3645647","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645647","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"}}]}}