{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,23]],"date-time":"2025-08-23T05:22:19Z","timestamp":1755926539964,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":41,"publisher":"ACM","license":[{"start":{"date-parts":[[2021,3,8]],"date-time":"2021-03-08T00:00:00Z","timestamp":1615161600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000183","name":"Army Research Office","doi-asserted-by":"publisher","award":["W911NF1910407"],"award-info":[{"award-number":["W911NF1910407"]}],"id":[{"id":"10.13039\/100000183","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"NSF (National Science Foundation)","doi-asserted-by":"publisher","award":["IIS 1908070"],"award-info":[{"award-number":["IIS 1908070"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2021,3,8]]},"DOI":"10.1145\/3437963.3441756","type":"proceedings-article","created":{"date-parts":[[2021,3,6]],"date-time":"2021-03-06T04:36:17Z","timestamp":1615005377000},"page":"743-751","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Exploring the Subgraph Density-Size Trade-off via the Lova\u015bz Extension"],"prefix":"10.1145","author":[{"given":"Aritra","family":"Konar","sequence":"first","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]},{"given":"Nicholas D.","family":"Sidiropoulos","sequence":"additional","affiliation":[{"name":"University of Virginia, Charlottesville, VA, USA"}]}],"member":"320","published-online":{"date-parts":[[2021,3,8]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1605"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987570"},{"volume-title":"Nonlinear Programming","author":"Bertsekas Dimitri P","key":"e_1_3_2_1_3_1","unstructured":"Dimitri P Bertsekas . 2016. Nonlinear Programming . Athena Scientific . Dimitri P Bertsekas. 2016. Nonlinear Programming. Athena Scientific."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.34"},{"volume-title":"SN Operations Research Forum","author":"Bombina Polina","key":"e_1_3_2_1_6_1","unstructured":"Polina Bombina and Brendan Ames . 2020. Convex optimization for the densest subgraph and densest submatrix problems . In SN Operations Research Forum , Vol. 1 . Springer , 1--24. Polina Bombina and Brendan Ames. 2020. Convex optimization for the densest subgraph and densest submatrix problems. In SN Operations Research Forum, Vol. 1. Springer, 1--24."},{"volume-title":"Distributed optimization and statistical learning via the alternating direction method of multipliers","author":"Boyd Stephen","key":"e_1_3_2_1_7_1","unstructured":"Stephen Boyd , Neal Parikh , and Eric Chu . 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers . Now Publishers Inc . Stephen Boyd, Neal Parikh, and Eric Chu. 2011. Distributed optimization and statistical learning via the alternating direction method of multipliers. Now Publishers Inc."},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-012-0245-9"},{"key":"e_1_3_2_1_11_1","volume-title":"J. Hartmanis, and J. van Leeuwen 11","author":"Edmonds Jack","year":"1970","unstructured":"Jack Edmonds . 1970. Submodular functions, matroids, and certain polyhedra. Edited by G. Goos , J. Hartmanis, and J. van Leeuwen 11 ( 1970 ). Jack Edmonds. 1970. Submodular functions, matroids, and certain polyhedra. Edited by G. Goos, J. Hartmanis, and J. van Leeuwen 11 (1970)."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","unstructured":"Marguerite Frank Philip Wolfe etal 1956. An algorithm for quadratic programming. Naval research logistics quarterly 3 1--2 (1956) 95--110.  Marguerite Frank Philip Wolfe et al. 1956. An algorithm for quadratic programming. Naval research logistics quarterly 3 1--2 (1956) 95--110.","DOI":"10.1002\/nav.3800030109"},{"volume-title":"Submodular functions and optimization","author":"Fujishige Satoru","key":"e_1_3_2_1_15_1","unstructured":"Satoru Fujishige . 2005. Submodular functions and optimization . Elsevier . Satoru Fujishige. 2005. Submodular functions and optimization. Elsevier."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_17_1","first-page":"44","article-title":"CoreCluster: A Degeneracy Based Graph Clustering Framework","volume":"14","author":"Giatsidis Christos","year":"2014","unstructured":"Christos Giatsidis , Fragkiskos D Malliaros , Dimitrios M Thilikos , and Michalis Vazirgiannis . 2014 . CoreCluster: A Degeneracy Based Graph Clustering Framework .. In AAAI , Vol. 14. 44 -- 50 . Christos Giatsidis, Fragkiskos D Malliaros, Dimitrios M Thilikos, and Michalis Vazirgiannis. 2014. CoreCluster: A Degeneracy Based Graph Clustering Framework.. In AAAI, Vol. 14. 44--50.","journal-title":"AAAI"},{"volume-title":"Finding a maximum density subgraph. Technical report","author":"Goldberg Andrew V","key":"e_1_3_2_1_18_1","unstructured":"Andrew V Goldberg . 1984. Finding a maximum density subgraph. Technical report , University of California Berkeley , CA. Andrew V Goldberg. 1984. Finding a maximum density subgraph. Technical report, University of California Berkeley, CA."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1137\/110836936"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939747"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"e_1_3_2_1_22_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 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_23_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1137\/0716071"},{"volume-title":"Mathematical programming the state of the art","author":"Lov\u00e1sz L\u00e1szl\u00f3","key":"e_1_3_2_1_25_1","unstructured":"L\u00e1szl\u00f3 Lov\u00e1sz . 1983. Submodular functions and convexity . In Mathematical programming the state of the art . Springer , 235--257. L\u00e1szl\u00f3 Lov\u00e1sz. 1983. Submodular functions and convexity. In Mathematical programming the state of the art. Springer, 235--257."},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2010.936019"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055412"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"volume-title":"Introductory lectures on convex optimization: A basic course","author":"Nesterov Yurii","key":"e_1_3_2_1_29_1","unstructured":"Yurii Nesterov . 2013. Introductory lectures on convex optimization: A basic course . Vol. 87 . Springer Science & Business Media . Yurii Nesterov. 2013. Introductory lectures on convex optimization: A basic course. Vol. 87. Springer Science & Business Media."},{"key":"e_1_3_2_1_30_1","volume-title":"International Conference on Machine Learning. 1890--1898","author":"Papailiopoulos Dimitris","year":"2014","unstructured":"Dimitris Papailiopoulos , Ioannis Mitliagkas , Alexandros Dimakis , and Constantine Caramanis . 2014 . Finding dense subgraphs via low-rank bilinear optimization . In International Conference on Machine Learning. 1890--1898 . Dimitris Papailiopoulos, Ioannis Mitliagkas, Alexandros Dimakis, and Constantine Caramanis. 2014. Finding dense subgraphs via low-rank bilinear optimization. In International Conference on Machine Learning. 1890--1898."},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1561\/9781601987174"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1021\/ci8002478"},{"volume-title":"Convex analysis. Number 28","author":"Rockafellar R Tyrrell","key":"e_1_3_2_1_33_1","unstructured":"R Tyrrell Rockafellar . 1970. Convex analysis. Number 28 . Princeton university press . R Tyrrell Rockafellar. 1970. Convex analysis. Number 28. Princeton university press."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"volume-title":"Combinatorial optimization: polyhedra and efficiency","author":"Schrijver Alexander","key":"e_1_3_2_1_35_1","unstructured":"Alexander Schrijver . 2003. Combinatorial optimization: polyhedra and efficiency . Vol. 24 . Springer Science & Business Media . Alexander Schrijver. 2003. Combinatorial optimization: polyhedra and efficiency. Vol. 24. Springer Science & Business Media."},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.5555\/646687.702946"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741098"},{"key":"e_1_3_2_1_38_1","volume-title":"Collective dynamics of 'small-world' networks. Nature 393, 6684","author":"Watts Duncan","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998. Collective dynamics of 'small-world' networks. Nature 393, 6684 ( 1998 ), 440. Duncan JWatts and Steven H Strogatz. 1998. Collective dynamics of 'small-world' networks. Nature 393, 6684 (1998), 440."},{"key":"e_1_3_2_1_39_1","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","author":"Yuan Xiao-Tong","year":"2013","unstructured":"Xiao-Tong Yuan and Tong Zhang . 2013 . Truncated power method for sparse eigenvalue problems . Journal of Machine Learning Research 14 , Apr (2013), 899 -- 925 . Xiao-Tong Yuan and Tong Zhang. 2013. Truncated power method for sparse eigenvalue problems. Journal of Machine Learning Research 14, Apr (2013), 899-- 925.","journal-title":"Journal of Machine Learning Research 14"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611974973.64"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2012.35"}],"event":{"name":"WSDM '21: The Fourteenth ACM International Conference on Web Search and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data","SIGIR ACM Special Interest Group on Information Retrieval"],"location":"Virtual Event Israel","acronym":"WSDM '21"},"container-title":["Proceedings of the 14th ACM International Conference on Web Search and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441756","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/abs\/10.1145\/3437963.3441756","content-type":"text\/html","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441756","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3437963.3441756","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:47:35Z","timestamp":1750193255000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3437963.3441756"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,3,8]]},"references-count":41,"alternative-id":["10.1145\/3437963.3441756","10.1145\/3437963"],"URL":"https:\/\/doi.org\/10.1145\/3437963.3441756","relation":{},"subject":[],"published":{"date-parts":[[2021,3,8]]},"assertion":[{"value":"2021-03-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}