{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T02:33:13Z","timestamp":1780367593822,"version":"3.54.1"},"publisher-location":"New York, NY, USA","reference-count":16,"publisher":"ACM","license":[{"start":{"date-parts":[[2023,7,15]],"date-time":"2023-07-15T00:00:00Z","timestamp":1689379200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100017052","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62203477"],"award-info":[{"award-number":["62203477"]}],"id":[{"id":"10.13039\/100017052","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Guangdong Basic and Applied Basic Research Foundation","award":["2021A1515110543"],"award-info":[{"award-number":["2021A1515110543"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2023,7,15]]},"DOI":"10.1145\/3583133.3590615","type":"proceedings-article","created":{"date-parts":[[2023,7,24]],"date-time":"2023-07-24T23:30:33Z","timestamp":1690241433000},"page":"119-122","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["A Memetic Algorithm to solve the Robust Influence Maximization Problems against Cascading Failures"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-5316-6850","authenticated-orcid":false,"given":"Shun","family":"Cai","sequence":"first","affiliation":[{"name":"Sun Yat-sen University, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1796-7280","authenticated-orcid":false,"given":"Shuai","family":"Wang","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0009-0003-4645-637X","authenticated-orcid":false,"given":"Zhaoxi","family":"Ou","sequence":"additional","affiliation":[{"name":"Sun Yat-sen University, Shenzhen, China"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2023,7,24]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Statistical mechanics of complex networks. Reviews of modern physics 74, 1","author":"Albert R\u00e9ka","year":"2002","unstructured":"R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si . 2002. Statistical mechanics of complex networks. Reviews of modern physics 74, 1 ( 2002 ), 47. R\u00e9ka Albert and Albert-L\u00e1szl\u00f3 Barab\u00e1si. 2002. Statistical mechanics of complex networks. Reviews of modern physics 74, 1 (2002), 47."},{"key":"e_1_3_2_1_2_1","volume-title":"Emergence of scaling in random networks. science 286, 5439","author":"Barab\u00e1si Albert-L\u00e1szl\u00f3","year":"1999","unstructured":"Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert . 1999. Emergence of scaling in random networks. science 286, 5439 ( 1999 ), 509--512. Albert-L\u00e1szl\u00f3 Barab\u00e1si and R\u00e9ka Albert. 1999. Emergence of scaling in random networks. science 286, 5439 (1999), 509--512."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31204-0_25"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/2939672.2939745"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557047"},{"key":"e_1_3_2_1_6_1","volume-title":"Cascading failures in complex infrastructure systems. Structural safety 31, 2","author":"Duenas-Osorio Leonardo","year":"2009","unstructured":"Leonardo Duenas-Osorio and Srivishnu Mohan Vemuru . 2009. Cascading failures in complex infrastructure systems. Structural safety 31, 2 ( 2009 ), 157--167. Leonardo Duenas-Osorio and Srivishnu Mohan Vemuru. 2009. Cascading failures in complex infrastructure systems. Structural safety 31, 2 (2009), 157--167."},{"key":"e_1_3_2_1_7_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos Paul","year":"1960","unstructured":"Paul Erdos , Alfr\u00e9d R\u00e9nyi , 1960 . On the evolution of random graphs . Publ. Math. Inst. Hung. Acad. Sci 5 , 1 (1960), 17 -- 60 . Paul Erdos, Alfr\u00e9d R\u00e9nyi, et al. 1960. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5, 1 (1960), 17--60.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.3390\/s22062191"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v25i1.7838"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/956750.956769"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/2567948.2580063"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1281192.1281239"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2018.11.005"},{"key":"e_1_3_2_1_14_1","first-page":"1153","article-title":"A Memetic algorithm for solving the robust influence maximization problem towards network structural perturbances","volume":"44","author":"Wang Shuai","year":"2021","unstructured":"Shuai Wang and Jing Liu . 2021 . A Memetic algorithm for solving the robust influence maximization problem towards network structural perturbances . Chinese Journal of Computers 44 , 6 (2021), 1153 -- 1167 . Shuai Wang and Jing Liu. 2021. A Memetic algorithm for solving the robust influence maximization problem towards network structural perturbances. Chinese Journal of Computers 44, 6 (2021), 1153--1167.","journal-title":"Chinese Journal of Computers"},{"key":"e_1_3_2_1_15_1","volume-title":"Finding influential nodes in multiplex networks using a memetic algorithm","author":"Wang Shuai","year":"2019","unstructured":"Shuai Wang , Jing Liu , and Yaochu Jin . 2019. Finding influential nodes in multiplex networks using a memetic algorithm . IEEE transactions on cybernetics 51, 2 ( 2019 ), 900--912. Shuai Wang, Jing Liu, and Yaochu Jin. 2019. Finding influential nodes in multiplex networks using a memetic algorithm. IEEE transactions on cybernetics 51, 2 (2019), 900--912."},{"key":"e_1_3_2_1_16_1","volume-title":"Collective dynamics of 'small-world'networks. nature 393, 6684","author":"Watts Duncan J","year":"1998","unstructured":"Duncan J Watts and Steven H Strogatz . 1998. Collective dynamics of 'small-world'networks. nature 393, 6684 ( 1998 ), 440--442. Duncan J Watts and Steven H Strogatz. 1998. Collective dynamics of 'small-world'networks. nature 393, 6684 (1998), 440--442."}],"event":{"name":"GECCO '23 Companion: Companion Conference on Genetic and Evolutionary Computation","location":"Lisbon Portugal","acronym":"GECCO '23 Companion","sponsor":["SIGEVO ACM Special Interest Group on Genetic and Evolutionary Computation"]},"container-title":["Proceedings of the Companion Conference on Genetic and Evolutionary Computation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590615","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3583133.3590615","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:37:45Z","timestamp":1750178265000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3583133.3590615"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,7,15]]},"references-count":16,"alternative-id":["10.1145\/3583133.3590615","10.1145\/3583133"],"URL":"https:\/\/doi.org\/10.1145\/3583133.3590615","relation":{},"subject":[],"published":{"date-parts":[[2023,7,15]]},"assertion":[{"value":"2023-07-24","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}