{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,11]],"date-time":"2026-01-11T04:47:23Z","timestamp":1768106843620,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":50,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,8,24]],"date-time":"2024-08-24T00:00:00Z","timestamp":1724457600000},"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":[[2024,8,25]]},"DOI":"10.1145\/3637528.3671727","type":"proceedings-article","created":{"date-parts":[[2024,8,25]],"date-time":"2024-08-25T04:55:12Z","timestamp":1724561712000},"page":"3907-3918","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":7,"title":["Efficient and Effective Anchored Densest Subgraph Search: A Convex-programming based Approach"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-0982-341X","authenticated-orcid":false,"given":"Xiaowei","family":"Ye","sequence":"first","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8658-6599","authenticated-orcid":false,"given":"Rong-Hua","family":"Li","sequence":"additional","affiliation":[{"name":"Key Laboratory of Intelligent Supply Chain Technology, Longgang District, Shenzhen; Beijing Institute of Technology, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0000-9700-5809","authenticated-orcid":false,"given":"Lei","family":"Liang","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-3511-5139","authenticated-orcid":false,"given":"Zhizhen","family":"Liu","sequence":"additional","affiliation":[{"name":"Ant Group, Hangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2194-8146","authenticated-orcid":false,"given":"Longlong","family":"Lin","sequence":"additional","affiliation":[{"name":"Southwest University, Chongqing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0181-8379","authenticated-orcid":false,"given":"Guoren","family":"Wang","sequence":"additional","affiliation":[{"name":"Beijing Institute of Technology, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2024,8,24]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"2017. Zachary karate club network dataset - KONECT. http:\/\/konect.cc\/ networks\/ucidata-zachary"},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_3_2_2_3_1","volume-title":"Multi-agent Random Walks for Local Clustering on Graphs. In ICDM","author":"Alamgir Morteza","year":"2010","unstructured":"Morteza Alamgir and Ulrike von Luxburg. 2010. Multi-agent Random Walks for Local Clustering on Graphs. In ICDM 2010. IEEE Computer Society, 18--27."},{"key":"e_1_3_2_2_4_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. 35--44.","DOI":"10.1145\/3340531.3412036"},{"key":"e_1_3_2_2_5_1","volume-title":"WAW","author":"Andersen Reid","unstructured":"Reid Andersen and Kumar Chellapilla. 2009. Finding Dense Subgraphs with Size Bounds. In WAW, Vol. 5427. Springer, 25--37."},{"key":"e_1_3_2_2_6_1","volume-title":"Lang","author":"Andersen Reid","year":"2006","unstructured":"Reid Andersen and Kevin J. Lang. 2006. Communities from seed sets. In WWW 2006. ACM, 223--232."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-015-0422-1"},{"key":"e_1_3_2_2_8_1","volume-title":"On Multi-query Local Community Detection. In ICDM","author":"Bian Yuchen","year":"2018","unstructured":"Yuchen Bian, Yaowei Yan, Wei Cheng, Wei Wang, Dongsheng Luo, and Xiang Zhang. 2018. On Multi-query Local Community Detection. In ICDM 2018. IEEE Computer Society, 9--18."},{"key":"e_1_3_2_2_9_1","volume-title":"Flowless: Extracting Densest Subgraphs Without Flow Computations. In WWW. 573--583.","author":"Boob Digvijay","year":"2020","unstructured":"Digvijay Boob, Yu Gao, Richard Peng, Saurabh Sawlani, Charalampos E. Tsourakakis, Di Wang, and Junxing Wang. 2020. Flowless: Extracting Densest Subgraphs Without Flow Computations. In WWW. 573--583."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"crossref","unstructured":"Lijun Chang and Lu Qin. 2019. Cohesive Subgraph Computation Over Large Sparse Graphs. In ICDE. 2068--2071.","DOI":"10.1109\/ICDE.2019.00241"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_2_12_1","volume-title":"Torres","author":"Chekuri Chandra","year":"2022","unstructured":"Chandra Chekuri, Kent Quanrud, and Manuel R. Torres. 2022. Densest Subgraph: Supermodularity, Iterative Peeling, and Flow. In SODA. SIAM, 1531--1555."},{"key":"e_1_3_2_2_13_1","volume-title":"Local Community Identification in Social Networks. In ASONAM","author":"Chen Jiyang","year":"2009","unstructured":"Jiyang Chen, Osmar R. Za\u00efane, and Randy Goebel. 2009. Local Community Identification in Social Networks. In ASONAM 2009. IEEE Computer Society, 237--242."},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"crossref","unstructured":"Wanyun Cui Yanghua Xiao Haixun Wang Yiqi Lu and Wei Wang. 2013. Online search of overlapping communities. In SIGMOD. ACM 277--288.","DOI":"10.1145\/2463676.2463722"},{"key":"e_1_3_2_2_15_1","unstructured":"Wanyun Cui Yanghua Xiao Haixun Wang and Wei Wang. 2014. Local search of communities in large graphs. In SIGMOD. ACM 991--1002."},{"key":"e_1_3_2_2_16_1","volume-title":"Anchored Densest Subgraph. In SIGMOD '22","author":"Dai Yizhou","year":"2022","unstructured":"Yizhou Dai, Miao Qiao, and Lijun Chang. 2022. Anchored Densest Subgraph. In SIGMOD '22. ACM, 1200--1213."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"crossref","unstructured":"Maximilien Danisch T.-H. Hubert Chan and Mauro Sozio. 2017. Large Scale Density-friendly Graph Decomposition via Convex Programming. InWWW2017. ACM 233--242.","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1088\/1742-5468\/2004\/10\/P10012"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-01962-3"},{"key":"e_1_3_2_2_23_1","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph. (1984)."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10489-020-02052-0"},{"key":"e_1_3_2_2_25_1","unstructured":"Elfarouk Harb Kent Quanrud and Chandra Chekuri. 2022. Faster and Scalable Algorithms for Densest Subgraph and Decomposition. In NeurIPS."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2015.89"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2856318.2856323"},{"key":"e_1_3_2_2_28_1","volume-title":"Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization. In ICML","volume":"28","author":"Jaggi Martin","year":"2013","unstructured":"Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization. In ICML 2013, Vol. 28. 427--435."},{"key":"e_1_3_2_2_29_1","volume-title":"SIGKDD","author":"Isabel","year":"2014","unstructured":"Isabel M. Kloumann and Jon M. Kleinberg. 2014. Community membership identification from small seed sets. In SIGKDD 2014. ACM, 1366--1375."},{"key":"e_1_3_2_2_30_1","volume-title":"A Survey on the Densest Subgraph Problem and its Variants. CoRR abs\/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. CoRR abs\/2303.14467 (2023)."},{"key":"e_1_3_2_2_31_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_32_1","doi-asserted-by":"crossref","unstructured":"Longlong Lin Ronghua Li and Tao Jia. 2023. Scalable and Effective Conductance-Based Graph Clustering. In AAAI. 4471--4478.","DOI":"10.1609\/aaai.v37i4.25568"},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.14778\/3551793.3551826"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/3514221.3517837"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Alan Mislove Bimal Viswanath P. Krishna Gummadi and Peter Druschel. 2010. You are who you know: inferring user profiles in online social networks. In WSDM. ACM 251--260.","DOI":"10.1145\/1718487.1718519"},{"key":"e_1_3_2_2_36_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. In SIGKDD. 1710--1721."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"crossref","unstructured":"Nicholas Nethercote and Julian Seward. 2007. Valgrind: a framework for heavyweight dynamic binary instrumentation. In PLDI. ACM 89--100.","DOI":"10.1145\/1273442.1250746"},{"key":"e_1_3_2_2_38_1","volume-title":"Fast algorithm for detecting community structure in networks. Physical review E 69, 6","author":"Newman Mark EJ","year":"2004","unstructured":"Mark EJ Newman. 2004. Fast algorithm for detecting community structure in networks. Physical review E 69, 6 (2004), 066133."},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973402.94"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1038\/nature03607"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"crossref","unstructured":"Lior Rokach and Oded Maimon. 2005. Clustering methods. In Data mining and knowledge discovery handbook. 321--352.","DOI":"10.1007\/0-387-25465-X_15"},{"key":"e_1_3_2_2_42_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 SIGKDD. ACM 939--948.","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"crossref","unstructured":"Hanghang Tong and Christos Faloutsos. 2006. Center-piece subgraphs: problem definition and fast solutions. In SIGKDD. ACM 404--413.","DOI":"10.1145\/1150402.1150448"},{"key":"e_1_3_2_2_45_1","article-title":"Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means","volume":"17","author":"van Laarhoven Twan","year":"2016","unstructured":"Twan van Laarhoven and Elena Marchiori. 2016. Local Network Community Detection with Continuous Optimization of Conductance and Weighted Kernel K-Means. J. Mach. Learn. Res. 17 (2016), 147:1--147:28.","journal-title":"J. Mach. Learn. Res."},{"key":"e_1_3_2_2_46_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 SDM. SIAM, 378--386."},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244408.1244416"},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_3_2_2_49_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0490-5"},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"crossref","unstructured":"Xiwang Yang Harald Steck and Yong Liu. 2012. Circle-based recommendation in online social networks. In SIGKDD. ACM 1267--1275.","DOI":"10.1145\/2339530.2339728"}],"event":{"name":"KDD '24: The 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","location":"Barcelona Spain","acronym":"KDD '24","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 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671727","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3637528.3671727","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:06:01Z","timestamp":1750291561000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3637528.3671727"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,8,24]]},"references-count":50,"alternative-id":["10.1145\/3637528.3671727","10.1145\/3637528"],"URL":"https:\/\/doi.org\/10.1145\/3637528.3671727","relation":{},"subject":[],"published":{"date-parts":[[2024,8,24]]},"assertion":[{"value":"2024-08-24","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}