{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,8]],"date-time":"2026-08-08T17:37:05Z","timestamp":1786210625895,"version":"3.56.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2020,4,20]],"date-time":"2020-04-20T00:00:00Z","timestamp":1587340800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2020,4,20]]},"DOI":"10.1145\/3366423.3380140","type":"proceedings-article","created":{"date-parts":[[2020,5,4]],"date-time":"2020-05-04T08:11:44Z","timestamp":1588579904000},"page":"573-583","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":42,"title":["Flowless: Extracting Densest Subgraphs Without Flow Computations"],"prefix":"10.1145","author":[{"given":"Digvijay","family":"Boob","sequence":"first","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yu","family":"Gao","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Richard","family":"Peng","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saurabh","family":"Sawlani","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Charalampos","family":"Tsourakakis","sequence":"additional","affiliation":[{"name":"Boston University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Di","family":"Wang","sequence":"additional","affiliation":[{"name":"Georgia Institute of Technology, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Junxing","family":"Wang","sequence":"additional","affiliation":[{"name":"CMU, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2020,4,20]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.4086\/toc.2012.v008a006"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-13123-8_6"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/3038912.3052619"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_11_1","unstructured":"Hossein Esfandiari MohammadTaghi Hajiaghayi and David\u00a0P Woodruff. 2015. Applications of uniform sampling: Densest subgraph and beyond. arXiv preprint arXiv:1506.04505(2015).  Hossein Esfandiari MohammadTaghi Hajiaghayi and David\u00a0P Woodruff. 2015. Applications of uniform sampling: Densest subgraph and beyond. arXiv preprint arXiv:1506.04505(2015)."},{"key":"e_1_3_2_1_12_1","unstructured":"Hossein Esfandiari Silvio Lattanzi and Vahab Mirrokni. 2018. Parallel and Streaming Algorithms for K-Core Decomposition. arXiv preprint arXiv:1808.02546(2018).  Hossein Esfandiari Silvio Lattanzi and Vahab Mirrokni. 2018. Parallel and Streaming Algorithms for K-Core Decomposition. arXiv preprint arXiv:1808.02546(2018)."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/238061.238163"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_15_1","volume-title":"Twenty-Eighth AAAI Conference on Artificial Intelligence.","author":"Giatsidis Christos","year":"2014","unstructured":"Christos Giatsidis , Fragkiskos Malliaros , Dimitrios Thilikos , and Michalis Vazirgiannis . 2014 . Corecluster: A degeneracy based graph clustering framework . In Twenty-Eighth AAAI Conference on Artificial Intelligence. Christos Giatsidis, Fragkiskos Malliaros, Dimitrios Thilikos, and Michalis Vazirgiannis. 2014. Corecluster: A degeneracy based graph clustering framework. In Twenty-Eighth AAAI Conference on Artificial Intelligence."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_1_17_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg V","unstructured":"Andrew\u00a0 V Goldberg . 1984. Finding a maximum density subgraph . University of California Berkeley , CA. Andrew\u00a0V Goldberg. 1984. Finding a maximum density subgraph. University of California Berkeley, CA."},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/48014.61051"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_1_20_1","unstructured":"Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn Bonn.  Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs. Rheinische Friedrich-Wilhelms-Universit\u00e4t Bonn Bonn."},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.5555\/3288645.3288671"},{"key":"e_1_3_2_1_22_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\u2013608. Samir Khuller and Barna Saha. 2009. On finding dense subgraphs. In International Colloquium on Automata, Languages, and Programming. Springer, 597\u2013608."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487788.2488173"},{"key":"e_1_3_2_1_24_1","volume-title":"SNAP Datasets: Stanford Large Network Dataset Collection. (June","author":"Leskovec Jure","year":"2014","unstructured":"Jure Leskovec and Andrej Krevl . 2014. SNAP Datasets: Stanford Large Network Dataset Collection. (June 2014 ). http:\/\/snap.stanford.edu\/data Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. (June 2014). http:\/\/snap.stanford.edu\/data"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-48054-0_39"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/3219302.3219303"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"crossref","unstructured":"Saurabh Sawlani and Junxing Wang. 2019. Near-Optimal Fully Dynamic Densest Subgraph. arXiv preprint arXiv:1907.03037(2019).  Saurabh Sawlani and Junxing Wang. 2019. Near-Optimal Fully Dynamic Densest Subgraph. arXiv preprint arXiv:1907.03037(2019).","DOI":"10.1145\/3357713.3384327"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2016.0058"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"crossref","unstructured":"Konstantinos Sotiropoulos John\u00a0W Byers Polyvios Pratikakis and Charalampos\u00a0E Tsourakakis. 2019. TwitterMancer: Predicting Interactions on Twitter Accurately. arXiv preprint arXiv:1904.11119(2019).  Konstantinos Sotiropoulos John\u00a0W Byers Polyvios Pratikakis and Charalampos\u00a0E Tsourakakis. 2019. TwitterMancer: Predicting Interactions on Twitter Accurately. arXiv preprint arXiv:1904.11119(2019).","DOI":"10.1109\/ALLERTON.2019.8919702"},{"key":"e_1_3_2_1_31_1","volume-title":"BioGRID: A general repository for interaction datasets. Nucleic acids research 34 (01","author":"Stark Chris","year":"2006","unstructured":"Chris Stark , Bobby-Joe Breitkreutz , Teresa Reguly , Lorrie Boucher , Ashton Breitkreutz , and Mike Tyers . 2006. BioGRID: A general repository for interaction datasets. Nucleic acids research 34 (01 2006 ), D535\u20139. http:\/\/dx.doi.org\/10.1093\/nar\/gkj109 10.1093\/nar Chris Stark, Bobby-Joe Breitkreutz, Teresa Reguly, Lorrie Boucher, Ashton Breitkreutz, and Mike Tyers. 2006. BioGRID: A general repository for interaction datasets. Nucleic acids research 34 (01 2006), D535\u20139. http:\/\/dx.doi.org\/10.1093\/nar\/gkj109"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2817946.2817950"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_36_1","unstructured":"Charalampos\u00a0E Tsourakakis Tianyi Chen Naonori Kakimura and Jakub Pachocki. 2019. Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. arXiv preprint arXiv:1904.08178(2019).  Charalampos\u00a0E Tsourakakis Tianyi Chen Naonori Kakimura and Jakub Pachocki. 2019. Novel Dense Subgraph Discovery Primitives: Risk Aversion and Exclusion Queries. arXiv preprint arXiv:1904.08178(2019)."},{"key":"e_1_3_2_1_37_1","unstructured":"R. Zafarani and H. Liu. 2009. Social Computing Data Repository at ASU. (2009). http:\/\/socialcomputing.asu.edu  R. Zafarani and H. Liu. 2009. Social Computing Data Repository at ASU. (2009). http:\/\/socialcomputing.asu.edu"}],"event":{"name":"WWW '20: The Web Conference 2020","location":"Taipei Taiwan","acronym":"WWW '20","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of The Web Conference 2020"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380140","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3366423.3380140","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T22:33:00Z","timestamp":1750199580000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3366423.3380140"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,20]]},"references-count":37,"alternative-id":["10.1145\/3366423.3380140","10.1145\/3366423"],"URL":"https:\/\/doi.org\/10.1145\/3366423.3380140","relation":{},"subject":[],"published":{"date-parts":[[2020,4,20]]},"assertion":[{"value":"2020-04-20","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}