{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,19]],"date-time":"2026-03-19T04:41:21Z","timestamp":1773895281187,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":33,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T00:00:00Z","timestamp":1509926400000},"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":[[2017,11,6]]},"DOI":"10.1145\/3132847.3132966","type":"proceedings-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T13:30:29Z","timestamp":1509975029000},"page":"1817-1826","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":15,"title":["Fully Dynamic Algorithm for Top-\n            <i>k<\/i>\n            Densest Subgraphs"],"prefix":"10.1145","author":[{"given":"Muhammad Anis Uddin","family":"Nasir","sequence":"first","affiliation":[{"name":"Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aristides","family":"Gionis","sequence":"additional","affiliation":[{"name":"Aalto University, Espoo, Finland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gianmarco De Francisci","family":"Morales","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute, Doha, Qatar"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sarunas","family":"Girdzijauskas","sequence":"additional","affiliation":[{"name":"Royal Institute of Technology, Stockholm, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2463676.2465315"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Yuichi Asahiro Kazuo Iwama Hisao Tamaki and Takeshi Tokuyama. 1996. Greedily finding a dense subgraph. In SWAT. 136--148.   Yuichi Asahiro Kazuo Iwama Hisao Tamaki and Takeshi Tokuyama. 1996. Greedily finding a dense subgraph. In SWAT. 136--148.","DOI":"10.1007\/3-540-61422-2_127"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/543613.543615"},{"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\/2684822.2685298"},{"key":"e_1_3_2_1_7_1","volume-title":"arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488400"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","unstructured":"Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Approx. Algo. for Comb. Opt. 84--95.   Moses Charikar. 2000. Greedy approximation algorithms for finding dense components in a graph. In Approx. Algo. for Comb. Opt. 84--95.","DOI":"10.1007\/3-540-44436-X_10"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_12_1","volume-title":"Dynamic graphs in the sliding-window model","author":"Crouch Michael S."},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398363"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242635"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_16_1","volume-title":"Italiano","author":"Eppstein David","year":"1998"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10618-016-0464-z"},{"key":"e_1_3_2_1_18_1","unstructured":"David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In VLDB. VLDB Endowment 721--732.   David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering large dense subgraphs in massive graphs. In VLDB. VLDB Endowment 721--732."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2789987"},{"key":"e_1_3_2_1_20_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1994.1032"},{"key":"e_1_3_2_1_22_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014).  Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data. (June 2014)."},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2013.158"},{"key":"e_1_3_2_1_24_1","volume-title":"Vu","author":"McGregor Andrew","year":"2015"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/2488608.2488705"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623674"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.14778\/2536336.2536344"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2339530.2339722"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741119"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_14"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-013-0693-z"}],"event":{"name":"CIKM '17: ACM Conference on Information and Knowledge Management","location":"Singapore Singapore","acronym":"CIKM '17","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 2017 ACM on Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3132966","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3132966","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:46Z","timestamp":1750212826000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3132966"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":33,"alternative-id":["10.1145\/3132847.3132966","10.1145\/3132847"],"URL":"https:\/\/doi.org\/10.1145\/3132847.3132966","relation":{},"subject":[],"published":{"date-parts":[[2017,11,6]]},"assertion":[{"value":"2017-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}