{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,6]],"date-time":"2026-01-06T13:09:08Z","timestamp":1767704948050,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":51,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,10]],"date-time":"2022-06-10T00:00:00Z","timestamp":1654819200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100003524","name":"Ministry of Business, Innovation and Employment","doi-asserted-by":"publisher","award":["UOAX2001"],"award-info":[{"award-number":["UOAX2001"]}],"id":[{"id":"10.13039\/501100003524","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100009193","name":"Marsden Fund","doi-asserted-by":"publisher","award":["UOA1732"],"award-info":[{"award-number":["UOA1732"]}],"id":[{"id":"10.13039\/501100009193","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100000923","name":"Australian Research Council","doi-asserted-by":"publisher","award":["FT180100256, DP220103731"],"award-info":[{"award-number":["FT180100256, DP220103731"]}],"id":[{"id":"10.13039\/501100000923","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517890","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"1200-1213","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":12,"title":["Anchored Densest Subgraph"],"prefix":"10.1145","author":[{"given":"Yizhou","family":"Dai","sequence":"first","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}]},{"given":"Miao","family":"Qiao","sequence":"additional","affiliation":[{"name":"The University of Auckland, Auckland, New Zealand"}]},{"given":"Lijun","family":"Chang","sequence":"additional","affiliation":[{"name":"The University of Sydney, Sydney, NSW, Australia"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.14778\/3137628.3137640"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.87"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.44"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-019-0566-x"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_6_1","volume-title":"Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM 2015","author":"Balalau O. D.","year":"2015","unstructured":"O. D. Balalau, F. Bonchi, T.-H. H. Chan, F. Gullo, and M. Sozio. 2015. Finding Subgraphs with Maximum Total Density and Limited Overlap. In Proceedings of the Eighth ACM International Conference on Web Search and Data Mining, WSDM 2015, Shanghai, China, February 2--6, 2015. ACM, 379--388."},{"key":"e_1_3_2_1_7_1","volume-title":"Efficient and effective community search. Data mining and knowledge discovery","author":"Barbieri Nicola","year":"2015","unstructured":"Nicola Barbieri, Francesco Bonchi, Edoardo Galimberti, and Francesco Gullo. 2015. Efficient and effective community search. Data mining and knowledge discovery, Vol. 29, 5 (2015), 1406--1433."},{"volume-title":"Proc. of STOC'15","author":"Bhattacharya S.","key":"e_1_3_2_1_8_1","unstructured":"S. Bhattacharya, M. Henzinger, D. Nanongkai, and C. E. Tsourakakis. 2015. Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In Proc. of STOC'15. 173--182."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2017.11"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2018.00016"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/3091106"},{"key":"e_1_3_2_1_12_1","volume-title":"Deconstruct Densest Subgraphs. In WWW '20: The Web Conference 2020","author":"Chang Lijun","year":"2020","unstructured":"Lijun Chang and Miao Qiao. 2020. Deconstruct Densest Subgraphs. In WWW '20: The Web Conference 2020, Taipei, Taiwan, April 20--24, 2020, Yennun Huang, Irwin King, Tie-Yan Liu, and Maarten van Steen (Eds.). ACM \/ IW3C2, 2747--2753."},{"volume-title":"Cohesive Subgraph Computation over Large Sparse Graphs","author":"Chang Lijun","key":"e_1_3_2_1_13_1","unstructured":"Lijun Chang and Lu Qin. 2018. Cohesive Subgraph Computation over Large Sparse Graphs .Springer Series in the Data Sciences."},{"key":"e_1_3_2_1_14_1","volume-title":"Third International Workshop. 84--95","author":"Charikar M.","year":"2000","unstructured":"M. Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Approximation Algorithms for Combinatorial Optimization, Third International Workshop. 84--95."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASONAM.2009.14"},{"key":"e_1_3_2_1_16_1","volume-title":"Leiserson","author":"Cormen Thomas H.","year":"2001","unstructured":"Thomas H. Cormen, Clifford Stein, Ronald L. Rivest, and Charles E. Leiserson. 2001. Introduction to Algorithms .McGraw-Hill Higher Education."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2463722"},{"volume-title":"Proc. of WWW'17","author":"Danisch M.","key":"e_1_3_2_1_18_1","unstructured":"M. Danisch, T.-H. H. Chan, and M. Sozio. 2017. Large Scale Density-friendly Graph Decomposition via Convex Programming. In Proc. of WWW'17. 233--242."},{"volume-title":"Proceedings of the 16th International Conference on World Wide Web, WWW. ACM, 461--470","author":"Dourisboure Y.","key":"e_1_3_2_1_19_1","unstructured":"Y. Dourisboure, F. Geraci, and M. Pellegrini. 2007. Extraction and classification of dense communities in the web. In Proceedings of the 16th International Conference on World Wide Web, WWW. ACM, 461--470."},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-019-00556-x"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_1_23_1","unstructured":"K. Fountoulakis M. Liu D. F. Gleich and M. W. Mahoney. 2020. Flow-based Algorithms for Improving Clusters: A Unifying Framework Software and Performance. CoRR Vol. abs\/2004.09608 (2020)."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0464-z"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"volume-title":"Proceedings of the 31st International Conference on Very Large Data Bases. ACM, 721--732","author":"Gibson D.","key":"e_1_3_2_1_26_1","unstructured":"D. Gibson, R. Kumar, and A. Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In Proceedings of the 31st International Conference on Very Large Data Bases. ACM, 721--732."},{"key":"e_1_3_2_1_27_1","volume-title":"Dense Subgraph Discovery: KDD 2015 tutorial. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","author":"Gionis Aristides","year":"2015","unstructured":"Aristides Gionis and Charalampos E. Tsourakakis. 2015. Dense Subgraph Discovery: KDD 2015 tutorial. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Sydney, NSW, Australia, August 10--13, 2015, Longbing Cao, Chengqi Zhang, Thorsten Joachims, Geoffrey I. Webb, Dragos D. Margineantu, and Graham Williams (Eds.). ACM, 2313--2314."},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2588555.2610495"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2019\/177"},{"key":"e_1_3_2_1_31_1","volume-title":"36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5--12, 2009, Proceedings, Part I","volume":"5555","author":"Khuller Samir","year":"2009","unstructured":"Samir Khuller and Barna Saha. 2009. On Finding Dense Subgraphs. In Automata, Languages and Programming, 36th International Colloquium, ICALP 2009, Rhodes, Greece, July 5--12, 2009, Proceedings, Part I, Vol. 5555. 597--608."},{"key":"e_1_3_2_1_32_1","volume-title":"Proc. Int. Conf. on World Wide Web Companion. 1343--1350","author":"Kunegis J\u00e9r\u00f4me","year":"2013","unstructured":"J\u00e9r\u00f4me Kunegis. 2013. KONECT -- The Koblenz Network Collection. In Proc. Int. Conf. on World Wide Web Companion. 1343--1350. http:\/\/dl.acm.org\/citation.cfm?id=2488173"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"crossref","unstructured":"V. E. Lee N. Ruan R. Jin and C. C. Aggarwal. 2010. A Survey of Algorithms for Dense Subgraph Discovery. In Managing and Mining Graph Data. 303--336.","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/1232722.1232727"},{"key":"e_1_3_2_1_35_1","unstructured":"J. Leskovec and A. Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data ."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389697"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.72.056107"},{"key":"e_1_3_2_1_38_1","volume-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014","author":"Orecchia L.","year":"2014","unstructured":"L. Orecchia and Z. A. Zhu. 2014. Flow-Based Algorithms for Local Graph Clustering. In Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, Portland, Oregon, USA, January 5--7, 2014, C. Chekuri (Ed.). SIAM, 1267--1286."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-015-0378-5"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3401960.3401962"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-40991-2_3"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"volume-title":"Proc. of WWW'15","author":"Tatti N.","key":"e_1_3_2_1_44_1","unstructured":"N. Tatti and A. Gionis. 2015b. Density-friendly Graph Decomposition. In Proc. of WWW'15. 1089--1099."},{"key":"e_1_3_2_1_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_46_1","volume-title":"SSDBM 2012, Chania, Crete, Greece, June 25--27, 2012. Proceedings (Lecture Notes in Computer Science","volume":"230","author":"Valari Elena","unstructured":"Elena Valari, Maria Kontaki, and Apostolos N. Papadopoulos. 2012a. Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections. In Scientific and Statistical Database Management - 24th International Conference, SSDBM 2012, Chania, Crete, Greece, June 25--27, 2012. Proceedings (Lecture Notes in Computer Science, Vol. 7338), Anastasia Ailamaki and Shawn Bowers (Eds.). Springer, 213--230."},{"volume-title":"Proc. of SSDBM'12","author":"Valari E.","key":"e_1_3_2_1_47_1","unstructured":"E. Valari, M. Kontaki, and A. N. Papadopoulos. 2012b. Discovery of Top-k Dense Subgraphs in Dynamic Graph Collections. In Proc. of SSDBM'12. 213--230."},{"key":"e_1_3_2_1_48_1","first-page":"5148","article-title":"Local network community detection with continuous optimization of conductance and weighted kernel k-means","volume":"17","author":"Laarhoven Twan Van","year":"2016","unstructured":"Twan Van Laarhoven and Elena Marchiori. 2016. Local network community detection with continuous optimization of conductance and weighted kernel k-means. The Journal of Machine Learning Research, Vol. 17, 1 (2016), 5148--5175.","journal-title":"The Journal of Machine Learning Research"},{"key":"e_1_3_2_1_49_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975673.43"},{"key":"e_1_3_2_1_50_1","doi-asserted-by":"publisher","DOI":"10.14778\/3015270.3015272"},{"key":"e_1_3_2_1_51_1","doi-asserted-by":"publisher","DOI":"10.14778\/2752939.2752948"},{"key":"e_1_3_2_1_52_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-017-0490-5"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"],"location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22"},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517890","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517890","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:36Z","timestamp":1750188636000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517890"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":51,"alternative-id":["10.1145\/3514221.3517890","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517890","relation":{},"subject":[],"published":{"date-parts":[[2022,6,10]]},"assertion":[{"value":"2022-06-11","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}