{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T22:36:20Z","timestamp":1778279780063,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2024,5,13]],"date-time":"2024-05-13T00:00:00Z","timestamp":1715558400000},"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":[[2024,5,13]]},"DOI":"10.1145\/3589334.3645465","type":"proceedings-article","created":{"date-parts":[[2024,5,8]],"date-time":"2024-05-08T07:08:13Z","timestamp":1715152093000},"page":"606-617","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Optimizing Network Resilience via Vertex Anchoring"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-1210-4672","authenticated-orcid":false,"given":"Siyi","family":"Teng","sequence":"first","affiliation":[{"name":"Guangzhou University & Chinese University of Hong Kong, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4535-8359","authenticated-orcid":false,"given":"Jiadong","family":"Xie","sequence":"additional","affiliation":[{"name":"Chinese University of Hong Kong, Shatin, Hong Kong"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0548-0130","authenticated-orcid":false,"given":"Fan","family":"Zhang","sequence":"additional","affiliation":[{"name":"Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7334-2875","authenticated-orcid":false,"given":"Can","family":"Lu","sequence":"additional","affiliation":[{"name":"Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3769-1496","authenticated-orcid":false,"given":"Juntao","family":"Fang","sequence":"additional","affiliation":[{"name":"Guangzhou University, Guangzhou, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3123-2184","authenticated-orcid":false,"given":"Kai","family":"Wang","sequence":"additional","affiliation":[{"name":"ACEM, Shanghai Jiao Tong University, Shanghai, China"}]}],"member":"320","published-online":{"date-parts":[[2024,5,13]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Error and attack tolerance of complex networks. nature","author":"Albert R\u00e9ka","year":"2000","unstructured":"R\u00e9ka Albert, Hawoong Jeong, and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2000. Error and attack tolerance of complex networks. nature, Vol. 406, 6794 (2000), 378--382."},{"key":"e_1_3_2_2_2_1","volume-title":"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)."},{"key":"e_1_3_2_2_3_1","volume-title":"An introduction to road vulnerability: what has been done, is done and should be done. Transport policy","author":"Berdica Katja","year":"2002","unstructured":"Katja Berdica. 2002. An introduction to road vulnerability: what has been done, is done and should be done. Transport policy, Vol. 9, 2 (2002), 117--127."},{"key":"e_1_3_2_2_4_1","volume-title":"Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications","author":"Beygelzimer Alina","year":"2005","unstructured":"Alina Beygelzimer, Geoffrey Grinstein, Ralph Linsker, and Irina Rish. 2005. Improving network robustness by edge modification. Physica A: Statistical Mechanics and its Applications, Vol. 357, 3--4 (2005), 593--612."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/14097032X"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1051\/ita\/2016022"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"crossref","unstructured":"Chen Chen Ruiyue Peng Lei Ying and Hanghang Tong. 2018. Network Connectivity Optimization: Fundamental Limits and Effective Algorithms. In KDD. ACM 1167--1176.","DOI":"10.1145\/3219819.3220019"},{"key":"e_1_3_2_2_8_1","volume-title":"Golovach","author":"Chitnis Rajesh Hemant","year":"2013","unstructured":"Rajesh Hemant Chitnis, Fedor V. Fomin, and Petr A. Golovach. 2013. Preventing Unraveling in Social Networks Gets Harder. In AAAI. AAAI Press."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1534"},{"key":"e_1_3_2_2_10_1","article-title":"Greedily Improving Our Own Closeness Centrality in a Network","volume":"11","author":"Crescenzi Pierluigi","year":"2016","unstructured":"Pierluigi Crescenzi, Gianlorenzo D'Angelo, Lorenzo Severini, and Yllka Velaj. 2016. Greedily Improving Our Own Closeness Centrality in a Network. ACM Trans. Knowl. Discov. Data , Vol. 11, 1 (2016), 9:1--9:32.","journal-title":"ACM Trans. Knowl. Discov. Data"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Yizhou Dai Miao Qiao and Lijun Chang. 2022. Anchored Densest Subgraph. In SIGMOD. ACM 1200--1213.","DOI":"10.1145\/3514221.3517890"},{"key":"e_1_3_2_2_12_1","volume-title":"Sourav Medya, and Arlei Silva.","author":"Dey Palash","year":"2021","unstructured":"Palash Dey, Suman Kalyan Maity, Sourav Medya, and Arlei Silva. 2021. Network Robustness via Global k-cores. In AAMAS. 438--446."},{"key":"e_1_3_2_2_13_1","volume-title":"Kooij","author":"Ellens Wendy","year":"2013","unstructured":"Wendy Ellens and Robert E. Kooij. 2013. Graph measures and network robustness. CoRR , Vol. abs\/1311.5064 (2013)."},{"key":"e_1_3_2_2_14_1","volume-title":"Graph Vulnerability and Robustness: A Survey","author":"Freitas Scott","year":"2022","unstructured":"Scott Freitas, Diyi Yang, Srijan Kumar, Hanghang Tong, and Duen Horng Chau. 2022. Graph Vulnerability and Robustness: A Survey. IEEE TKDE (2022)."},{"key":"e_1_3_2_2_15_1","volume-title":"Conference on Online Social Networks. 39--50","author":"David Garc'i","year":"2013","unstructured":"David Garc'i a, Pavlin Mavrodiev, and Frank Schweitzer. 2013. Social resilience in online communities: the autopsy of friendster. In Conference on Online Social Networks. 39--50."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"crossref","unstructured":"Qintian Guo Sibo Wang Zhewei Wei and Ming Chen. 2020. Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened. In SIGMOD. 2167--2181.","DOI":"10.1145\/3318464.3389740"},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1137\/0110037"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.14778\/2850578.2850580"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"crossref","unstructured":"David Kempe Jon M. Kleinberg and \u00c9 va Tardos. 2003. Maximizing the spread of influence through a social network. In KDD. ACM 137--146.","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-31955-9_15"},{"key":"e_1_3_2_2_21_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-21711-5"},{"key":"e_1_3_2_2_22_1","unstructured":"J\u00e9r\u00f4me Kunegis. [n. d.]. The KONECT Project. http:\/\/konect.cc\/."},{"key":"e_1_3_2_2_23_1","unstructured":"Jure Leskovec and Andrej Krevl. 2014. SNAP Datasets: Stanford Large Network Dataset Collection. http:\/\/snap.stanford.edu\/data."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"crossref","unstructured":"Qingyuan Linghu Fan Zhang Xuemin Lin Wenjie Zhang and Ying Zhang. 2020. Global Reinforcement of Social Networks: The Anchored Coreness Problem. In SIGMOD. 2211--2226.","DOI":"10.1145\/3318464.3389744"},{"key":"e_1_3_2_2_25_1","volume-title":"An Efficient Algorithm for the Anchored k-Core Budget Minimization Problem","author":"Liu Kaixin","unstructured":"Kaixin Liu, Sibo Wang, Yong Zhang, and Chunxiao Xing. 2021. An Efficient Algorithm for the Anchored k-Core Budget Minimization Problem. In ICDE. IEEE, 1356--1367."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"crossref","unstructured":"Fragkiskos D Malliaros and Michalis Vazirgiannis. 2013. To stay or not to stay: modeling engagement dynamics in social graphs. In CIKM. 469--478.","DOI":"10.1145\/2505515.2505561"},{"key":"e_1_3_2_2_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/2402.322385"},{"key":"e_1_3_2_2_28_1","volume-title":"Singh","author":"Medya Sourav","year":"2020","unstructured":"Sourav Medya, Tiyani Ma, Arlei Silva, and Ambuj K. Singh. 2020. A Game Theoretic Approach For Core Resilience. In IJCAI. ijcai.org, 3473--3479."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.3390\/math9080895"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.14778\/3021924.3021927"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.14778\/3275536.3275540"},{"key":"e_1_3_2_2_32_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."},{"key":"e_1_3_2_2_33_1","volume-title":"The collapse of the Friendster network started from the center of the core","author":"Seki Kazunori","unstructured":"Kazunori Seki and Masataka Nakamura. 2016. The collapse of the Friendster network started from the center of the core. In ASONAM. IEEE Computer Society, 477--484."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1007\/s13278-017-0429-2"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"crossref","unstructured":"Youze Tang Yanchen Shi and Xiaokui Xiao. 2015. Influence Maximization in Near-Linear Time: A Martingale Approach. In SIGMOD. 1539--1554.","DOI":"10.1145\/2723372.2723734"},{"key":"e_1_3_2_2_36_1","volume-title":"Dynamic importance of network nodes is poorly predicted by static structural features. Physica A: Statistical Mechanics and its Applications","author":"van Elteren Casper","year":"2022","unstructured":"Casper van Elteren, Rick Quax, and Peter Sloot. 2022. Dynamic importance of network nodes is poorly predicted by static structural features. Physica A: Statistical Mechanics and its Applications (2022), 126889."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.14778\/3648160.3648171"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE55515.2023.00066"},{"key":"e_1_3_2_2_39_1","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. In KDD. ACM.","DOI":"10.1145\/3580305.3599480"},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-021-00905-3"},{"key":"e_1_3_2_2_41_1","doi-asserted-by":"publisher","DOI":"10.14778\/3055330.3055332"},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v31i1.10482"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.14778\/3461535.3461536"},{"key":"e_1_3_2_2_44_1","first-page":"456","article-title":"Finding Critical Users in Social Communities via Graph Convolutions","volume":"35","author":"Zhao Kangfei","year":"2023","unstructured":"Kangfei Zhao, Zhiwei Zhang, Yu Rong, Jeffrey Xu Yu, and Junzhou Huang. 2023. Finding Critical Users in Social Communities via Graph Convolutions. IEEE Trans. Knowl. Data Eng. , Vol. 35, 1 (2023), 456--468.","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1145\/3269206.3269254"}],"event":{"name":"WWW '24: The ACM Web Conference 2024","location":"Singapore Singapore","acronym":"WWW '24","sponsor":["SIGWEB ACM Special Interest Group on Hypertext, Hypermedia, and Web"]},"container-title":["Proceedings of the ACM Web Conference 2024"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645465","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3589334.3645465","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,22]],"date-time":"2025-08-22T00:24:14Z","timestamp":1755822254000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3589334.3645465"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,13]]},"references-count":45,"alternative-id":["10.1145\/3589334.3645465","10.1145\/3589334"],"URL":"https:\/\/doi.org\/10.1145\/3589334.3645465","relation":{},"subject":[],"published":{"date-parts":[[2024,5,13]]},"assertion":[{"value":"2024-05-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}