{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T04:57:03Z","timestamp":1790744223089,"version":"4.1.0"},"publisher-location":"New York, NY, USA","reference-count":40,"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"}],"funder":[{"DOI":"10.13039\/501100002920","name":"Research Grants Council, University Grants Committee","doi-asserted-by":"publisher","award":["17200214, 17217716"],"award-info":[{"award-number":["17200214, 17217716"]}],"id":[{"id":"10.13039\/501100002920","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,11,6]]},"DOI":"10.1145\/3132847.3132907","type":"proceedings-article","created":{"date-parts":[[2017,11,6]],"date-time":"2017-11-06T13:30:29Z","timestamp":1509975029000},"page":"929-938","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Maintaining Densest Subsets Efficiently in Evolving Hypergraphs"],"prefix":"10.1145","author":[{"given":"Shuguang","family":"Hu","sequence":"first","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Xiaowei","family":"Wu","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"T-H. Hubert","family":"Chan","sequence":"additional","affiliation":[{"name":"University of Hong Kong, Hong Kong, Hong Kong"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"CiteULike tag-publication network dataset -- KONECT. (Oct","year":"2016"},{"key":"e_1_3_2_1_2_1","unstructured":"2016. DBLP dataset. (2016). http:\/\/dblp.uni-trier.de\/xml\/  2016. DBLP dataset. (2016). http:\/\/dblp.uni-trier.de\/xml\/"},{"key":"e_1_3_2_1_3_1","volume-title":"YouTube network dataset -- KONECT. (Oct","year":"2016"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.14778\/2168651.2168658"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1186\/1471-2105-4-2"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.14778\/2140436.2140442"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2684822.2685298"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806719"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"crossref","volume-title":"Polynomial integrality gaps for strong SDP relaxations of Densest k-subgraph","author":"Bhaskara Aditya","DOI":"10.1137\/1.9781611973099.34"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746592"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/2623330.2623655"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.60"},{"key":"e_1_3_2_1_14_1","volume-title":"Zhihao Gavin Tang, and Chenzi Zhang","author":"Chan TH","year":"2016"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.5555\/646688.702972"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"},{"key":"e_1_3_2_1_17_1","volume-title":"APPROX-RANDOM (LIPIcs)","volume":"60","author":"Chlamt\u00e1c Eden","year":"2016"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1513876.1513879"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2736277.2741638"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/2935764.2935813"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1093\/bioinformatics\/btl243"},{"key":"e_1_3_2_1_22_1","unstructured":"David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB. ACM 721--732.   David Gibson Ravi Kumar and Andrew Tomkins. 2005. Discovering Large Dense Subgraphs in Massive Graphs. In VLDB. ACM 721--732."},{"key":"e_1_3_2_1_23_1","volume-title":"Finding a maximum density subgraph","author":"Goldberg Andrew V"},{"key":"e_1_3_2_1_24_1","volume-title":"Non-uniform Evolving Hypergraphs and Weighted Evolving Hypergraphs. Scientific Reports 6","author":"Guo Jin-Li","year":"2016"},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539705447037"},{"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\/1217299.1217301"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1145\/2746539.2746555"},{"key":"e_1_3_2_1_30_1","volume-title":"Vu","author":"McGregor Andrew","year":"2015"},{"key":"e_1_3_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1145\/2896384"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2783258.2783385"},{"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-33651-5_11"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835923"},{"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","doi-asserted-by":"publisher","DOI":"10.1145\/2487575.2487645"},{"key":"e_1_3_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-31235-9_14"},{"key":"e_1_3_2_1_40_1","unstructured":"Vladimir Kolmogorov Yuri Boykov. 2015. MAXFLOW - software for computing mincut\/maxflow in a graph. (2015). https:\/\/github.com\/gerddie\/maxflow  Vladimir Kolmogorov Yuri Boykov. 2015. MAXFLOW - software for computing mincut\/maxflow in a graph. (2015). https:\/\/github.com\/gerddie\/maxflow"}],"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.3132907","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3132847.3132907","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T02:13:45Z","timestamp":1750212825000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3132847.3132907"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,11,6]]},"references-count":40,"alternative-id":["10.1145\/3132847.3132907","10.1145\/3132847"],"URL":"https:\/\/doi.org\/10.1145\/3132847.3132907","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"}}]}}