{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T04:35:18Z","timestamp":1770266118819,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2013,8,11]],"date-time":"2013-08-11T00:00:00Z","timestamp":1376179200000},"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":[[2013,8,11]]},"DOI":"10.1145\/2487575.2487645","type":"proceedings-article","created":{"date-parts":[[2013,8,13]],"date-time":"2013-08-13T12:31:21Z","timestamp":1376397081000},"page":"104-112","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":235,"title":["Denser than the densest subgraph"],"prefix":"10.1145","author":[{"given":"Charalampos","family":"Tsourakakis","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, Pittsburgh, Pennsylvania, USA"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}]},{"given":"Francesco","family":"Gullo","sequence":"additional","affiliation":[{"name":"Yahoo! Research, Barcelona, Spain"}]},{"given":"Maria","family":"Tsiarli","sequence":"additional","affiliation":[{"name":"University of Pittsburgh, Pittsburgh, Pennsylvania, USA"}]}],"member":"320","published-online":{"date-parts":[[2013,8,11]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"LATIN","author":"Abello J.","year":"2002","unstructured":"J. Abello , M. G. C. Resende , and S. Sudarsky . Massive quasi-clique detection . In LATIN , 2002 . J. Abello, M. G. C. Resende, and S. Sudarsky. Massive quasi-clique detection. In LATIN, 2002."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-95995-3_3"},{"key":"e_1_3_2_1_3_1","volume-title":"Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB, 5(6)","author":"Angel A.","year":"2012","unstructured":"A. Angel , N. Sarkas , N. Koudas , and D. Srivastava . Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB, 5(6) , 2012 . A. Angel, N. Sarkas, N. Koudas, and D. Srivastava. Dense subgraph maintenance under streaming edge weight updates for real-time story identification. PVLDB, 5(6), 2012."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/225058.225140"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0166-218X(01)00243-8"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/362342.362367"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92695-5_4"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_11_1","volume-title":"The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1)","author":"Chung F. R. K.","year":"2003","unstructured":"F. R. K. Chung and L. Lu . The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1) , 2003 . F. R. K. Chung and L. Lu. The average distance in a random graph with given expected degrees. Internet Mathematics, 1(1), 2003."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557142"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S089548010240415X"},{"key":"e_1_3_2_1_14_1","volume-title":"The dense k-subgraph problem. Algorithmica, 29(3)","author":"Feige U.","year":"2001","unstructured":"U. Feige , G. Kortsarz , and D. Peleg . The dense k-subgraph problem. Algorithmica, 29(3) , 2001 . U. Feige, G. Kortsarz, and D. Peleg. The dense k-subgraph problem. Algorithmica, 29(3), 2001."},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.2001.1183"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0218003"},{"key":"e_1_3_2_1_18_1","volume-title":"VLDB","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLDB , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLDB, 2005."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/894477"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02392825"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_24_1","volume-title":"Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2)","author":"Kolountzakis M. N.","year":"2012","unstructured":"M. N. Kolountzakis and : Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2) , 2012 . M. N. Kolountzakis and et al.: Efficient triangle counting in large graphs via degree-based vertex partitioning. Internet Mathematics, 8(1--2), 2012."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-23077-7_17"},{"key":"e_1_3_2_1_26_1","volume-title":"A survey of algorithms for dense subgraph discovery. Managing and Mining Graph Data","author":"Lee V. E.","year":"2010","unstructured":"V. E. Lee , N. Ruan , R. Jin , and C. C. Aggarwal . A survey of algorithms for dense subgraph discovery. Managing and Mining Graph Data . 2010 . V. E. Lee, N. Ruan, R. Jin, and C. C. Aggarwal. A survey of algorithms for dense subgraph discovery. Managing and Mining Graph Data. 2010."},{"key":"e_1_3_2_1_27_1","series-title":"SIAM review, 45(2):167--256","volume-title":"The structure and function of complex networks","author":"Newman M.","year":"2003","unstructured":"M. Newman . The structure and function of complex networks . SIAM review, 45(2):167--256 , 2003 . M. Newman. The structure and function of complex networks. SIAM review, 45(2):167--256, 2003."},{"key":"e_1_3_2_1_28_1","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics)","author":"Schrijver A.","year":"2004","unstructured":"A. Schrijver . Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics) . Springer , 2004 . A. Schrijver. Combinatorial Optimization: Polyhedra and Efficiency (Algorithms and Combinatorics). Springer, 2004."},{"key":"e_1_3_2_1_29_1","volume-title":"Repeated observation of breast tumor subtypes in independent gene expression data sets. PNAS, 100(14)","author":"Sorlie T.","year":"2003","unstructured":"T. Sorlie and Repeated observation of breast tumor subtypes in independent gene expression data sets. PNAS, 100(14) , 2003 . T. Sorlie and et al. Repeated observation of breast tumor subtypes in independent gene expression data sets. PNAS, 100(14), 2003."},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-008-9238-3"},{"key":"e_1_3_2_1_32_1","volume-title":"A gene-expression signature as a predictor of survival in breast cancer. The New England journal of medicine, 347(25)","author":"van de Vijver M. J.","year":"2002","unstructured":"M. J. van de Vijver and A gene-expression signature as a predictor of survival in breast cancer. The New England journal of medicine, 347(25) , 2002 . M. J. van de Vijver and et al. A gene-expression signature as a predictor of survival in breast cancer. The New England journal of medicine, 347(25), 2002."},{"key":"e_1_3_2_1_33_1","volume-title":"Garland Science","author":"Weinberg R. A.","year":"2006","unstructured":"R. A. Weinberg . The Biology of Cancer HB. Garland Science , 2006 . R. A. Weinberg. The Biology of Cancer HB. Garland Science, 2006."}],"event":{"name":"KDD' 13: The 19th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining","location":"Chicago Illinois USA","acronym":"KDD' 13","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 19th ACM SIGKDD international conference on Knowledge discovery and data mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487645","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2487575.2487645","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T08:48:44Z","timestamp":1750236524000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2487575.2487645"}},"subtitle":["extracting optimal quasi-cliques with quality guarantees"],"short-title":[],"issued":{"date-parts":[[2013,8,11]]},"references-count":33,"alternative-id":["10.1145\/2487575.2487645","10.1145\/2487575"],"URL":"https:\/\/doi.org\/10.1145\/2487575.2487645","relation":{},"subject":[],"published":{"date-parts":[[2013,8,11]]},"assertion":[{"value":"2013-08-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}