{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,7]],"date-time":"2026-03-07T20:01:44Z","timestamp":1772913704511,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":48,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T00:00:00Z","timestamp":1691107200000},"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":[[2023,8,6]]},"DOI":"10.1145\/3580305.3599306","type":"proceedings-article","created":{"date-parts":[[2023,8,4]],"date-time":"2023-08-04T18:13:58Z","timestamp":1691172838000},"page":"1710-1721","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6033-6433","authenticated-orcid":false,"given":"Atsushi","family":"Miyauchi","sequence":"first","affiliation":[{"name":"CENTAI Institute, Turin, Italy"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4781-9761","authenticated-orcid":false,"given":"Tianyi","family":"Chen","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0006-7481-9061","authenticated-orcid":false,"given":"Konstantinos","family":"Sotiropoulos","sequence":"additional","affiliation":[{"name":"Boston University, Boston, MA, USA"}],"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, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2023,8,4]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"publisher","DOI":"10.1162\/artl_a_00045"},{"key":"e_1_3_2_2_2_1","volume-title":"NeurIPS '20","author":"Ahmadian Sara","year":"2020","unstructured":"Sara Ahmadian , Alessandro Epasto , Marina Knittel , Ravi Kumar , Mohammad Mahdian , Benjamin Moseley , Philip Pham , Sergei Vassilvitskii , and Yuyan Wang . 2020 a. Fair hierarchical clustering . In NeurIPS '20 . 21050--21060. Sara Ahmadian, Alessandro Epasto, Marina Knittel, Ravi Kumar, Mohammad Mahdian, Benjamin Moseley, Philip Pham, Sergei Vassilvitskii, and Yuyan Wang. 2020a. Fair hierarchical clustering. In NeurIPS '20. 21050--21060."},{"key":"e_1_3_2_2_3_1","volume-title":"AISTATS '20","author":"Ahmadian Sara","year":"2020","unstructured":"Sara Ahmadian , Alessandro Epasto , Ravi Kumar , and Mohammad Mahdian . 2020 b. Fair correlation clustering . In AISTATS '20 . 4195--4205. Sara Ahmadian, Alessandro Epasto, Ravi Kumar, and Mohammad Mahdian. 2020b. Fair correlation clustering. In AISTATS '20. 4195--4205."},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_2_6_1","volume-title":"ICML '19","author":"Backurs Arturs","year":"2019","unstructured":"Arturs Backurs , Piotr Indyk , Krzysztof Onak , Baruch Schieber , Ali Vakilian , and Tal Wagner . 2019 . Scalable fair clustering . In ICML '19 . 405--413. Arturs Backurs, Piotr Indyk, Krzysztof Onak, Baruch Schieber, Ali Vakilian, and Tal Wagner. 2019. Scalable fair clustering. In ICML '19. 405--413."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_3_2_2_10_1","volume-title":"NeurIPS '20","author":"Chanpuriya Sudhanshu","unstructured":"Sudhanshu Chanpuriya , Cameron Musco , Konstantinos Sotiropoulos , and Charalampos E. Tsourakakis . 2020. Node embeddings and exact low-rank representations of complex networks . In NeurIPS '20 . 13185--13198. Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, and Charalampos E. Tsourakakis. 2020. Node embeddings and exact low-rank representations of complex networks. In NeurIPS '20. 13185--13198."},{"key":"e_1_3_2_2_11_1","volume-title":"NeurIPS '21","author":"Chanpuriya Sudhanshu","unstructured":"Sudhanshu Chanpuriya , Cameron Musco , Konstantinos Sotiropoulos , and Charalampos E. Tsourakakis . 2021. On the power of edge independent graph models . In NeurIPS '21 . 24418--24429. Sudhanshu Chanpuriya, Cameron Musco, Konstantinos Sotiropoulos, and Charalampos E. Tsourakakis. 2021. On the power of edge independent graph models. In NeurIPS '21. 24418--24429."},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_13_1","volume-title":"SODA '22","author":"Chekuri Chandra","unstructured":"Chandra Chekuri , Kent Quanrud , and Manuel R. Torres . 2022. Densest subgraph: Supermodularity, iterative peeling, and flow . In SODA '22 . 1531--1555. Chandra Chekuri, Kent Quanrud, and Manuel R. Torres. 2022. Densest subgraph: Supermodularity, iterative peeling, and flow. In SODA '22. 1531--1555."},{"key":"e_1_3_2_2_14_1","volume-title":"ECML PKDD '22","author":"Chen Tianyi","unstructured":"Tianyi Chen , Brian Matejek , Michael Mitzenmacher , and Charalampos E. Tsourakakis . 2022. Algorithmic tools for understanding the motif structure of networks . In ECML PKDD '22 . 3--19. Tianyi Chen, Brian Matejek, Michael Mitzenmacher, and Charalampos E. Tsourakakis. 2022. Algorithmic tools for understanding the motif structure of networks. In ECML PKDD '22. 3--19."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3534678.3539100"},{"key":"e_1_3_2_2_16_1","volume-title":"NIPS '17","author":"Chierichetti Flavio","year":"2017","unstructured":"Flavio Chierichetti , Ravi Kumar , Silvio Lattanzi , and Sergei Vassilvitskii . 2017 . Fair clustering through fairlets . In NIPS '17 . 5029--5037. Flavio Chierichetti, Ravi Kumar, Silvio Lattanzi, and Sergei Vassilvitskii. 2017. Fair clustering through fairlets. In NIPS '17. 5029--5037."},{"key":"e_1_3_2_2_17_1","volume-title":"NIPS '16","author":"De Abir","year":"2016","unstructured":"Abir De , Isabel Valera , Niloy Ganguly , Sourangshu Bhattacharya , and Manuel Gomez-Rodriguez . 2016 . Learning and forecasting opinion dynamics in social networks . In NIPS '16 . 397--405. Abir De, Isabel Valera, Niloy Ganguly, Sourangshu Bhattacharya, and Manuel Gomez-Rodriguez. 2016. Learning and forecasting opinion dynamics in social networks. In NIPS '16. 397--405."},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972825.15"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_2_21_1","volume-title":"VLDB '05","author":"Gibson David","year":"2005","unstructured":"David Gibson , Ravi Kumar , and Andrew Tomkins . 2005 . Discovering large dense subgraphs in massive graphs . In VLDB '05 . 721--732. David Gibson, Ravi Kumar, and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In VLDB '05. 721--732."},{"key":"e_1_3_2_2_22_1","volume-title":"KDD '15","author":"Gionis Aristides","unstructured":"Aristides Gionis and Charalampos E. Tsourakakis . 2015. Dense subgraph discovery: KDD 2015 Tutorial . In KDD '15 . 2313--2314. Aristides Gionis and Charalampos E. Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 Tutorial. In KDD '15. 2313--2314."},{"key":"e_1_3_2_2_23_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V.","unstructured":"Andrew V. Goldberg . 1984. Finding a maximum density subgraph . University of California Berkeley . Andrew V. Goldberg. 1984. Finding a maximum density subgraph. University of California Berkeley."},{"key":"e_1_3_2_2_24_1","unstructured":"Julie Graber. 2020. Companies Hit With Lawsuits for Lack of Diversity at the Top. https:\/\/www.linkedin.com\/pulse\/companies-hit-lawsuits-lack-diversity-top-julie-graber\/.  Julie Graber. 2020. Companies Hit With Lawsuits for Lack of Diversity at the Top. https:\/\/www.linkedin.com\/pulse\/companies-hit-lawsuits-lack-diversity-top-julie-graber\/."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/s12532-017-0130-5"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/177"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288671"},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539703435753"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_3_2_2_31_1","volume-title":"ICML '20","author":"Kuroki Yuko","year":"2020","unstructured":"Yuko Kuroki , Atsushi Miyauchi , Junya Honda , and Masashi Sugiyama . 2020 . Online dense subgraph discovery via blurred-graph feedback . In ICML '20 . 5522--5532. Yuko Kuroki, Atsushi Miyauchi, Junya Honda, and Masashi Sugiyama. 2020. Online dense subgraph discovery via blurred-graph feedback. In ICML '20. 5522--5532."},{"key":"e_1_3_2_2_32_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 ). 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_33_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5906"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1038\/s41598-022-15027-7"},{"key":"e_1_3_2_2_35_1","volume-title":"TheWebConf '19","author":"Musco Cameron","unstructured":"Cameron Musco , Christopher Musco , and Charalampos E. Tsourakakis . 2018. Minimizing polarization and disagreement in social networks . In TheWebConf '19 . 369--378. Cameron Musco, Christopher Musco, and Charalampos E. Tsourakakis. 2018. Minimizing polarization and disagreement in social networks. In TheWebConf '19. 369--378."},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19-1018"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623732"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1002\/net.3230120206"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3159652.3159706"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488482"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnab014"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3340531.3411866"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-86514-6_11"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.physa.2011.12.021"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467398"}],"event":{"name":"KDD '23: The 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Long Beach CA USA","acronym":"KDD '23","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"]},"container-title":["Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599306","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3580305.3599306","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:47Z","timestamp":1750178267000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3580305.3599306"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,8,4]]},"references-count":48,"alternative-id":["10.1145\/3580305.3599306","10.1145\/3580305"],"URL":"https:\/\/doi.org\/10.1145\/3580305.3599306","relation":{},"subject":[],"published":{"date-parts":[[2023,8,4]]},"assertion":[{"value":"2023-08-04","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}