{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,8]],"date-time":"2026-02-08T10:30:31Z","timestamp":1770546631243,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":53,"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":[{"name":"Innovation and Technology Commission of Hong Kong","award":["MRP\/029\/18"],"award-info":[{"award-number":["MRP\/029\/18"]}]},{"DOI":"10.13039\/501100003803","name":"University of Hong Kong","doi-asserted-by":"publisher","award":["104005858,10400599,2100048"],"award-info":[{"award-number":["104005858,10400599,2100048"]}],"id":[{"id":"10.13039\/501100003803","id-type":"DOI","asserted-by":"publisher"}]},{"name":"NSFC","award":["62102341"],"award-info":[{"award-number":["62102341"]}]},{"name":"Natural Sciences and Engineering Research Council of Canada"},{"name":"HKU-TCL Joint Research Center for Artificial Intelligence","award":["200009430"],"award-info":[{"award-number":["200009430"]}]},{"name":"CUHK-SZ","award":["UDF01002139"],"award-info":[{"award-number":["UDF01002139"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,10]]},"DOI":"10.1145\/3514221.3517837","type":"proceedings-article","created":{"date-parts":[[2022,6,12]],"date-time":"2022-06-12T02:33:49Z","timestamp":1655001229000},"page":"845-859","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":27,"title":["A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery"],"prefix":"10.1145","author":[{"given":"Chenhao","family":"Ma","sequence":"first","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Yixiang","family":"Fang","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Shenzhen, China"}]},{"given":"Reynold","family":"Cheng","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}]},{"given":"Laks V. S.","family":"Lakshmanan","sequence":"additional","affiliation":[{"name":"The University of British Columbia, Vancouver, Canada"}]},{"given":"Xiaolin","family":"Han","sequence":"additional","affiliation":[{"name":"The University of Hong Kong, Hong Kong, Hong Kong"}]}],"member":"320","published-online":{"date-parts":[[2022,6,11]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"Federal Aviation Administration. 2019. Air Traffic Control System Command Center. https:\/\/www.faa.gov."},{"key":"e_1_3_2_2_2_1","volume-title":"Internet: Diameter of the world-wide web. nature","author":"Albert R\u00e9ka","year":"1999","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 1999. Internet: Diameter of the world-wide web. nature, Vol. 401, 6749 (1999), 130."},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00778-013-0340-z"},{"key":"e_1_3_2_2_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/3366423.3380140"},{"key":"e_1_3_2_2_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_2_9_1","volume-title":"Francesca Colaiori, Luciana S Buriol, Debora Donato, Stefano Leonardi, and Guido Caldarelli.","author":"Capocci Andrea","year":"2006","unstructured":"Andrea Capocci, Vito DP Servedio, Francesca Colaiori, Luciana S Buriol, Debora Donato, Stefano Leonardi, and Guido Caldarelli. 2006. Preferential attachment in the growth of social networks: The internet encyclopedia Wikipedia. Physical review E, Vol. 74, 3 (2006), 036116."},{"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.1145\/3038912.3052619"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.14778\/3342263.3342645"},{"key":"e_1_3_2_2_14_1","volume-title":"et almbox","author":"Frank Marguerite","year":"1956","unstructured":"Marguerite Frank, Philip Wolfe, et almbox. 1956. An algorithm for quadratic programming. Naval research logistics quarterly, Vol. 3, 1--2 (1956), 95--110."},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(97)00016-6"},{"key":"e_1_3_2_2_16_1","unstructured":"David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In PVLDB. VLDB Endowment 721--732."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_2_18_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V","unstructured":"Andrew V Goldberg. 1984. Finding a maximum density subgraph .University of California Berkeley, CA."},{"key":"e_1_3_2_2_19_1","volume-title":"Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks. In SIAM International Conference on Data Mining. SIAM.","author":"Han Xiaolin","year":"2022","unstructured":"Xiaolin Han, Reynold Cheng, Tobias Grubenmann, Silviu Maniu, Chenhao Ma, and Xiaodong Li. 2022 a. Leveraging Contextual Graphs for Stochastic Weight Completion in Sparse Road Networks. In SIAM International Conference on Data Mining. SIAM."},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.14778\/3523210.3523225"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.websem.2021.100696"},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE48307.2020.00190"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"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","volume-title":"Proceedings of the 30th international conference on machine learning. 427--435","author":"Jaggi Martin","year":"2013","unstructured":"Martin Jaggi. 2013. Revisiting Frank-Wolfe: Projection-free sparse convex optimization. In Proceedings of the 30th international conference on machine learning. 427--435."},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1348549.1348556"},{"key":"e_1_3_2_2_28_1","unstructured":"Ravi Kannan and V Vinay. 1999. Analyzing the structure of large graphs .Rheinische Friedrich-Wilhelms-Universit\"at Bonn Bonn."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1038\/nrm2503"},{"key":"e_1_3_2_2_30_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."},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_3_2_2_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:\/\/userpages.uni-koblenz.de\/ kunegis\/paper\/kunegis-koblenz-network-collection.pdf"},{"key":"e_1_3_2_2_33_1","article-title":"The Dynamics of Viral Marketing","volume":"1","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec, Lada A. Adamic, and Bernardo A. Huberman. 2007. The Dynamics of Viral Marketing. ACM Transaction on the Web, Vol. 1, 1 (2007).","journal-title":"ACM Transaction on the Web"},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.14778\/3447689.3447714"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.14778\/3364324.3364330"},{"key":"e_1_3_2_2_36_1","volume-title":"Laks VS Lakshmanan, and Xiaolin Han","author":"Ma Chenhao","year":"2022","unstructured":"Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks VS Lakshmanan, and Xiaolin Han. 2022. A Convex-Programming Approach for Efficient Directed Densest Subgraph Discovery [Technical Report]. https:\/\/github.com\/chenhao-ma\/DDS-convex-code\/main.pdf. (2022)."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/3318464.3389697"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1145\/3471485.3471494"},{"key":"e_1_3_2_2_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/3483940"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1109\/DASC.2009.130"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"crossref","unstructured":"Arjun Mukherjee Bing Liu and Natalie Glance. 2012. Spotting Fake Reviewer Groups in Consumer Reviews. In WWW. 191--200.","DOI":"10.1145\/2187836.2187863"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-25093-4_14"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2010.03.006"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-13672-6_42"},{"key":"e_1_3_2_2_47_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783299"},{"key":"e_1_3_2_2_48_1","unstructured":"Ryan Rossi and Nesreen Ahmed. 2013. Network Repository. http:\/\/networkrepository.com"},{"key":"e_1_3_2_2_49_1","volume-title":"International Symposium on Distributed Computing. Springer, 151--165","author":"Sarma Atish Das","year":"2012","unstructured":"Atish Das Sarma, Ashwin Lall, Danupon Nanongkai, and Amitabh Trehan. 2012. Dense subgraphs on dynamic networks. In International Symposium on Distributed Computing. Springer, 151--165."},{"key":"e_1_3_2_2_50_1","doi-asserted-by":"publisher","DOI":"10.1145\/3357713.3384327"},{"key":"e_1_3_2_2_51_1","unstructured":"Bintao Sun Maximilien Dansich Hubert Chan and Mauro Sozio. 2020. KClist"},{"key":"e_1_3_2_2_52_1","volume-title":"Proceedings of the VLDB Endowment","volume":"13","year":"2020","unstructured":": A Simple Algorithm for Finding k-Clique Densest Subgraphs in Large Graphs. Proceedings of the VLDB Endowment, Vol. 13, 10 (2020), 1628--1640."},{"key":"e_1_3_2_2_53_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_2_54_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"}],"event":{"name":"SIGMOD\/PODS '22: International Conference on Management of Data","location":"Philadelphia PA USA","acronym":"SIGMOD\/PODS '22","sponsor":["SIGMOD ACM Special Interest Group on Management of Data"]},"container-title":["Proceedings of the 2022 International Conference on Management of Data"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517837","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3514221.3517837","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:30:35Z","timestamp":1750188635000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3514221.3517837"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,10]]},"references-count":53,"alternative-id":["10.1145\/3514221.3517837","10.1145\/3514221"],"URL":"https:\/\/doi.org\/10.1145\/3514221.3517837","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"}}]}}