{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,14]],"date-time":"2026-03-14T21:37:01Z","timestamp":1773524221153,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":12,"publisher":"ACM","license":[{"start":{"date-parts":[[2018,10,17]],"date-time":"2018-10-17T00:00:00Z","timestamp":1539734400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSFC","award":["61802345"],"award-info":[{"award-number":["61802345"]}]},{"name":"NSFC","award":["61672235"],"award-info":[{"award-number":["61672235"]}]},{"name":"YFB","award":["2018YFB1003504"],"award-info":[{"award-number":["2018YFB1003504"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2018,10,17]]},"DOI":"10.1145\/3269206.3269254","type":"proceedings-article","created":{"date-parts":[[2018,10,22]],"date-time":"2018-10-22T12:08:27Z","timestamp":1540210107000},"page":"1667-1670","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":36,"title":["K-core Minimization"],"prefix":"10.1145","author":[{"given":"Weijie","family":"Zhu","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chen","family":"Chen","sequence":"additional","affiliation":[{"name":"East China Normal University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[{"name":"Zhejiang Gongshang University, Hangzhou, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xuemin","family":"Lin","sequence":"additional","affiliation":[{"name":"The University of New South Wales, Sydney, Australia"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2018,10,17]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1038\/35019019"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1137\/14097032X"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2903148"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"crossref","unstructured":"Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations . 85--103.  Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In Complexity of Computer Computations . 85--103.","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_3_2_1_5_1","unstructured":"Elias Boutros Khalil Bistra Dilkina and Le Song. 2014. Scalable Diffusion-aware Optimization of Network Topology. In KDD.  Elias Boutros Khalil Bistra Dilkina and Le Song. 2014. Scalable Diffusion-aware Optimization of Network Topology. In KDD."},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2004.59"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-014-0800-9"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/0378-8733(83)90028-X"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"crossref","unstructured":"Dong Wen Lu Qin Ying Zhang Xuemin Lin and Jeffrey Xu Yu. 2016. I\/O efficient Core Graph Decomposition at web scale. In ICDE.  Dong Wen Lu Qin Ying Zhang Xuemin Lin and Jeffrey Xu Yu. 2016. I\/O efficient Core Graph Decomposition at web scale. In ICDE.","DOI":"10.1109\/ICDE.2016.7498235"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055332"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Fan Zhang Ying Zhang Lu Qin Wenjie Zhang and Xuemin Lin. 2017a. Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.. In AAAI.  Fan Zhang Ying Zhang Lu Qin Wenjie Zhang and Xuemin Lin. 2017a. Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem.. In AAAI.","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2016.2605088"}],"event":{"name":"CIKM '18: The 27th ACM International Conference on Information and Knowledge Management","location":"Torino Italy","acronym":"CIKM '18","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web","SIGIR ACM Special Interest Group on Information Retrieval"]},"container-title":["Proceedings of the 27th ACM International Conference on Information and Knowledge Management"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269254","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3269206.3269254","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T00:44:20Z","timestamp":1750207460000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3269206.3269254"}},"subtitle":["An Edge Manipulation Approach"],"short-title":[],"issued":{"date-parts":[[2018,10,17]]},"references-count":12,"alternative-id":["10.1145\/3269206.3269254","10.1145\/3269206"],"URL":"https:\/\/doi.org\/10.1145\/3269206.3269254","relation":{},"subject":[],"published":{"date-parts":[[2018,10,17]]},"assertion":[{"value":"2018-10-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}