{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:08:35Z","timestamp":1775912915279,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,8,14]],"date-time":"2021-08-14T00:00:00Z","timestamp":1628899200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000005","name":"DOD U.S. Department of Defense","doi-asserted-by":"publisher","award":["Vannevar Bush Faculty Fellowship"],"award-info":[{"award-number":["Vannevar Bush Faculty Fellowship"]}],"id":[{"id":"10.13039\/100000005","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["DMS-1830274,"],"award-info":[{"award-number":["DMS-1830274,"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100004332","name":"JPMorgan Chase and Company","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100004332","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF19-1-0057"],"award-info":[{"award-number":["W911NF19-1-0057"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000893","name":"Simons Foundation","doi-asserted-by":"publisher","award":["Simons Investigator Award"],"award-info":[{"award-number":["Simons Investigator Award"]}],"id":[{"id":"10.13039\/100000893","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,8,14]]},"DOI":"10.1145\/3447548.3467398","type":"proceedings-article","created":{"date-parts":[[2021,8,12]],"date-time":"2021-08-12T06:13:10Z","timestamp":1628748790000},"page":"1604-1614","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":16,"title":["The Generalized Mean Densest Subgraph Problem"],"prefix":"10.1145","author":[{"given":"Nate","family":"Veldt","sequence":"first","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Austin R.","family":"Benson","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Kleinberg","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2021,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","doi-asserted-by":"crossref","unstructured":"Aris Anagnostopoulos Luca Becchetti Adriano Fazzone Cristina Menghini and Chris Schwiegelshohn. 2020. Spectral Relaxations and Fair Densest Subgraphs. In CIKM.  Aris Anagnostopoulos Luca Becchetti Adriano Fazzone Cristina Menghini and Chris Schwiegelshohn. 2020. Spectral Relaxations and Fair Densest Subgraphs. In CIKM.","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"crossref","unstructured":"Reid Andersen and Kumar Chellapilla. 2009. Finding dense subgraphs with size bounds. In WAW.  Reid Andersen and Kumar Chellapilla. 2009. Finding dense subgraphs with size bounds. In WAW.","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_2_3_1","volume-title":"Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification. VLDB","author":"Angel Albert","year":"2012","unstructured":"Albert Angel , Nick Koudas , Nikos Sarkas , and Divesh Srivastava . 2012. Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification. VLDB ( 2012 ). Albert Angel, Nick Koudas, Nikos Sarkas, and Divesh Srivastava. 2012. Dense Subgraph Maintenance under Streaming Edge Weight Updates for Real-time Story Identification. VLDB (2012)."},{"key":"e_1_3_2_2_4_1","volume-title":"Greedily Finding a Dense Subgraph. J Algorithm","author":"Asahiro Yuichi","year":"2000","unstructured":"Yuichi Asahiro , Kazuo Iwama , Hisao Tamaki , and Takeshi Tokuyama . 2000. Greedily Finding a Dense Subgraph. J Algorithm ( 2000 ). Yuichi Asahiro, Kazuo Iwama, Hisao Tamaki, and Takeshi Tokuyama. 2000. Greedily Finding a Dense Subgraph. J Algorithm (2000)."},{"key":"e_1_3_2_2_5_1","volume-title":"A model of Internet topology using k-shell decomposition. PNAS U.S.A","author":"Carmi Shai","year":"2007","unstructured":"Shai Carmi , Shlomo Havlin , Scott Kirkpatrick , Yuval Shavitt , and Eran Shir . 2007. A model of Internet topology using k-shell decomposition. PNAS U.S.A ( 2007 ). Shai Carmi, Shlomo Havlin, Scott Kirkpatrick, Yuval Shavitt, and Eran Shir. 2007. A model of Internet topology using k-shell decomposition. PNAS U.S.A (2007)."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In APPROX.  Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In APPROX.","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_2_7_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. Technical Report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen . 2008 . Trusses: Cohesive subgraphs for social network analysis. Technical Report . National Security Agency . Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. Technical Report. National Security Agency."},{"key":"e_1_3_2_2_8_1","volume-title":"Davis and Yifan Hu","author":"Timothy","year":"2011","unstructured":"Timothy A. Davis and Yifan Hu . 2011 . The University of Florida Sparse Matrix Collection . ACM Trans. Math. Softw. (2011). Timothy A. Davis and Yifan Hu. 2011. The University of Florida Sparse Matrix Collection. ACM Trans. Math. Softw. (2011)."},{"key":"e_1_3_2_2_9_1","volume-title":"K-core organization of complex networks. Phys. Rev. Lett","author":"Dorogovtsev Sergey N","year":"2006","unstructured":"Sergey N Dorogovtsev , Alexander V Goltsev , and Jose Ferreira F Mendes . 2006. K-core organization of complex networks. Phys. Rev. Lett ( 2006 ). Sergey N Dorogovtsev, Alexander V Goltsev, and Jose Ferreira F Mendes. 2006. K-core organization of complex networks. Phys. Rev. Lett (2006)."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11786-007-0026-2"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Aristides Gionis and Charalampos E Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 tutorial. In KDD.  Aristides Gionis and Charalampos E Tsourakakis. 2015. Dense subgraph discovery: KDD 2015 tutorial. In KDD.","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/bti1049"},{"key":"e_1_3_2_2_17_1","volume-title":"Complexity of computer computations","author":"Karp Richard M","unstructured":"Richard M Karp . 1972. Reducibility among combinatorial problems . In Complexity of computer computations . Springer , 85--103. Richard M Karp. 1972. Reducibility among combinatorial problems. In Complexity of computer computations. Springer, 85--103."},{"key":"e_1_3_2_2_18_1","volume-title":"The Densest Subgraph Problem with a Convex\/Concave Size Function. Algorithmica","author":"Kawase Yasushi","year":"2018","unstructured":"Yasushi Kawase and Atsushi Miyauchi . 2018. The Densest Subgraph Problem with a Convex\/Concave Size Function. Algorithmica ( 2018 ). Yasushi Kawase and Atsushi Miyauchi. 2018. The Densest Subgraph Problem with a Convex\/Concave Size Function. Algorithmica (2018)."},{"key":"e_1_3_2_2_19_1","volume-title":"International Colloquium on Automata, Languages, and Programming","author":"Khuller Samir","unstructured":"Samir Khuller and Barna Saha . 2009. On finding dense subgraphs . In International Colloquium on Automata, Languages, and Programming . Springer , 597--608. Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International Colloquium on Automata, Languages, and Programming. Springer, 597--608."},{"key":"e_1_3_2_2_20_1","volume-title":"SFO: A Toolbox for Submodular Function Optimization. J. Mach. Learn. Res","author":"Krause Andreas","year":"2010","unstructured":"Andreas Krause . 2010 . SFO: A Toolbox for Submodular Function Optimization. J. Mach. Learn. Res (2010). Andreas Krause. 2010. SFO: A Toolbox for Submodular Function Optimization. J. Mach. Learn. Res (2010)."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"crossref","unstructured":"Tommaso Lanciano Francesco Bonchi and Aristides Gionis. 2020. Explainable Classification of Brain Networks via Contrast Subgraphs. In KDD.  Tommaso Lanciano Francesco Bonchi and Aristides Gionis. 2020. Explainable Classification of Brain Networks via Contrast Subgraphs. In KDD.","DOI":"10.1145\/3394486.3403383"},{"key":"e_1_3_2_2_22_1","volume-title":"Managing and Mining Graph Data","author":"Lee Victor E","unstructured":"Victor E Lee , Ning Ruan , Ruoming Jin , and Charu Aggarwal . 2010. A survey of algorithms for dense subgraph discovery . In Managing and Mining Graph Data . Springer , 303--336. Victor E Lee, Ning Ruan, Ruoming Jin, and Charu Aggarwal. 2010. A survey of algorithms for dense subgraph discovery. In Managing and Mining Graph Data. Springer, 303--336."},{"key":"e_1_3_2_2_23_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_24_1","volume-title":"The core decomposition of networks: Theory, algorithms and applications. VLDB","author":"Malliaros Fragkiskos D","year":"2020","unstructured":"Fragkiskos D Malliaros , Christos Giatsidis , Apostolos N Papadopoulos , and Michalis Vazirgiannis . 2020. The core decomposition of networks: Theory, algorithms and applications. VLDB ( 2020 ). Fragkiskos D Malliaros, Christos Giatsidis, Apostolos N Papadopoulos, and Michalis Vazirgiannis. 2020. The core decomposition of networks: Theory, algorithms and applications. VLDB (2020)."},{"key":"e_1_3_2_2_25_1","volume-title":"Beck","author":"Matula David W.","year":"1983","unstructured":"David W. Matula and Leland L . Beck . 1983 . Smallest-Last Ordering and Clustering and Graph Coloring Algorithms. J. ACM ( 1983). David W. Matula and Leland L. Beck. 1983. Smallest-Last Ordering and Clustering and Graph Coloring Algorithms. J. ACM (1983)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Robert J Mokken etal 1979. Cliques clubs and clans. Qual. Quant (1979).  Robert J Mokken et al. 1979. Cliques clubs and clans. Qual. Quant (1979).","DOI":"10.1007\/BF00139635"},{"key":"e_1_3_2_2_27_1","volume-title":"A faster strongly polynomial time algorithm for submodular function minimization. Math. Program","author":"Orlin James B.","year":"2009","unstructured":"James B. Orlin . 2009. A faster strongly polynomial time algorithm for submodular function minimization. Math. Program ( 2009 ). James B. Orlin. 2009. A faster strongly polynomial time algorithm for submodular function minimization. Math. Program (2009)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"crossref","unstructured":"Jeffrey Pattillo Alexander Veremyev Sergiy Butenko and Vladimir Boginski. 2013. On the maximum quasi-clique problem. Discret. Appl. Math. (2013).  Jeffrey Pattillo Alexander Veremyev Sergiy Butenko and Vladimir Boginski. 2013. On the maximum quasi-clique problem. Discret. Appl. Math. (2013).","DOI":"10.1016\/j.dam.2012.07.019"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"crossref","unstructured":"Lu Qin Rong-Hua Li Lijun Chang and Chengqi Zhang. 2015. Locally Densest Subgraph Discovery. In KDD.  Lu Qin Rong-Hua Li Lijun Chang and Chengqi Zhang. 2015. Locally Densest Subgraph Discovery. In KDD.","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sary\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.  Ahmet Erdem Sary\u00fcce and Ali Pinar. 2018. Peeling Bipartite Networks for Dense Subgraph Discovery. In WSDM.","DOI":"10.1145\/3159652.3159678"},{"key":"e_1_3_2_2_31_1","volume-title":"Local Algorithms for Hierarchical Dense Subgraph Discovery. VLDB","author":"Sariy\u00fcce Ahmet Erdem","year":"2018","unstructured":"Ahmet Erdem Sariy\u00fcce , C. Seshadhri , and Ali Pinar . 2018. Local Algorithms for Hierarchical Dense Subgraph Discovery. VLDB ( 2018 ). Ahmet Erdem Sariy\u00fcce, C. Seshadhri, and Ali Pinar. 2018. Local Algorithms for Hierarchical Dense Subgraph Discovery. VLDB (2018)."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Ahmet Erdem Sariyuce C Seshadhri Ali Pinar and Umit V Catalyurek. 2015. Finding the hierarchy of dense subgraphs using nucleus decompositions. In WWW.  Ahmet Erdem Sariyuce C Seshadhri Ali Pinar and Umit V Catalyurek. 2015. Finding the hierarchy of dense subgraphs using nucleus decompositions. In WWW.","DOI":"10.1145\/2736277.2741640"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1080\/0022250X.1978.9989883"},{"key":"e_1_3_2_2_35_1","volume-title":"Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms. In ICDM.","author":"Shin Kijung","year":"2016","unstructured":"Kijung Shin , Tina Eliassi-Rad , and Christos Faloutsos . 2016 . Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms. In ICDM. Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2016. Corescope: Graph mining using k-core analysis-patterns, anomalies and algorithms. In ICDM."},{"key":"e_1_3_2_2_36_1","volume-title":"Patterns and anomalies in k-cores of real-world graphs with applications. KAIS","author":"Shin Kijung","year":"2018","unstructured":"Kijung Shin , Tina Eliassi-Rad , and Christos Faloutsos . 2018. Patterns and anomalies in k-cores of real-world graphs with applications. KAIS ( 2018 ). Kijung Shin, Tina Eliassi-Rad, and Christos Faloutsos. 2018. Patterns and anomalies in k-cores of real-world graphs with applications. KAIS (2018)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In KDD.  Mauro Sozio and Aristides Gionis. 2010. The community-search problem and how to plan a successful cocktail party. In KDD.","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_2_38_1","volume-title":"Porter","author":"Traud Amanda L.","year":"2012","unstructured":"Amanda L. Traud , Peter J. Mucha , and Mason A . Porter . 2012 . Social structure of Facebook networks. Physica A ( 2012). Amanda L. Traud, Peter J. Mucha, and Mason A. Porter. 2012. Social structure of Facebook networks. Physica A (2012)."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW.  Charalampos Tsourakakis. 2015. The k-clique densest subgraph problem. In WWW.","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"crossref","unstructured":"Charalampos Tsourakakis Francesco Bonchi Aristides Gionis Francesco Gullo and Maria Tsiarli. 2013. Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees. In KDD.  Charalampos Tsourakakis Francesco Bonchi Aristides Gionis Francesco Gullo and Maria Tsiarli. 2013. Denser than the Densest Subgraph: Extracting Optimal Quasi-Cliques with Quality Guarantees. In KDD.","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Charalampos E Tsourakakis Tianyi Chen Naonori Kakimura and Jakub Pachocki. 2019. Novel dense subgraph discovery primitives: Risk aversion and exclusion queries. In ECML PKDD.  Charalampos E Tsourakakis Tianyi Chen Naonori Kakimura and Jakub Pachocki. 2019. Novel dense subgraph discovery primitives: Risk aversion and exclusion queries. In ECML PKDD.","DOI":"10.1007\/978-3-030-46150-8_23"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.1116502109"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"crossref","unstructured":"Nate Veldt David F. Gleich and Anthony Wirth. 2018. A Correlation Clustering Framework for Community Detection. In WWW.  Nate Veldt David F. Gleich and Anthony Wirth. 2018. A Correlation Clustering Framework for Community Detection. In WWW.","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_3_2_2_44_1","volume-title":"On triangulation-based dense neighborhood graph discovery. VLDB","author":"Wang Nan","year":"2010","unstructured":"Nan Wang , Jingbo Zhang , Kian-Lee Tan , and Anthony KH Tung . 2010. On triangulation-based dense neighborhood graph discovery. VLDB ( 2010 ). Nan Wang, Jingbo Zhang, Kian-Lee Tan, and Anthony KH Tung. 2010. On triangulation-based dense neighborhood graph discovery. VLDB (2010)."},{"key":"e_1_3_2_2_45_1","volume-title":"Discounted average degree density metric and new algorithms for the densest subgraph problem. Networks","author":"Yanagisawa Hiroki","year":"2018","unstructured":"Hiroki Yanagisawa and Satoshi Hara . 2018. Discounted average degree density metric and new algorithms for the densest subgraph problem. Networks ( 2018 ). Hiroki Yanagisawa and Satoshi Hara. 2018. Discounted average degree density metric and new algorithms for the densest subgraph problem. Networks (2018)."},{"key":"e_1_3_2_2_46_1","volume-title":"Scott Alcorn, Jingrui He, Hasan Davulcu, and Hanghang Tong.","author":"Zhang Si","year":"2017","unstructured":"Si Zhang , Dawei Zhou , Mehmet Yigit Yildirim , Scott Alcorn, Jingrui He, Hasan Davulcu, and Hanghang Tong. 2017 . Hidden: hierarchical dense subgraph detection with application to financial fraud detection. In SDM Si Zhang, Dawei Zhou, Mehmet Yigit Yildirim, Scott Alcorn, Jingrui He, Hasan Davulcu, and Hanghang Tong. 2017. Hidden: hierarchical dense subgraph detection with application to financial fraud detection. In SDM"}],"event":{"name":"KDD '21: The 27th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Virtual Event Singapore","acronym":"KDD '21","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 27th ACM SIGKDD Conference on Knowledge Discovery & Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3447548.3467398","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467398","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3447548.3467398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:18:36Z","timestamp":1750191516000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3447548.3467398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,8,14]]},"references-count":45,"alternative-id":["10.1145\/3447548.3467398","10.1145\/3447548"],"URL":"https:\/\/doi.org\/10.1145\/3447548.3467398","relation":{},"subject":[],"published":{"date-parts":[[2021,8,14]]},"assertion":[{"value":"2021-08-14","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}