{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,1]],"date-time":"2026-06-01T20:14:59Z","timestamp":1780344899121,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":58,"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":[{"DOI":"10.13039\/501100006374","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["CCF-1909528,IIS-2007481"],"award-info":[{"award-number":["CCF-1909528,IIS-2007481"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100006374","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-SC0023162"],"award-info":[{"award-number":["DE-SC0023162"]}],"id":[{"id":"10.13039\/501100006374","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645624","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"881-892","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0006-3446-9220","authenticated-orcid":false,"given":"Yufan","family":"Huang","sequence":"first","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8107-6474","authenticated-orcid":false,"given":"David F.","family":"Gleich","sequence":"additional","affiliation":[{"name":"Purdue University, West Lafayette, IN, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0117-3304","authenticated-orcid":false,"given":"Nate","family":"Veldt","sequence":"additional","affiliation":[{"name":"Texas A&M University, College Station, TX, USA"}],"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.1007\/s10618-009-0140--7"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380152"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1135777.1135814"},{"key":"e_1_3_2_2_5_1","volume-title":"Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '08","volume":"660","author":"Andersen Reid","year":"2008","unstructured":"Reid Andersen and Kevin J Lang. 2008. An algorithm for improving graph partitions.. In Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA '08, Vol. 8). 651--660."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0340-z"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","unstructured":"Austin R. Benson Rediet Abebe Michael T. Schaub Ali Jadbabaie and Jon Kleinberg. 2018. Simplicial Closure and Higher-Order Link Prediction. https:\/\/arxiv.org\/abs\/1802.06916v2. https:\/\/doi.org\/10.1073\/pnas.1800683115","DOI":"10.1073\/pnas.1800683115"},{"key":"e_1_3_2_2_8_1","volume-title":"The maximum clique problem. Handbook of Combinatorial Optimization: Supplement","author":"Bomze Immanuel M","unstructured":"Immanuel M Bomze, Marco Budinich, Panos M Pardalos, and Marcello Pelillo. 1999. The maximum clique problem. Handbook of Combinatorial Optimization: Supplement Volume A (1999), 1--74."},{"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","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--44436-X_10"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.64"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/3--540--59408--6_49"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/comnet\/cnaa018"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1126\/sciadv.abh1303"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517890"},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1287\/mnsc.13.7.492"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.14778\/3565838.3565843"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347121"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1333055"},{"key":"e_1_3_2_2_20_1","volume-title":"Advances in Neural Information Processing Systems","volume":"27","author":"Ghoshdastidar Debarghya","year":"2014","unstructured":"Debarghya Ghoshdastidar and Ambedkar Dukkipati. 2014. Consistency of Spectral Partitioning of Uniform Hypergraphs under Planted Partition Model. In Advances in Neural Information Processing Systems, Vol. 27. Curran Associates, Inc."},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536342"},{"key":"e_1_3_2_2_22_1","unstructured":"A. V. Goldberg. 1984. Finding a Maximum Density Subgraph. Technical Report. University of California at Berkeley USA."},{"key":"e_1_3_2_2_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/bigdata55660.2022.10020506"},{"key":"e_1_3_2_2_24_1","volume-title":"Advances in Neural Information Processing Systems","volume":"35","author":"Harb Elfarouk","year":"2022","unstructured":"Elfarouk Harb, Kent Quanrud, and Chandra Chekuri. 2022. Faster and Scalable Algorithms for Densest Subgraph and Decomposition. Advances in Neural Information Processing Systems , Vol. 35 (Dec. 2022), 26966--26979."},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3132847.3132907"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1995.470419"},{"key":"e_1_3_2_2_27_1","volume-title":"Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. arXiv preprint arXiv:2310.13792","author":"Huang Yufan","year":"2023","unstructured":"Yufan Huang, David F Gleich, and Nate Veldt. 2023. Densest Subhypergraph: Negative Supermodular Functions and Strongly Localized Methods. arXiv preprint arXiv:2310.13792 (2023)."},{"key":"e_1_3_2_2_28_1","doi-asserted-by":"publisher","DOI":"10.1371\/journal.pone.0243485"},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2022.07.006"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/502090.502096"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/177"},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978--3--540--30115--8_22"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623706"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","unstructured":"Tommaso Lanciano Atsushi Miyauchi Adriano Fazzone and Francesco Bonchi. 2023. A Survey on the Densest Subgraph Problem and Its Variants. https:\/\/doi.org\/10.48550\/arXiv.2303.14467 arxiv: 2303.14467 [cs]","DOI":"10.48550\/arXiv.2303.14467"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-25960-2_25"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2015.68"},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2009.10129177"},{"key":"e_1_3_2_2_39_1","volume-title":"Inhomogeneous hypergraph clustering with applications. Advances in neural information processing systems","author":"Li Pan","year":"2017","unstructured":"Pan Li and Olgica Milenkovic. 2017. Inhomogeneous hypergraph clustering with applications. Advances in neural information processing systems , Vol. 30 (2017)."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3442381.3449887"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1016\/0166-218X(90)90133-W"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3271720"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.18653\/v1\/D19--1018"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.5555\/2634074.2634168"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-007-0189--2"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1989"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1145\/263867.263872"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403248"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_2_51_1","volume-title":"Dense Subgraph Discovery: Theory and Applications (Tutorial SDM 2021","author":"Tsourakakis Charalampos","year":"2021","unstructured":"Charalampos Tsourakakis and Tianyi Chen. 2021. Dense Subgraph Discovery: Theory and Applications (Tutorial SDM 2021). https:\/\/tsourakakis.com\/dense-subgraph-discovery-theory-and-applications-tutorial-sdm-2021\/"},{"key":"e_1_3_2_2_52_1","volume-title":"Austin R. Benson, and Jon Kleinberg","author":"Veldt Nate","year":"2020","unstructured":"Nate Veldt, Austin R. Benson, and Jon Kleinberg. 2020a. Hypergraph Cuts with General Splitting Functions. arxiv: 2001.02817 [cs]"},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/3394486.3403222"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/3447548.3467398"},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3178876.3186110"},{"key":"e_1_3_2_2_56_1","volume-title":"Gleich","author":"Veldt Nate","year":"2019","unstructured":"Nate Veldt, Christine Klymko, and David F. Gleich. 2019. Flow-Based Local Graph Clustering with Better Seed Set Inclusion. In Proceedings of the 2019 SIAM International Conference on Data Mining (SDM '19)."},{"key":"e_1_3_2_2_57_1","volume-title":"International Conference on Machine Learning. PMLR, 3598--3607","author":"Wang Di","year":"2017","unstructured":"Di Wang, Kimon Fountoulakis, Monika Henzinger, Michael W Mahoney, and Satish Rao. 2017. Capacity releasing diffusion for speed and locality. In International Conference on Machine Learning. PMLR, 3598--3607."},{"key":"e_1_3_2_2_58_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"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.3645624","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645624","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:32:12Z","timestamp":1755822732000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645624"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":58,"alternative-id":["10.1145\/3589334.3645624","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645624","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"}}]}}