{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T08:59:53Z","timestamp":1775638793565,"version":"3.50.1"},"publisher-location":"Republic and Canton of Geneva, Switzerland","reference-count":41,"publisher":"International World Wide Web Conferences Steering Committee","license":[{"start":{"date-parts":[[2015,5,18]],"date-time":"2015-05-18T00:00:00Z","timestamp":1431907200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"MIUR","award":["PRIN Ars TechnoMedia"],"award-info":[{"award-number":["PRIN Ars TechnoMedia"]}]},{"name":"Google Inc","award":["Google Europe Ph.D. Fellowship in Algorithms 2011"],"award-info":[{"award-number":["Google Europe Ph.D. Fellowship in Algorithms 2011"]}]},{"name":"Google Inc","award":["Google Focused Award"],"award-info":[{"award-number":["Google Focused Award"]}]},{"name":"NSF","award":["NSF Award IIS-1247581"],"award-info":[{"award-number":["NSF Award IIS-1247581"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2015,5,18]]},"DOI":"10.1145\/2736277.2741638","type":"proceedings-article","created":{"date-parts":[[2016,2,5]],"date-time":"2016-02-05T20:37:12Z","timestamp":1454704632000},"page":"300-310","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":92,"title":["Efficient Densest Subgraph Computation in Evolving Graphs"],"prefix":"10.1145","author":[{"given":"Alessandro","family":"Epasto","sequence":"first","affiliation":[{"name":"Brown University, Providence, RI, USA"}]},{"given":"Silvio","family":"Lattanzi","sequence":"additional","affiliation":[{"name":"Google, inc, New York, NY, USA"}]},{"given":"Mauro","family":"Sozio","sequence":"additional","affiliation":[{"name":"Institut Mines-T\u00e9l\u00e9com,T\u00e9l\u00e9com ParisTech, CNRS LTCI, Paris, Paris, France"}]}],"member":"320","published-online":{"date-parts":[[2015,5,18]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"DBLP dataset (October 2014). http:\/\/dblp.uni-trier.de\/xml\/.  DBLP dataset (October 2014). http:\/\/dblp.uni-trier.de\/xml\/."},{"key":"e_1_3_2_1_2_1","unstructured":"Last.fm song network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/lastfm_song.  Last.fm song network dataset - KONECT. http:\/\/konect.uni-koblenz.de\/networks\/lastfm_song."},{"key":"e_1_3_2_1_3_1","unstructured":"Yahoo! Answers browsing behavior version 1.0. - Yahoo! Research Webscope Datasets. http:\/\/webscope.sandbox.yahoo.com.  Yahoo! Answers browsing behavior version 1.0. - Yahoo! Research Webscope Datasets. http:\/\/webscope.sandbox.yahoo.com."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_5_1","author":"Aksu H.","year":"2014","unstructured":"H. Aksu , M. Canim , Y.-C. Chang , I. Korpeoglu , and O. Ulusoy . Distributed k-core view materialization and maintenance for large dynamic graphs. IEEE Trans. Knowledge and Data Eng. , 2014 . H. Aksu, M. Canim, Y.-C. Chang, I. Korpeoglu, and O. Ulusoy. Distributed k-core view materialization and maintenance for large dynamic graphs. IEEE Trans. Knowledge and Data Eng., 2014.","journal-title":"IEEE Trans. Knowledge and Data Eng."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_8_1","volume-title":"Manuscript","author":"Bahmani B.","year":"2012","unstructured":"B. Bahmani , A. Goel , and K. Munagala . Efficient primal-dual algorithms for mapreduce . Manuscript , 2012 . B. Bahmani, A. Goel, and K. Munagala. Efficient primal-dual algorithms for mapreduce. Manuscript, 2012."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339539"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_1_12_1","volume-title":"STOC, (to appear)","author":"Bhattacharya S.","year":"2015","unstructured":"S. Bhattacharya , M. Henzinger , D. Nanongkai , and C. E. Tsourakakis . Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams . In STOC, (to appear) , 2015 . S. Bhattacharya, M. Henzinger, D. Nanongkai, and C. E. Tsourakakis. Space- and Time-Efficient Algorithm for Maintaining Dense Subgraphs on One-Pass Dynamic Streams. In STOC, (to appear), 2015."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92695-5_4"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1341531.1341547"},{"key":"e_1_3_2_1_15_1","volume-title":"Music recommendation and discovery in the long tail. Technical report","author":"Herrada Celma","year":"2009","unstructured":"\u00d2. Celma Herrada . Music recommendation and discovery in the long tail. Technical report , 2009 . \u00d2. Celma Herrada. Music recommendation and discovery in the long tail. Technical report, 2009."},{"key":"e_1_3_2_1_16_1","volume-title":"Approximation Algorithms for Combinatorial Optimization.","author":"Charikar M.","year":"2000","unstructured":"M. Charikar . Greedy approximation algorithms for finding dense components in a graph . In Approximation Algorithms for Combinatorial Optimization. 2000 . M. Charikar. Greedy approximation algorithms for finding dense components in a graph. In Approximation Algorithms for Combinatorial Optimization. 2000."},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539702403098"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_1_20_1","volume-title":"VLBD","author":"Gibson D.","year":"2005","unstructured":"D. Gibson , R. Kumar , and A. Tomkins . Discovering large dense subgraphs in massive graphs . In VLBD , 2005 . D. Gibson, R. Kumar, and A. Tomkins. Discovering large dense subgraphs in massive graphs. In VLBD, 2005."},{"key":"e_1_3_2_1_21_1","volume-title":"UC Berkeley","author":"Goldberg A. V.","year":"1984","unstructured":"A. V. Goldberg . Finding a maximum density subgraph . UC Berkeley , 1984 . A. V. Goldberg. Finding a maximum density subgraph. UC Berkeley, 1984."},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.3386\/w8498"},{"key":"e_1_3_2_1_23_1","volume-title":"Algorithms and Theory of Computation Handbook","author":"Italiano G. F.","year":"1999","unstructured":"G. F. Italiano , D. Eppstein , and Z. Galil . Dynamic graph algorithms . Algorithms and Theory of Computation Handbook , 1999 . G. F. Italiano, D. Eppstein, and Z. Galil. Dynamic graph algorithms. Algorithms and Theory of Computation Handbook, 1999."},{"key":"e_1_3_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559930"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-02927-1_50"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1150402.1150476"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1016\/S1389-1286(99)00040-7"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661829.2661859"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-6045-0_10"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1217299.1217301"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1080\/15427951.2008.10129299"},{"key":"e_1_3_2_1_33_1","series-title":"SIAM Monographs on discrete mathematics and applications","volume-title":"Distributed computing","author":"Peleg D.","year":"2000","unstructured":"D. Peleg . Distributed computing . SIAM Monographs on discrete mathematics and applications , 2000 . D. Peleg. Distributed computing. SIAM Monographs on discrete mathematics and applications, 2000."},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-12683-3_30"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-33651-5_11"},{"key":"e_1_3_2_1_38_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman S. B.","year":"1983","unstructured":"S. B. Seidman . Network structure and minimum degree. Social networks , 1983 . S. B. Seidman. Network structure and minimum degree. Social networks, 1983."},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_14"}],"event":{"name":"WWW '15: 24th International World Wide Web Conference","location":"Florence Italy","acronym":"WWW '15","sponsor":["IW3C2 International World Wide Web Conference Committee","SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the 24th International Conference on World Wide Web"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741638","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2736277.2741638","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:12:29Z","timestamp":1750227149000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2736277.2741638"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,5,18]]},"references-count":41,"alternative-id":["10.1145\/2736277.2741638","10.5555\/2736277"],"URL":"https:\/\/doi.org\/10.1145\/2736277.2741638","relation":{},"subject":[],"published":{"date-parts":[[2015,5,18]]},"assertion":[{"value":"2015-05-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}