{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T11:07:36Z","timestamp":1778843256004,"version":"3.51.4"},"reference-count":56,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-017"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-012"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2026,4,1]],"date-time":"2026-04-01T00:00:00Z","timestamp":1775001600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-004"}],"funder":[{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["KJ2021A0059"],"award-info":[{"award-number":["KJ2021A0059"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100003995","name":"Natural Science Foundation of Anhui Province","doi-asserted-by":"publisher","award":["2408085QF210"],"award-info":[{"award-number":["2408085QF210"]}],"id":[{"id":"10.13039\/501100003995","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62473001"],"award-info":[{"award-number":["62473001"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"publisher","award":["62503006"],"award-info":[{"award-number":["62503006"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Swarm and Evolutionary Computation"],"published-print":{"date-parts":[[2026,4]]},"DOI":"10.1016\/j.swevo.2026.102363","type":"journal-article","created":{"date-parts":[[2026,3,17]],"date-time":"2026-03-17T04:15:04Z","timestamp":1773720904000},"page":"102363","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["HIDE-EA: An Influence Decaying Estimation-based Evolutionary Algorithm for Hypergraph Dynamic Influence Maximization"],"prefix":"10.1016","volume":"104","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6682-2651","authenticated-orcid":false,"given":"Xian-Jie","family":"Zhang","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4525-2776","authenticated-orcid":false,"given":"Zhong-Kui","family":"Bao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ye","family":"Tian","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huan","family":"Wang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7094-669X","authenticated-orcid":false,"given":"Hai-Feng","family":"Zhang","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/j.swevo.2026.102363_b1","doi-asserted-by":"crossref","DOI":"10.1016\/j.eswa.2024.125990","article-title":"A theoretical review on multiplex influence maximization models: Theories, methods, challenges, and future directions","volume":"266","author":"Achour","year":"2025","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2026.102363_b2","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2023.101424","article-title":"Alternate solutions for influence maximization: Beyond theoretical approximation by the genetic algorithm framework","volume":"83","author":"NasehiMoghaddam","year":"2023","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102363_b3","first-page":"10","article-title":"Influencer marketing as emerging promotional tool in modern era and opportunities to uprising sales","volume":"1","author":"Mishra","year":"2022","journal-title":"Int. J. Emerg. Res. Eng. Sci. Manag."},{"issue":"4","key":"10.1016\/j.swevo.2026.102363_b4","doi-asserted-by":"crossref","first-page":"619","DOI":"10.1016\/j.pubrev.2018.07.004","article-title":"Examining multiplicity and dynamics of publics\u2019 crisis narratives with large-scale Twitter data","volume":"44","author":"Zhao","year":"2018","journal-title":"Public Relations Rev."},{"issue":"1","key":"10.1016\/j.swevo.2026.102363_b5","doi-asserted-by":"crossref","DOI":"10.1016\/j.pubrev.2024.102532","article-title":"How social media influencers support political parties in achieving campaign objectives, according to political communicators in Germany","volume":"51","author":"Borchers","year":"2025","journal-title":"Public Relations Rev."},{"key":"10.1016\/j.swevo.2026.102363_b6","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2025.112956","article-title":"Multiplex network influence maximization based on representation learning method","volume":"174","author":"Zhang","year":"2025","journal-title":"Appl. Soft Comput."},{"key":"10.1016\/j.swevo.2026.102363_b7","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101542","article-title":"Finding robust and influential nodes on directed networks using a memetic algorithm","volume":"87","author":"Ou","year":"2024","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102363_b8","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2025.113406","article-title":"Pruning-enabled dynamic influence maximization using antlion optimization","volume":"317","author":"Meena","year":"2025","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.swevo.2026.102363_b9","doi-asserted-by":"crossref","unstructured":"D. Kempe, J. Kleinberg, \u00c9. Tardos, Maximizing the spread of influence through a social network, in: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2003, pp. 137\u2013146.","DOI":"10.1145\/956750.956769"},{"key":"10.1016\/j.swevo.2026.102363_b10","doi-asserted-by":"crossref","unstructured":"J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, N. Glance, Cost-effective outbreak detection in networks, in: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2007, pp. 420\u2013429.","DOI":"10.1145\/1281192.1281239"},{"key":"10.1016\/j.swevo.2026.102363_b11","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.physa.2014.10.088","article-title":"SMG: Fast scalable greedy algorithm for influence maximization in social networks","volume":"420","author":"Heidari","year":"2015","journal-title":"Phys. A"},{"issue":"1","key":"10.1016\/j.swevo.2026.102363_b12","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1080\/0022250X.1972.9989806","article-title":"Factoring and weighting approaches to status scores and clique identification","volume":"2","author":"Bonacich","year":"1972","journal-title":"J. Math. Sociol."},{"key":"10.1016\/j.swevo.2026.102363_b13","series-title":"2011 IEEE 11th International Conference on Data Mining","first-page":"211","article-title":"Simpath: An efficient algorithm for influence maximization under the linear threshold model","author":"Goyal","year":"2011"},{"key":"10.1016\/j.swevo.2026.102363_b14","doi-asserted-by":"crossref","unstructured":"W. Chen, Y. Wang, S. Yang, Efficient influence maximization in social networks, in: Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2009, pp. 199\u2013208.","DOI":"10.1145\/1557019.1557047"},{"key":"10.1016\/j.swevo.2026.102363_b15","doi-asserted-by":"crossref","first-page":"158","DOI":"10.1016\/j.swevo.2018.02.003","article-title":"Finding influential users for different time bounds in social networks using multi-objective optimization","volume":"40","author":"Mohammadi","year":"2018","journal-title":"Swarm Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102363_b16","doi-asserted-by":"crossref","DOI":"10.1109\/TEVC.2025.3577643","article-title":"Evolutionary hypergraph learning: A multi-objective influence maximization approach considering seed selection costs","author":"Qu","year":"2025","journal-title":"IEEE Trans. Evol. Comput."},{"key":"10.1016\/j.swevo.2026.102363_b17","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2024.104038","article-title":"IMUNE: A novel evolutionary algorithm for influence maximization in uav networks","volume":"233","author":"Chen","year":"2025","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.swevo.2026.102363_b18","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2025.130828","article-title":"Probing for high influential nodes in social networks via a co-evolutionary memetic algorithm","volume":"675","author":"Tang","year":"2025","journal-title":"Phys. A","ISSN":"https:\/\/id.crossref.org\/issn\/0378-4371","issn-type":"print"},{"key":"10.1016\/j.swevo.2026.102363_b19","series-title":"A universal meta-heuristic framework for influence maximization in hypergraphs","author":"Xie","year":"2023"},{"key":"10.1016\/j.swevo.2026.102363_b20","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2024.101609","article-title":"IMNE: Maximizing influence through deep learning-based node embedding in social network","volume":"88","author":"Hu","year":"2024","journal-title":"Swarm Evol. Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102363_b21","doi-asserted-by":"crossref","first-page":"1288","DOI":"10.1109\/TCSS.2022.3164667","article-title":"PIANO: Influence maximization meets deep reinforcement learning","volume":"10","author":"Li","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.swevo.2026.102363_b22","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121764","article-title":"Influence maximization in hypergraphs based on evolutionary deep reinforcement learning","volume":"698","author":"Xu","year":"2025","journal-title":"Inform. Sci."},{"issue":"2","key":"10.1016\/j.swevo.2026.102363_b23","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2022.103161","article-title":"An efficient adaptive degree-based heuristic algorithm for influence maximization in hypergraphs","volume":"60","author":"Xie","year":"2023","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.swevo.2026.102363_b24","doi-asserted-by":"crossref","unstructured":"S. Cheng, H. Shen, J. Huang, W. Chen, X. Cheng, Imrank: influence maximization via finding self-consistent ranking, in: Proceedings of the 37th International ACM SIGIR Conference on Research & Development in Information Retrieval, 2014, pp. 475\u2013484.","DOI":"10.1145\/2600428.2609592"},{"issue":"3","key":"10.1016\/j.swevo.2026.102363_b25","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103683","article-title":"Influence maximization on hypergraphs via multi-hop influence estimation","volume":"61","author":"Gong","year":"2024","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.swevo.2026.102363_b26","series-title":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","first-page":"132","article-title":"Maximizing time-decaying influence in social networks","author":"Ohsaka","year":"2016"},{"issue":"2","key":"10.1016\/j.swevo.2026.102363_b27","doi-asserted-by":"crossref","first-page":"1461","DOI":"10.1109\/TNET.2023.3323028","article-title":"Tracking influencers in decaying social activity streams with theoretical guarantees","volume":"32","author":"Zhao","year":"2023","journal-title":"IEEE\/ACM Trans. Netw."},{"key":"10.1016\/j.swevo.2026.102363_b28","article-title":"Deadline-aware misinformation prevention in social networks with time-decaying influence","volume":"238","author":"Yang","year":"2024","journal-title":"Expert Syst. Appl."},{"key":"10.1016\/j.swevo.2026.102363_b29","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2019.100614","article-title":"Identifying influential nodes based on ant colony optimization to maximize profit in social networks","volume":"51","author":"Salavati","year":"2019","journal-title":"Swarm Evol. Comput."},{"issue":"1","key":"10.1016\/j.swevo.2026.102363_b30","doi-asserted-by":"crossref","first-page":"262","DOI":"10.1109\/TETC.2024.3403891","article-title":"Fair influence maximization in social networks: A community-based evolutionary algorithm","volume":"13","author":"Ma","year":"2025","journal-title":"IEEE Trans. Emerg. Top. Comput."},{"key":"10.1016\/j.swevo.2026.102363_b31","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2025.116078","article-title":"Influence maximization based on bottom-up community merging","volume":"193","author":"Zhao","year":"2025","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.swevo.2026.102363_b32","doi-asserted-by":"crossref","DOI":"10.1016\/j.asoc.2023.111037","article-title":"Influence maximization in social networks using discretized harris\u2019 hawks optimization algorithm","volume":"149","author":"Khatri","year":"2023","journal-title":"Appl. Soft Comput."},{"issue":"3","key":"10.1016\/j.swevo.2026.102363_b33","doi-asserted-by":"crossref","DOI":"10.1016\/j.ipm.2024.103681","article-title":"Hcckshell: A heterogeneous cross-comparison improved kshell algorithm for influence maximization","volume":"61","author":"Li","year":"2024","journal-title":"Inf. Process. Manage."},{"key":"10.1016\/j.swevo.2026.102363_b34","doi-asserted-by":"crossref","DOI":"10.1016\/j.neunet.2024.106649","article-title":"Deep graph representation learning for influence maximization with accelerated inference","volume":"180","author":"Chowdhury","year":"2024","journal-title":"Neural Netw."},{"key":"10.1016\/j.swevo.2026.102363_b35","doi-asserted-by":"crossref","first-page":"1617","DOI":"10.1016\/j.ins.2022.06.075","article-title":"Influence maximization in social networks using graph embedding and graph neural network","volume":"607","author":"Kumar","year":"2022","journal-title":"Inform. Sci."},{"key":"10.1016\/j.swevo.2026.102363_b36","doi-asserted-by":"crossref","DOI":"10.1016\/j.chaos.2023.113888","article-title":"Influence maximization in hypergraphs: A self-optimizing algorithm based on electrostatic field","volume":"174","author":"Li","year":"2023","journal-title":"Chaos Solitons Fractals"},{"key":"10.1016\/j.swevo.2026.102363_b37","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121816","article-title":"Efficient hypergraph collective influence maximization in cascading processes based on general threshold model","volume":"700","author":"Qu","year":"2025","journal-title":"Inform. Sci."},{"issue":"4","key":"10.1016\/j.swevo.2026.102363_b38","doi-asserted-by":"crossref","first-page":"801","DOI":"10.1109\/TNSE.2018.2873759","article-title":"Social influence maximization in hypergraph in social networks","volume":"6","author":"Zhu","year":"2018","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.swevo.2026.102363_b39","doi-asserted-by":"crossref","DOI":"10.1016\/j.physa.2025.130361","article-title":"Deep reinforcement learning-based influence maximization for heterogeneous hypergraphs","volume":"660","author":"Sun","year":"2025","journal-title":"Phys. A"},{"key":"10.1016\/j.swevo.2026.102363_b40","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109173","article-title":"Knowledge guided Bayesian classification for dynamic multi-objective optimization","volume":"250","author":"Ye","year":"2022","journal-title":"Knowl.-Based Syst.","ISSN":"https:\/\/id.crossref.org\/issn\/0950-7051","issn-type":"print"},{"key":"10.1016\/j.swevo.2026.102363_b41","doi-asserted-by":"crossref","DOI":"10.1016\/j.swevo.2025.102002","article-title":"Probing the fitness landscape of the influential nodes for the influence maximization problem in social networks","volume":"97","author":"Tang","year":"2025","journal-title":"Swarm Evol. Comput.","ISSN":"https:\/\/id.crossref.org\/issn\/2210-6502","issn-type":"print"},{"key":"10.1016\/j.swevo.2026.102363_b42","first-page":"1","article-title":"An adaptive steering-vector-based evolutionary algorithm for influence maximization in social networks","author":"Zhang","year":"2025","journal-title":"IEEE Trans. Netw. Sci. Eng."},{"key":"10.1016\/j.swevo.2026.102363_b43","article-title":"An improved influence maximization method for social networks based on genetic algorithm","volume":"586","author":"Lotf","year":"2022","journal-title":"Phys. A"},{"key":"10.1016\/j.swevo.2026.102363_b44","doi-asserted-by":"crossref","DOI":"10.1016\/j.ins.2024.121784","article-title":"SADPEA: Structure-aware dual probability evolutionary adaptive algorithm for the budgeted influence maximization problem","volume":"699","author":"Zhu","year":"2025","journal-title":"Inform. Sci.","ISSN":"https:\/\/id.crossref.org\/issn\/0020-0255","issn-type":"print"},{"issue":"5","key":"10.1016\/j.swevo.2026.102363_b45","doi-asserted-by":"crossref","first-page":"2385","DOI":"10.1109\/TCSS.2022.3189036","article-title":"A search space reduction-based progressive evolutionary algorithm for influence maximization in social networks","volume":"10","author":"Zhang","year":"2022","journal-title":"IEEE Trans. Comput. Soc. Syst."},{"key":"10.1016\/j.swevo.2026.102363_b46","doi-asserted-by":"crossref","DOI":"10.1016\/j.knosys.2022.109856","article-title":"An improved clustering based multi-objective evolutionary algorithm for influence maximization under variable-length solutions","volume":"256","author":"Biswas","year":"2022","journal-title":"Knowl.-Based Syst."},{"key":"10.1016\/j.swevo.2026.102363_b47","doi-asserted-by":"crossref","DOI":"10.1016\/j.jnca.2020.102973","article-title":"LIDDE: A differential evolution algorithm based on local-influence-descending search strategy for influence maximization in social networks","volume":"178","author":"Qiu","year":"2021","journal-title":"J. Netw. Comput. Appl."},{"key":"10.1016\/j.swevo.2026.102363_b48","series-title":"2023 IEEE International Conference on Systems, Man, and Cybernetics","first-page":"783","article-title":"Influence maximization with reverse influence sampling and evolutionary algorithm","author":"Du","year":"2023"},{"key":"10.1016\/j.swevo.2026.102363_b49","series-title":"International Conference on Parallel Problem Solving from Nature","first-page":"217","article-title":"Influence maximization in hypergraphs using multi-objective evolutionary algorithms","author":"Genetti","year":"2024"},{"issue":"28","key":"10.1016\/j.swevo.2026.102363_b50","doi-asserted-by":"crossref","first-page":"eabh1303","DOI":"10.1126\/sciadv.abh1303","article-title":"Generative hypergraph clustering: From blockmodels to modularity","volume":"7","author":"Chodrow","year":"2021","journal-title":"Sci. Adv."},{"key":"10.1016\/j.swevo.2026.102363_b51","series-title":"Fair clustering for diverse and experienced groups","author":"Amburg","year":"2020"},{"issue":"48","key":"10.1016\/j.swevo.2026.102363_b52","doi-asserted-by":"crossref","first-page":"E11221","DOI":"10.1073\/pnas.1800683115","article-title":"Simplicial closure and higher-order link prediction","volume":"115","author":"Benson","year":"2018","journal-title":"Proc. Natl. Acad. Sci."},{"key":"10.1016\/j.swevo.2026.102363_b53","series-title":"Hypergraph clustering using Ricci curvature: an edge transport perspective","author":"Hacquard","year":"2024"},{"issue":"D1","key":"10.1016\/j.swevo.2026.102363_b54","doi-asserted-by":"crossref","first-page":"D515","DOI":"10.1093\/nar\/gkv1049","article-title":"Bigg models: A platform for integrating, standardizing and sharing genome-scale models","volume":"44","author":"King","year":"2016","journal-title":"Nucleic Acids Res."},{"key":"10.1016\/j.swevo.2026.102363_b55","series-title":"Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms","first-page":"946","article-title":"Maximizing social influence in nearly optimal time","author":"Borgs","year":"2014"},{"issue":"7563","key":"10.1016\/j.swevo.2026.102363_b56","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1038\/nature14604","article-title":"Influence maximization in complex networks through optimal percolation","volume":"524","author":"Morone","year":"2015","journal-title":"Nature"}],"container-title":["Swarm and Evolutionary Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226000830?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S2210650226000830?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2026,5,15]],"date-time":"2026-05-15T10:15:05Z","timestamp":1778840105000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S2210650226000830"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,4]]},"references-count":56,"alternative-id":["S2210650226000830"],"URL":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102363","relation":{},"ISSN":["2210-6502"],"issn-type":[{"value":"2210-6502","type":"print"}],"subject":[],"published":{"date-parts":[[2026,4]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"HIDE-EA: An Influence Decaying Estimation-based Evolutionary Algorithm for Hypergraph Dynamic Influence Maximization","name":"articletitle","label":"Article Title"},{"value":"Swarm and Evolutionary Computation","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.swevo.2026.102363","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2026 Elsevier B.V. All rights are reserved, including those for text and data mining, AI training, and similar technologies.","name":"copyright","label":"Copyright"}],"article-number":"102363"}}