{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T05:05:46Z","timestamp":1750309546156,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":37,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T00:00:00Z","timestamp":1745280000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["12071478, 61972404"],"award-info":[{"award-number":["12071478, 61972404"]}],"id":[{"id":"10.13039\/https:\/\/doi.org\/10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,4,22]]},"DOI":"10.1145\/3696410.3714838","type":"proceedings-article","created":{"date-parts":[[2025,4,22]],"date-time":"2025-04-22T22:52:18Z","timestamp":1745362338000},"page":"1316-1330","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Coreness Maximization through Budget-Limited Edge Insertion"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6544-1515","authenticated-orcid":false,"given":"Xiaowei","family":"Lv","sequence":"first","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9949-9451","authenticated-orcid":false,"given":"Xiaojia","family":"Xu","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4197-2258","authenticated-orcid":false,"given":"Yongcai","family":"Wang","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0009-0009-5748-0141","authenticated-orcid":false,"given":"Haoyu","family":"Liu","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7748-5427","authenticated-orcid":false,"given":"Deying","family":"Li","sequence":"additional","affiliation":[{"name":"School of Information, Renmin University of China, Beijing, China"}]}],"member":"320","published-online":{"date-parts":[[2025,4,22]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Large scale networks fingerprinting and visualization using the k-core decomposition. Advances in neural information processing systems","author":"Alvarez-Hamelin J","year":"2005","unstructured":"J Alvarez-Hamelin, Luca Dall'Asta, Alain Barrat, and Alessandro Vespignani. 2005. Large scale networks fingerprinting and visualization using the k-core decomposition. Advances in neural information processing systems, Vol. 18 (2005)."},{"key":"e_1_3_2_1_2_1","volume-title":"An automated method for finding molecular complexes in large protein interaction networks. BMC bioinformatics","author":"Bader Gary D","year":"2003","unstructured":"Gary D Bader and Christopher WV Hogue. 2003. An automated method for finding molecular complexes in large protein interaction networks. BMC bioinformatics, Vol. 4, 1 (2003), 1--27."},{"key":"e_1_3_2_1_3_1","volume-title":"An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049","author":"Batagelj Vladimir","year":"2003","unstructured":"Vladimir Batagelj and Matjaz Zaversnik. 2003. An o (m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_4_1","DOI":"10.1137\/14097032X"},{"key":"e_1_3_2_1_5_1","volume-title":"Graph structure in the web. Computer networks","author":"Broder Andrei","year":"2000","unstructured":"Andrei Broder, Ravi Kumar, Farzin Maghoul, Prabhakar Raghavan, Sridhar Rajagopalan, Raymie Stata, Andrew Tomkins, and Janet Wiener. 2000. Graph structure in the web. Computer networks, Vol. 33, 1--6 (2000), 309--320."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_6_1","DOI":"10.1109\/ICDE.2019.00241"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_7_1","DOI":"10.1145\/2043652.2043654"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_8_1","DOI":"10.1007\/978-3-319-90530-3_8"},{"key":"e_1_3_2_1_9_1","volume-title":"Trusses: Cohesive subgraphs for social network analysis. National security agency technical report","author":"Cohen Jonathan","year":"2008","unstructured":"Jonathan Cohen. 2008. Trusses: Cohesive subgraphs for social network analysis. National security agency technical report, Vol. 16, 3.1 (2008)."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_10_1","DOI":"10.1007\/s10618-023-00958-0"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_11_1","DOI":"10.1145\/1513876.1513879"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_12_1","DOI":"10.14778\/3055330.3055337"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_13_1","DOI":"10.1007\/s00778-019-00556-x"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_14_1","DOI":"10.1145\/285055.285059"},{"key":"e_1_3_2_1_15_1","volume-title":"Jianliang Xu, and HV Jagadish.","author":"Huang Xin","year":"2019","unstructured":"Xin Huang, Laks VS Lakshmanan, Jianliang Xu, and HV Jagadish. 2019. Community search over big graphs. Vol. 14. Springer."},{"unstructured":"Richard M. Karp. 1972. Reducibility Among Combinatorial Problems. In 50 Years of Integer Programming. https:\/\/api.semanticscholar.org\/CorpusID:33509266","key":"e_1_3_2_1_16_1"},{"key":"e_1_3_2_1_17_1","volume-title":"Identification of influential spreaders in complex networks. Nature physics","author":"Kitsak Maksim","year":"2010","unstructured":"Maksim Kitsak, Lazaros K Gallos, Shlomo Havlin, Fredrik Liljeros, Lev Muchnik, H Eugene Stanley, and Hern\u00e1n A Makse. 2010. Identification of influential spreaders in complex networks. Nature physics, Vol. 6, 11 (2010), 888--893."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_18_1","DOI":"10.1137\/1.9781611976236.37"},{"unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data.","key":"e_1_3_2_1_19_1"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_20_1","DOI":"10.1016\/j.physleta.2014.09.054"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_21_1","DOI":"10.1145\/3318464.3389744"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_22_1","DOI":"10.1007\/s00778-021-00673-6"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_23_1","DOI":"10.1007\/s00265-003-0651-y"},{"key":"e_1_3_2_1_24_1","volume-title":"Locating influential nodes in complex networks. Scientific reports","author":"Malliaros Fragkiskos D","year":"2016","unstructured":"Fragkiskos D Malliaros, Maria-Evgenia G Rossi, and Michalis Vazirgiannis. 2016. Locating influential nodes in complex networks. Scientific reports, Vol. 6, 1 (2016), 19307."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_25_1","DOI":"10.1145\/2505515.2505561"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_26_1","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_1_27_1","volume-title":"Ahmed","author":"Rossi Ryan A.","year":"2015","unstructured":"Ryan A. Rossi and Nesreen K. Ahmed. 2015. The Network Data Repository with Interactive Graph Analytics and Visualization. In AAAI. https:\/\/networkrepository.com"},{"key":"e_1_3_2_1_28_1","volume-title":"Network structure and minimum degree. Social networks","author":"Seidman Stephen B","year":"1983","unstructured":"Stephen B Seidman. 1983. Network structure and minimum degree. Social networks, Vol. 5, 3 (1983), 269--287."},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_29_1","DOI":"10.5555\/3192424.3192513"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_30_1","DOI":"10.14778\/3523210.3523214"},{"doi-asserted-by":"crossref","unstructured":"Siyi Teng Jiadong Xie Fan Zhang Can Lu Juntao Fang and Kai Wang. 2024. Optimizing Network Resilience via Vertex Anchoring. (2024).","key":"e_1_3_2_1_31_1","DOI":"10.1145\/3589334.3645465"},{"doi-asserted-by":"crossref","unstructured":"Fan Zhang Qingyuan Linghu Jiadong Xie Kai Wang Xuemin Lin and Wenjie Zhang. 2023. Quantifying Node Importance over Network Structural Stability. (2023).","key":"e_1_3_2_1_32_1","DOI":"10.1145\/3580305.3599480"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_33_1","DOI":"10.14778\/3055330.3055332"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_34_1","DOI":"10.1109\/ICDE.2018.00057"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_35_1","DOI":"10.1145\/2247596.2247652"},{"doi-asserted-by":"crossref","unstructured":"Zhongxin Zhou Fan Zhang Xuemin Lin Wenjie Zhang and Chen Chen. 2019. K-Core Maximization: An Edge Addition Approach.. In IJCAI. 4867--4873.","key":"e_1_3_2_1_36_1","DOI":"10.24963\/ijcai.2019\/676"},{"doi-asserted-by":"publisher","key":"e_1_3_2_1_37_1","DOI":"10.1007\/s11280-021-00907-1"}],"event":{"sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"],"acronym":"WWW '25","name":"WWW '25: The ACM Web Conference 2025","location":"Sydney NSW Australia"},"container-title":["Proceedings of the ACM on Web Conference 2025"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714838","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3696410.3714838","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T01:18:42Z","timestamp":1750295922000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3696410.3714838"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,4,22]]},"references-count":37,"alternative-id":["10.1145\/3696410.3714838","10.1145\/3696410"],"URL":"https:\/\/doi.org\/10.1145\/3696410.3714838","relation":{},"subject":[],"published":{"date-parts":[[2025,4,22]]},"assertion":[{"value":"2025-04-22","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}