{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,2]],"date-time":"2026-07-02T02:29:40Z","timestamp":1782959380798,"version":"3.54.5"},"reference-count":228,"publisher":"Association for Computing Machinery (ACM)","issue":"2","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2026,2,28]]},"abstract":"<jats:p>Influence maximization (IM) is a key problem in social network analysis, with numerous applications in areas such as viral marketing, advertising, public health, and more. Current surveys in IM primarily focus on traditional algorithms while overlooking leading advanced IM algorithms such as signed IM, fairness-enabled IM, and diversity-based IM. This survey paper seeks to address the existing gap by providing a thorough review of both classical and advanced IM algorithms. It discusses classical techniques like simulation-based, path-based, and so on, and mainly focuses on recent advanced IM algorithms. In this detailed discussion of advanced algorithms, the work analyzes various aspects, including complexity, network types, properties (monotonicity, sub-modularity), diffusion models, and comparative algorithms, along with their advantages and disadvantages. This work includes an analysis of classical and advanced algorithms, as well as experimental evaluations of 20 state-of-the-art algorithms across 10 datasets. The chosen state-of-the-art algorithms utilize various approaches like simulation-based, evolutionary-based, fairness-based, and path-based methods. This work also addresses the challenges associated with IM and highlights emerging trends and future directions. Overall, this survey serves as a comprehensive guide to the latest developments in IM while proposing new avenues for future research in this field.<\/jats:p>","DOI":"10.1145\/3779058","type":"journal-article","created":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T07:00:02Z","timestamp":1764572402000},"page":"1-50","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":3,"title":["Exploring Influence Maximization: State-of-the-Art Methods, Taxonomies, and Trends"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-7623-7712","authenticated-orcid":false,"given":"Sunil Kumar","family":"Meena","sequence":"first","affiliation":[{"name":"Department of Computer Science, University of Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0909-2258","authenticated-orcid":false,"given":"Shashank Sheshar","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering, Faculty of Engineering and Technology, South Asian University, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5289-362X","authenticated-orcid":false,"given":"Kuldeep","family":"Singh","sequence":"additional","affiliation":[{"name":"Department of Computer Science, University of Delhi, New Delhi, India"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2026,1,13]]},"reference":[{"key":"e_1_3_2_2_2","doi-asserted-by":"crossref","first-page":"2437","DOI":"10.1007\/s00607-021-00945-7","article-title":"A survey on meta-heuristic algorithms for the influence maximization problem in the social networks","volume":"103","author":"Aghaee Zahra","year":"2021","unstructured":"Zahra Aghaee, Mohammad Mahdi Ghasemi, Hamid Ahmadi Beni, Asgarali Bouyer, and Afsaneh Fatemi. 2021. A survey on meta-heuristic algorithms for the influence maximization problem in the social networks. Computing 103 (2021), 2437\u20132477.","journal-title":"Computing"},{"issue":"3","key":"e_1_3_2_3_2","first-page":"2875","article-title":"On the fairness of time-critical influence maximization in social networks","volume":"35","author":"Ali Junaid","year":"2023","unstructured":"Junaid Ali, Mahmoudreza Babaei, Abhijnan Chakraborty, Baharan Mirzasoleiman, Krishna P. Gummadi, and Adish Singla. 2023. On the fairness of time-critical influence maximization in social networks. IEEE Transactions on Knowledge and Data Engineering 35, 3 (2023), 2875\u20132886.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_4_2","first-page":"395","volume-title":"Proceedings of the 2018 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI)","author":"Ali Khurshed","year":"2018","unstructured":"Khurshed Ali, Chih-Yu Wang, and Yi-Shin Chen. 2018. Boosting reinforcement learning in competitive influence maximization with transfer learning. In Proceedings of the 2018 IEEE\/WIC\/ACM International Conference on Web Intelligence (WI), 395\u2013400."},{"key":"e_1_3_2_5_2","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1142\/S0218488522400220","article-title":"A new fuzzy propagation model for influence maximization in social networks","volume":"30","author":"Aliahmadipour Laya","year":"2023","unstructured":"Laya Aliahmadipour and Ezat Valipour. 2023. A new fuzzy propagation model for influence maximization in social networks. International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems 30 (Jan. 2023), 279\u2013292.","journal-title":"International Journal of Uncertainty, Fuzziness and Knowledge-Based Systems"},{"key":"e_1_3_2_6_2","first-page":"41","volume-title":"Advances in Neural Information Processing Systems","author":"Alvarez-Hamelin Jos\u00e9","year":"2005","unstructured":"Jos\u00e9 Alvarez-Hamelin, Luca Dall\u2019 Asta, Alain Barrat, and Alessandro Vespignani. 2005. Large scale networks fingerprinting and visualization using the k-core decomposition. In Advances in Neural Information Processing Systems. Yair Weiss, Bernhard Sch\u00f6lkopf, and John Platt (Eds.), Vol. 18, MIT Press, 41\u201350."},{"issue":"9","key":"e_1_3_2_7_2","doi-asserted-by":"crossref","first-page":"1623","DOI":"10.1287\/mnsc.1110.1421","article-title":"Creating social contagion through viral product design: A randomized trial of peer influence in networks","volume":"57","author":"Aral Sinan","year":"2011","unstructured":"Sinan Aral and Dylan Walker. 2011. Creating social contagion through viral product design: A randomized trial of peer influence in networks. Management Science 57, 9 (2011), 1623\u20131639.","journal-title":"Management Science"},{"key":"e_1_3_2_8_2","doi-asserted-by":"crossref","first-page":"651","DOI":"10.1145\/3035918.3035924","volume-title":"Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD \u201917)","author":"Arora Akhil","year":"2017","unstructured":"Akhil Arora, Sainyam Galhotra, and Sayan Ranu. 2017. Debunking the myths of influence maximization: An in-depth benchmarking study. In Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD \u201917), ACM, New York, NY, 651\u2013666."},{"issue":"7779","key":"e_1_3_2_9_2","doi-asserted-by":"crossref","first-page":"505","DOI":"10.1038\/s41586-019-1666-5","article-title":"Quantum supremacy using a programmable superconducting processor","volume":"574","author":"Arute Frank","year":"2019","unstructured":"Frank Arute, Kunal Arya, Ryan Babbush, Dave Bacon, Joseph C. Bardin, Rami Barends, Rupak Biswas, Sergio Boixo, Fernando G. S. L. Brandao, David A. Buell, et al. 2019. Quantum supremacy using a programmable superconducting processor. Nature 574, 7779 (2019), 505\u2013510.","journal-title":"Nature"},{"key":"e_1_3_2_10_2","doi-asserted-by":"crossref","first-page":"2435","DOI":"10.1007\/s12652-019-01286-2","article-title":"A fuzzy logic approach to influence maximization in social networks","volume":"11","author":"Atif Yacine","year":"2020","unstructured":"Yacine Atif, Kanna Al-Falahi, Tshering Wangchuk, and Birgitta Lindstr\u00f6m. 2020. A fuzzy logic approach to influence maximization in social networks. Journal of Ambient Intelligence and Humanized Computing 11 (2020), 2435\u20132451.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"issue":"5","key":"e_1_3_2_11_2","doi-asserted-by":"crossref","first-page":"2231","DOI":"10.1016\/j.jksuci.2020.08.004","article-title":"Influence propagation in social networks: Interest-based community ranking model","volume":"34","author":"Abd Al-Azim Nouran Ayman R.","year":"2022","unstructured":"Nouran Ayman R. Abd Al-Azim, Tarek F. Gharib, Mohamed Hamdy, and Yasmine Afify. 2022. Influence propagation in social networks: Interest-based community ranking model. Journal of King Saud University - Computer and Information Sciences 34, 5 (2022), 2231\u20132243.","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"e_1_3_2_12_2","doi-asserted-by":"crossref","first-page":"100393","DOI":"10.1016\/j.cosrev.2021.100393","article-title":"New trends in influence maximization models","volume":"40","author":"Azaouzi Mehdi","year":"2021","unstructured":"Mehdi Azaouzi, Wassim Mnasri, and Lotfi Ben Romdhane. 2021. New trends in influence maximization models. Computer Science Review 40 (2021), 100393.","journal-title":"Computer Science Review"},{"issue":"18","key":"e_1_3_2_13_2","first-page":"674","article-title":"The mathematical theory of infectious diseases and its applications","volume":"1","author":"Bailey Norman T. J.","year":"1976","unstructured":"Norman T. J. Bailey. 1976. The mathematical theory of infectious diseases and its applications. Medical Journal of Australia 1, 18 (1976), 674\u2013674.","journal-title":"Medical Journal of Australia"},{"key":"e_1_3_2_14_2","doi-asserted-by":"crossref","first-page":"3417","DOI":"10.1007\/s10115-020-01461-4","article-title":"A survey on influence maximization in a social network","volume":"62","author":"Banerjee Suman","year":"2020","unstructured":"Suman Banerjee, Mamata Jenamani, and Dilip Kumar Pratihar. 2020. A survey on influence maximization in a social network. Knowledge and Information Systems 62 (2020), 3417\u20133455.","journal-title":"Knowledge and Information Systems"},{"issue":"3","key":"e_1_3_2_15_2","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/s00607-021-00987-x","article-title":"An approximate marginal spread computation approach for the budgeted influence maximization with delay","volume":"104","author":"Banerjee Suman","year":"2022","unstructured":"Suman Banerjee, Mamata Jenamani, and Dilip Kumar Pratihar. 2022. An approximate marginal spread computation approach for the budgeted influence maximization with delay. Computing 104, 3 (2022), 657\u2013680.","journal-title":"Computing"},{"key":"e_1_3_2_16_2","doi-asserted-by":"crossref","first-page":"141","DOI":"10.1007\/978-3-030-62005-9_11","volume-title":"Web Information Systems Engineering \u2013 WISE 2020","author":"Banerjee Suman","year":"2020","unstructured":"Suman Banerjee, Bithika Pal, and Mamata Jenamani. 2020. Budgeted influence maximization with tags in social networks. In Web Information Systems Engineering \u2013 WISE 2020. Zhisheng Huang, Wouter Beek, Hua Wang, Rui Zhou, and Yanchun Zhang (Eds.), Springer International Publishing, Cham, 141\u2013152."},{"key":"e_1_3_2_17_2","doi-asserted-by":"crossref","first-page":"547","DOI":"10.1007\/s100510050067","article-title":"On the properties of small-world network models","volume":"13","author":"Barrat Alain","year":"2000","unstructured":"Alain Barrat and Martin Weigt. 2000. On the properties of small-world network models. The European Physical Journal B 13 (2000), 547\u2013560.","journal-title":"The European Physical Journal B"},{"key":"e_1_3_2_18_2","doi-asserted-by":"crossref","first-page":"1251","DOI":"10.1613\/jair.1.13367","article-title":"Fairness in influence maximization through randomization","volume":"73","author":"Becker Ruben","year":"2022","unstructured":"Ruben Becker, Gianlorenzo D\u2019angelo, Sajjad Ghobadi, and Hugo Gilbert. 2022. Fairness in influence maximization through randomization. Journal of Artificial Intelligence Research 73 (2022), 1251\u20131283.","journal-title":"Journal of Artificial Intelligence Research"},{"key":"e_1_3_2_19_2","first-page":"119","article-title":"TI-SC: Top-k influential nodes selection based on community detection and scoring criteria in social networks","volume":"11","author":"Beni Hamid Ahmadi","year":"2018","unstructured":"Hamid Ahmadi Beni and Asgarali Bouyer. 2018. TI-SC: Top-k influential nodes selection based on community detection and scoring criteria in social networks. Journal of Ambient Intelligence and Humanized Computing 11 (2018), 119\u2013130.","journal-title":"Journal of Ambient Intelligence and Humanized Computing"},{"issue":"2","key":"e_1_3_2_20_2","doi-asserted-by":"crossref","first-page":"403","DOI":"10.1007\/s00778-021-00679-0","article-title":"A fractional memory-efficient approach for online continuous-time influence maximization","volume":"31","author":"Bevilacqua Glenn S.","year":"2022","unstructured":"Glenn S. Bevilacqua and Laks V. S. Lakshmanan. 2022. A fractional memory-efficient approach for online continuous-time influence maximization. The VLDB Journal 31, 2 (2022), 403\u2013429.","journal-title":"The VLDB Journal"},{"issue":"9","key":"e_1_3_2_21_2","doi-asserted-by":"crossref","first-page":"1498","DOI":"10.14778\/3397230.3397244","article-title":"Efficient algorithms for budgeted influence maximization on massive social networks","volume":"13","author":"Bian Song","year":"2020","unstructured":"Song Bian, Qintian Guo, Sibo Wang, and Jeffrey Xu Yu. 2020. Efficient algorithms for budgeted influence maximization on massive social networks. Proceedings of the VLDB Endowment 13, 9 (May 2020), 1498\u20131510.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_22_2","doi-asserted-by":"crossref","first-page":"27","DOI":"10.1016\/j.ins.2020.12.048","article-title":"An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks","volume":"556","author":"Biswas Tarun K.","year":"2021","unstructured":"Tarun K. Biswas, Alireza Abbasi, and Ripon K. Chakrabortty. 2021. An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks. Information Sciences 556 (2021), 27\u201348.","journal-title":"Information Sciences"},{"issue":"10","key":"e_1_3_2_23_2","doi-asserted-by":"crossref","first-page":"P10008","DOI":"10.1088\/1742-5468\/2008\/10\/P10008","article-title":"Fast unfolding of communities in large networks","volume":"2008","author":"Blondel Vincent D.","year":"2008","unstructured":"Vincent D. Blondel, Jean-Loup Guillaume, Renaud Lambiotte, and Etienne Lefebvre. 2008. Fast unfolding of communities in large networks. Journal of Statistical Mechanics: Theory and Experiment 2008, 10 (Oct. 2008), P10008.","journal-title":"Journal of Statistical Mechanics: Theory and Experiment"},{"issue":"7415","key":"e_1_3_2_24_2","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1038\/nature11421","article-title":"A 61-million-person experiment in social influence and political mobilization","volume":"489","author":"Bond Robert M.","year":"2012","unstructured":"Robert M. Bond, Christopher J. Fariss, Jason J. Jones, Adam D. I. Kramer, Cameron Marlow, Jaime E. Settle, and James H. Fowler. 2012. A 61-million-person experiment in social influence and political mobilization. Nature 489, 7415 (2012), 295\u2013298.","journal-title":"Nature"},{"issue":"3","key":"e_1_3_2_25_2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1177\/0021886303258111","article-title":"Ethical and strategic issues in organizational social network analysis","volume":"39","author":"Borgatti Stephen P.","year":"2003","unstructured":"Stephen P. Borgatti and Jos\u00e9 Luis Molina. 2003. Ethical and strategic issues in organizational social network analysis. The Journal of Applied Behavioral Science 39, 3 (2003), 337\u2013349.","journal-title":"The Journal of Applied Behavioral Science"},{"key":"e_1_3_2_26_2","first-page":"946","volume-title":"Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"Borgs Christian","year":"2014","unstructured":"Christian Borgs, Michael Brautbar, Jennifer Chayes, and Brendan Lucier. 2014. Maximizing social influence in nearly optimal time. In Proceedings of the 2014 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), 946\u2013957."},{"issue":"2","key":"e_1_3_2_27_2","doi-asserted-by":"crossref","first-page":"174","DOI":"10.1109\/TEVC.2003.810761","article-title":"The balance between proximity and diversity in multiobjective evolutionary algorithms","volume":"7","author":"Bosman Peter A. N.","year":"2003","unstructured":"Peter A. N. Bosman and Dirk Thierens. 2003. The balance between proximity and diversity in multiobjective evolutionary algorithms. IEEE Transactions on Evolutionary Computation 7, 2 (2003), 174\u2013188.","journal-title":"IEEE Transactions on Evolutionary Computation"},{"key":"e_1_3_2_28_2","doi-asserted-by":"crossref","first-page":"118869","DOI":"10.1016\/j.eswa.2022.118869","article-title":"FIP: A fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networks","volume":"213","author":"Bouyer Asgarali","year":"2023","unstructured":"Asgarali Bouyer, Hamid Ahmadi Beni, Bahman Arasteh, Zahra Aghaee, and Reza Ghanbarzadeh. 2023. FIP: A fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networks. Expert Systems with Applications 213 (2023), 118869.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_29_2","doi-asserted-by":"crossref","first-page":"126841","DOI":"10.1016\/j.physa.2021.126841","article-title":"Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networks","volume":"592","author":"Bouyer Asgarali","year":"2022","unstructured":"Asgarali Bouyer and Hamid Ahmadi Beni. 2022. Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networks. Physica A: Statistical Mechanics and Its Applications 592 (2022), 126841.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"issue":"2","key":"e_1_3_2_30_2","doi-asserted-by":"crossref","first-page":"1011","DOI":"10.1007\/s10115-023-01983-7","article-title":"Identifying influential nodes based on new layer metrics and layer weighting in multiplex networks","volume":"66","author":"Bouyer Asgarali","year":"2024","unstructured":"Asgarali Bouyer, Moslem Mohammadi, and Bahman Arasteh. 2024. Identifying influential nodes based on new layer metrics and layer weighting in multiplex networks. Knowledge and Information Systems 66, 2 (2024), 1011\u20131035.","journal-title":"Knowledge and Information Systems"},{"key":"e_1_3_2_31_2","unstructured":"Taotao Cai Quan Z. Sheng Xiangyu Song Jian Yang Shuang Wang Wei Emma Zhang Jia Wu and Philip S. Yu. 2022. A survey on location-driven influence maximization. arXiv:2204.08005. Retrieved from https:\/\/arxiv.org\/abs\/2204.08005"},{"key":"e_1_3_2_32_2","doi-asserted-by":"crossref","first-page":"1273","DOI":"10.1016\/j.ins.2020.08.093","article-title":"Attribute based diversification of seeds for targeted influence maximization","volume":"546","author":"Cali\u00f2 Antonio","year":"2021","unstructured":"Antonio Cali\u00f2 and Andrea Tagarelli. 2021. Attribute based diversification of seeds for targeted influence maximization. Information Sciences 546 (2021), 1273\u20131305.","journal-title":"Information Sciences"},{"key":"e_1_3_2_33_2","doi-asserted-by":"crossref","first-page":"100167","DOI":"10.1016\/j.osnem.2021.100167","article-title":"A weighted artificial bee colony algorithm for influence maximization","volume":"26","author":"Cantini Riccardo","year":"2021","unstructured":"Riccardo Cantini, Fabrizio Marozzo, Silvio Mazza, Domenico Talia, and Paolo Trunfio. 2021. A weighted artificial bee colony algorithm for influence maximization. Online Social Networks and Media 26 (2021), 100167.","journal-title":"Online Social Networks and Media"},{"issue":"5996","key":"e_1_3_2_34_2","doi-asserted-by":"crossref","first-page":"1194","DOI":"10.1126\/science.1185231","article-title":"The spread of behavior in an online social network experiment","volume":"329","author":"Centola Damon","year":"2010","unstructured":"Damon Centola. 2010. The spread of behavior in an online social network experiment. Science 329, 5996 (2010), 1194\u20131197.","journal-title":"Science"},{"key":"e_1_3_2_35_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.physrep.2022.05.003","article-title":"Influence blocking maximization on networks: Models, methods and applications","volume":"976","author":"Chen Bo-Lun","year":"2022","unstructured":"Bo-Lun Chen, Wen-Xin Jiang, Yi-Xin Chen, Ling Chen, Rui-Jie Wang, Shuai Han, Jian-Hong Lin, and Yi-Cheng Zhang. 2022. Influence blocking maximization on networks: Models, methods and applications. Physics Reports 976 (2022), 1\u201354.","journal-title":"Physics Reports"},{"key":"e_1_3_2_36_2","doi-asserted-by":"crossref","first-page":"101102","DOI":"10.1016\/j.swevo.2022.101102","article-title":"Graph embedding based ant colony optimization for negative influence propagation suppression under cost constraints","volume":"72","author":"Chen Bo-Lun","year":"2022","unstructured":"Bo-Lun Chen, Wen-Xin Jiang, Yong-Tao Yu, Lei Zhou, and Claudio J. Tessone. 2022. Graph embedding based ant colony optimization for negative influence propagation suppression under cost constraints. Swarm and Evolutionary Computation 72 (2022), 101102.","journal-title":"Swarm and Evolutionary Computation"},{"key":"e_1_3_2_37_2","first-page":"1535","volume-title":"Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence","volume":"161","author":"Chen Haipeng","year":"2021","unstructured":"Haipeng Chen, Wei Qiu, Han-Ching Ou, Bo An, and Milind Tambe. 2021. Contingency-aware influence maximization: A reinforcement learning approach. In Proceedings of the 37th Conference on Uncertainty in Artificial Intelligence. Cassio de Campos and Marloes H. Maathuis (Eds.), Vol. 161, PMLR, 1535\u20131545."},{"key":"e_1_3_2_38_2","doi-asserted-by":"crossref","first-page":"343","DOI":"10.1016\/j.ins.2021.02.063","article-title":"Negative influence blocking maximization with uncertain sources under the independent cascade model","volume":"564","author":"Chen Ling","year":"2021","unstructured":"Ling Chen, Yuliang Zhang, Yixin Chen, Bin Li, and Wei Liu. 2021. Negative influence blocking maximization with uncertain sources under the independent cascade model. Information Sciences 564 (2021), 343\u2013367.","journal-title":"Information Sciences"},{"key":"e_1_3_2_39_2","doi-asserted-by":"crossref","first-page":"45512","DOI":"10.1109\/ACCESS.2020.2978010","article-title":"Targeted influence maximization based on cloud computing over big data in social networks","volume":"8","author":"Chen Shiyu","year":"2020","unstructured":"Shiyu Chen, Xiaochun Yin, Qi Cao, Qianmu Li, and Huaqiu Long. 2020. Targeted influence maximization based on cloud computing over big data in social networks. IEEE Access 8 (2020), 45512\u201345522.","journal-title":"IEEE Access"},{"issue":"6","key":"e_1_3_2_40_2","doi-asserted-by":"crossref","first-page":"666","DOI":"10.14778\/2735703.2735706","article-title":"Online topic-aware influence maximization","volume":"8","author":"Chen Shuo","year":"2015","unstructured":"Shuo Chen, Ju Fan, Guoliang Li, Jianhua Feng, Kian-Lee Tan, and Jinhui Tang. 2015. Online topic-aware influence maximization. Proceedings of the VLDB Endowment 8, 6 (Feb. 2015), 666\u2013677.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"2","key":"e_1_3_2_41_2","doi-asserted-by":"crossref","first-page":"2210","DOI":"10.1109\/TCSS.2023.3272331","article-title":"ToupleGDD: A fine-designed solution of influence maximization by deep reinforcement learning","volume":"11","author":"Chen Tiantian","year":"2024","unstructured":"Tiantian Chen, Siwen Yan, Jianxiong Guo, and Weili Wu. 2024. ToupleGDD: A fine-designed solution of influence maximization by deep reinforcement learning. IEEE Transactions on Computational Social Systems 11, 2 (2024), 2210\u20132221.","journal-title":"IEEE Transactions on Computational Social Systems"},{"issue":"4","key":"e_1_3_2_42_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/978-3-031-01850-3","article-title":"Information and influence propagation in social networks","volume":"5","author":"Chen Wei","year":"2013","unstructured":"Wei Chen, Laks V. S. Lakshmanan, and Carlos Castillo. 2013. Information and influence propagation in social networks. Synthesis Lectures on Data Management 5, 4 (2013), 1\u2013177.","journal-title":"Synthesis Lectures on Data Management"},{"key":"e_1_3_2_43_2","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/1557019.1557047","volume-title":"Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201909","author":"Chen Wei","year":"2009","unstructured":"Wei Chen, Yajun Wang, and Siyu Yang. 2009. Efficient influence maximization in social networks. In Proceedings of the 15th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201909), ACM, New York, NY, 199\u2013208."},{"issue":"4","key":"e_1_3_2_44_2","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1109\/TCSS.2020.2998777","article-title":"Scalable lattice influence maximization","volume":"7","author":"Chen Wei","year":"2020","unstructured":"Wei Chen, Ruihan Wu, and Zheng Yu. 2020. Scalable lattice influence maximization. IEEE Transactions on Computational Social Systems 7, 4 (2020), 956\u2013970.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_45_2","doi-asserted-by":"crossref","first-page":"1903","DOI":"10.1007\/s11280-021-00935-x","article-title":"Community-based influence maximization in location-based social network","volume":"24","author":"Chen Xuanhao","year":"2021","unstructured":"Xuanhao Chen, Liwei Deng, Yan Zhao, Xiaofang Zhou, and Kai Zheng. 2021. Community-based influence maximization in location-based social network. World Wide Web 24 (2021), 1903\u20131928.","journal-title":"World Wide Web"},{"key":"e_1_3_2_46_2","first-page":"509","volume-title":"Proceedings of the 22nd ACM International Conference on Information & Knowledge Management (CIKM \u201913)","author":"Cheng Suqi","year":"2013","unstructured":"Suqi Cheng, Huawei Shen, Junming Huang, Guoqing Zhang, and Xueqi Cheng. 2013. StaticGreedy: Solving the scalability-accuracy dilemma in influence maximization. In Proceedings of the 22nd ACM International Conference on Information & Knowledge Management (CIKM \u201913), ACM, New York, NY, 509\u2013518."},{"key":"e_1_3_2_47_2","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/j.jnca.2017.12.003","article-title":"DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks","volume":"103","author":"Cui Laizhong","year":"2018","unstructured":"Laizhong Cui, Huaixiong Hu, Shui Yu, Qiao Yan, Zhong Ming, Zhenkun Wen, and Nan Lu. 2018. DDSE: A novel evolutionary algorithm based on degree-descending search strategy for influence maximization in social networks. Journal of Network and Computer Applications 103 (2018), 119\u2013130.","journal-title":"Journal of Network and Computer Applications"},{"key":"e_1_3_2_48_2","doi-asserted-by":"crossref","first-page":"655","DOI":"10.1145\/3638530.3654161","volume-title":"Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO \u201924 Companion","author":"Cunegatti Elia","year":"2024","unstructured":"Elia Cunegatti, Leonardo Custode, and Giovanni Iacca. 2024. Many-objective evolutionary influence maximization: Balancing spread, budget, fairness, and time. In Proceedings of the Genetic and Evolutionary Computation Conference Companion, GECCO \u201924 Companion, ACM, New York, NY, 655\u2013658."},{"key":"e_1_3_2_49_2","doi-asserted-by":"crossref","first-page":"44084","DOI":"10.1109\/ACCESS.2021.3065937","article-title":"Influence maximization in signed networks by enhancing the negative influence","volume":"9","author":"Dai Caiyan","year":"2021","unstructured":"Caiyan Dai and Kongfa Hu. 2021. Influence maximization in signed networks by enhancing the negative influence. IEEE Access 9 (2021), 44084\u201344093.","journal-title":"IEEE Access"},{"key":"e_1_3_2_50_2","first-page":"6351","volume-title":"Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS \u201917)","author":"Dai Hanjun","year":"2017","unstructured":"Hanjun Dai, Elias B. Khalil, Yuyu Zhang, Bistra Dilkina, and Le Song. 2017. Learning combinatorial optimization algorithms over graphs. In Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS \u201917), Curran Associates Inc., Red Hook, NY, 6351\u20136361."},{"key":"e_1_3_2_51_2","doi-asserted-by":"crossref","first-page":"5832","DOI":"10.1109\/GLOBECOM48099.2022.10000698","volume-title":"Proceedings of the 2022 IEEE Global Communications Conference (GLOBECOM \u201922)","author":"Dinh Thang","year":"2022","unstructured":"Thang Dinh, An Nguyen, Uyen Nguyen, and Giang Nguyen. 2022. Quantum social computing approaches for influence maximization. In Proceedings of the 2022 IEEE Global Communications Conference (GLOBECOM \u201922), 5832\u20135837."},{"issue":"4","key":"e_1_3_2_52_2","doi-asserted-by":"crossref","first-page":"587","DOI":"10.1016\/j.jtbi.2004.09.006","article-title":"A generalized model of social and biological contagion","volume":"232","author":"Dodds Peter S.","year":"2005","unstructured":"Peter S. Dodds and Duncan J. Watts. 2005. A generalized model of social and biological contagion. Journal of Theoretical Biology 232, 4 (2005), 587\u2013604.","journal-title":"Journal of Theoretical Biology"},{"key":"e_1_3_2_53_2","first-page":"57","volume-title":"Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201901)","author":"Domingos Pedro","year":"2001","unstructured":"Pedro Domingos and Matt Richardson. 2001. Mining the network value of customers. In Proceedings of the 7th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201901), ACM, New York, NY, 57\u201366."},{"issue":"3","key":"e_1_3_2_54_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1007\/s41019-020-00132-2","article-title":"Real-time influence maximization in a RTB setting","volume":"5","author":"Dupuis David","year":"2020","unstructured":"David Dupuis, C\u00e9dric Du Mouza, Nicolas Travers, and Ga\u00ebl Chareyron. 2020. Real-time influence maximization in a RTB setting. Data Science and Engineering 5, 3 (2020), 224\u2013239.","journal-title":"Data Science and Engineering"},{"issue":"2","key":"e_1_3_2_55_2","doi-asserted-by":"crossref","first-page":"327","DOI":"10.1007\/s00607-023-01207-4","article-title":"Influence maximization in social networks based on discrete Harris Hawks optimization algorithm","volume":"106","author":"Fan Chencheng","year":"2024","unstructured":"Chencheng Fan, Zhixiao Wang, Jian Zhang, Jiayu Zhao, and Xiaobin Rui. 2024. Influence maximization in social networks based on discrete Harris Hawks optimization algorithm. Computing 106, 2 (2024), 327\u2013351.","journal-title":"Computing"},{"key":"e_1_3_2_56_2","first-page":"1","volume-title":"Proceedings of the 28th AAAI Conference on Artificial Intelligence","author":"Feng Shanshan","year":"2024","unstructured":"Shanshan Feng, Xuefeng Chen, Gao Cong, Yifeng Zeng, Yeow Meng Chee, and Yanping Xiang. 2024. Influence maximization with novelty decay in social networks. In Proceedings of the 28th AAAI Conference on Artificial Intelligence, 1\u20137."},{"issue":"3","key":"e_1_3_2_57_2","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0378-8733(78)90021-7","article-title":"Centrality in social networks conceptual clarification","volume":"1","author":"Freeman Linton C.","year":"1978","unstructured":"Linton C. Freeman. 1978. Centrality in social networks conceptual clarification. Social Networks 1, 3 (1978), 215\u2013239. 1978.","journal-title":"Social Networks"},{"key":"e_1_3_2_58_2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511527524","volume-title":"A Structural Theory of Social Influence","author":"Friedkin Noah E.","year":"1998","unstructured":"Noah E. Friedkin. 1998. A Structural Theory of Social Influence. Cambridge University Press."},{"key":"e_1_3_2_59_2","doi-asserted-by":"crossref","first-page":"23","DOI":"10.1016\/j.tcs.2020.03.016","article-title":"Interaction-aware influence maximization and iterated sandwich method","volume":"821","author":"Gao Chuangen","year":"2020","unstructured":"Chuangen Gao, Shuyang Gu, Ruiqi Yang, Jiguo Yu, Weili Wu, and Dachuan Xu. 2020. Interaction-aware influence maximization and iterated sandwich method. Theoretical Computer Science 821 (2020), 23\u201333.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"e_1_3_2_60_2","doi-asserted-by":"crossref","first-page":"2528","DOI":"10.1109\/TNSE.2020.2997021","article-title":"Fair-aware competitive event influence maximization in social networks","volume":"7","author":"Gao Siyuan","year":"2020","unstructured":"Siyuan Gao, Zhongbao Zhang, Sen Su, Jian Wen, and Li Sun. 2020. Fair-aware competitive event influence maximization in social networks. IEEE Transactions on Network Science and Engineering 7, 4 (2020), 2528\u20132540.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"e_1_3_2_61_2","doi-asserted-by":"crossref","first-page":"162238","DOI":"10.1109\/ACCESS.2020.3022096","article-title":"Human-Driven dynamic community influence maximization in social media data streams","volume":"8","author":"Ge Jun","year":"2020","unstructured":"Jun Ge, Lei-Lei Shi, Yan Wu, and Jie Liu. 2020. Human-Driven dynamic community influence maximization in social media data streams. IEEE Access 8 (Jan. 2020), 162238\u2013162251.","journal-title":"IEEE Access"},{"issue":"12","key":"e_1_3_2_62_2","doi-asserted-by":"crossref","first-page":"7821","DOI":"10.1073\/pnas.122653799","article-title":"Community structure in social and biological networks","volume":"99","author":"Girvan Michelle","year":"2002","unstructured":"Michelle Girvan and Mark E. J. Newman. 2002. Community structure in social and biological networks. Proceedings of the National Academy of Sciences of the United States of America 99, 12 (2002), 7821\u20137826.","journal-title":"Proceedings of the National Academy of Sciences of the United States of America"},{"issue":"04","key":"e_1_3_2_63_2","doi-asserted-by":"crossref","first-page":"565","DOI":"10.1142\/S0219525903001067","article-title":"Community structure in jazz","volume":"06","author":"Gleiser Pablom","year":"2003","unstructured":"Pablom Gleiser and Leon Danon. 2003. Community structure in jazz. Advances in Complex Systems 06, 04 (2003), 565\u2013573.","journal-title":"Advances in Complex Systems"},{"key":"e_1_3_2_64_2","volume-title":"Analyzing the Social Web","author":"Golbeck Jennifer","year":"2013","unstructured":"Jennifer Golbeck. 2013. Analyzing the Social Web. Morgan Kaufmann."},{"key":"e_1_3_2_65_2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1023\/A:1011122126881","article-title":"Talk of the network: A complex systems look at the underlying process of word-of-mouth","volume":"12","author":"Goldenberg Jacob","year":"2001","unstructured":"Jacob Goldenberg, Barak Libai, and Eitan Muller. 2001. Talk of the network: A complex systems look at the underlying process of word-of-mouth. Marketing Letters 12 (2001), 211\u2013223.","journal-title":"Marketing Letters"},{"key":"e_1_3_2_66_2","doi-asserted-by":"crossref","first-page":"119138","DOI":"10.1016\/j.eswa.2022.119138","article-title":"Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge","volume":"214","author":"Gong Hao","year":"2023","unstructured":"Hao Gong and Chunxiang Guo. 2023. Influence maximization considering fairness: A multi-objective optimization approach with prior knowledge. Expert Systems with Applications 214 (2001), 119138.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_67_2","doi-asserted-by":"crossref","first-page":"600","DOI":"10.1016\/j.ins.2016.07.012","article-title":"Influence maximization in social networks based on discrete particle swarm optimization","volume":"367","author":"Gong Maoguo","year":"2016","unstructured":"Maoguo Gong, Jianan Yan, Bo Shen, Lijia Ma, and Qing Cai. 2016. Influence maximization in social networks based on discrete particle swarm optimization. Information Sciences 367\u2013368 (2016), 600\u2013614.","journal-title":"Information Sciences"},{"key":"e_1_3_2_68_2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1145\/1718487.1718518","volume-title":"Proceedings of the 3rd ACM International Conference on Web Search and Data Mining (WSDM \u201910","author":"Goyal Amit","year":"2010","unstructured":"Amit Goyal, Francesco Bonchi, and Laks V. S. Lakshmanan. 2010. Learning influence probabilities in social networks. In Proceedings of the 3rd ACM International Conference on Web Search and Data Mining (WSDM \u201910), ACM, New York, NY, 241\u2013250."},{"key":"e_1_3_2_69_2","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1145\/1963192.1963217","volume-title":"Proceedings of the 20th International Conference Companion on World Wide Web (WWW \u201911)","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. CELF++: optimizing the greedy algorithm for influence maximization in social networks. In Proceedings of the 20th International Conference Companion on World Wide Web (WWW \u201911), ACM, New York, NY, 47\u201348."},{"key":"e_1_3_2_70_2","doi-asserted-by":"crossref","first-page":"211","DOI":"10.1109\/ICDM.2011.132","volume-title":"2011 IEEE 11th International Conference on Data Mining","author":"Goyal Amit","year":"2011","unstructured":"Amit Goyal, Wei Lu, and Laks V. S. Lakshmanan. 2011. SIMPATH: An efficient algorithm for influence maximization under the linear threshold model. In 2011 IEEE 11th International Conference on Data Mining, 211\u2013220."},{"issue":"6","key":"e_1_3_2_71_2","doi-asserted-by":"crossref","first-page":"1420","DOI":"10.1086\/226707","article-title":"Threshold models of collective behavior","volume":"83","author":"Granovetter Mark","year":"1978","unstructured":"Mark Granovetter. 1978. Threshold models of collective behavior. American Journal of Sociology 83, 6 (1978), 1420\u20131443.","journal-title":"American Journal of Sociology"},{"issue":"6","key":"e_1_3_2_72_2","doi-asserted-by":"crossref","first-page":"1360","DOI":"10.1086\/225469","article-title":"The strength of weak ties","volume":"78","author":"Granovetter Mark S.","year":"1973","unstructured":"Mark S. Granovetter. 1973. The strength of weak ties. American Journal of Sociology 78, 6 (1973), 1360\u20131380.","journal-title":"American Journal of Sociology"},{"issue":"2","key":"e_1_3_2_73_2","first-page":"289","article-title":"Least-cost influence maximization on social networks","volume":"32","author":"G\u00fcnne\u00e7 Dilek","year":"2020","unstructured":"Dilek G\u00fcnne\u00e7, S. Raghavan, and Rui Zhang. 2020. Least-cost influence maximization on social networks. INFORMS Journal on Computing 32, 2 (2020), 289\u2013302.","journal-title":"INFORMS Journal on Computing"},{"key":"e_1_3_2_74_2","doi-asserted-by":"crossref","first-page":"111580","DOI":"10.1016\/j.knosys.2024.111580","article-title":"Heterogeneous network influence maximization algorithm based on multi-scale propagation strength and repulsive force of propagation field","volume":"291","author":"Guo Chang","year":"2024","unstructured":"Chang Guo, Weimin Li, Jingchao Wang, Xiao Yu, Xiao Liu, Alex Munyole Luvembe, Can Wang, and Qun Jin. 2024. Heterogeneous network influence maximization algorithm based on multi-scale propagation strength and repulsive force of propagation field. Knowledge-Based Systems 291 (2024), 111580.","journal-title":"Knowledge-Based Systems"},{"issue":"5","key":"e_1_3_2_75_2","first-page":"1","article-title":"Adaptive influence maximization: If influential node unwilling to be the seed","volume":"15","author":"Guo Jianxiong","year":"2021","unstructured":"Jianxiong Guo and Weili Wu. 2021 Adaptive influence maximization: If influential node unwilling to be the seed. ACM Transactions on Knowledge Discovery Data 15, 5 (May 2021), 1\u201323.","journal-title":"ACM Transactions on Knowledge Discovery Data"},{"key":"e_1_3_2_76_2","first-page":"1","article-title":"MCD: A modified community diversity approach for detecting influential nodes in social networks","volume":"61","author":"Gupta Aaryan","year":"2023","unstructured":"Aaryan Gupta, Inder Khatri, Arjun Choudhry, and Sanjay Kumar. 2023. MCD: A modified community diversity approach for detecting influential nodes in social networks. Journal of Intelligent Information Systems 61 (2023), 1\u201323.","journal-title":"Journal of Intelligent Information Systems"},{"key":"e_1_3_2_77_2","doi-asserted-by":"crossref","first-page":"111","DOI":"10.1016\/j.knosys.2018.07.040","article-title":"Influence maximization in social networks under deterministic linear threshold model","volume":"161","author":"Gursoy Furkan","year":"2018","unstructured":"Furkan Gursoy and Dilek Gunnec. 2018. Influence maximization in social networks under deterministic linear threshold model. Knowledge-Based Systems 161 (2018), 111\u2013123.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_78_2","doi-asserted-by":"crossref","first-page":"113642","DOI":"10.1016\/j.eswa.2020.113642","article-title":"Influential nodes detection in dynamic social networks: A survey","volume":"159","author":"Hafiene Nesrine","year":"2020","unstructured":"Nesrine Hafiene, Wafa Karoui, and Lotfi Ben Romdhane. 2020. Influential nodes detection in dynamic social networks: A survey. Expert Systems with Applications 159 (2020), 113642.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_79_2","doi-asserted-by":"crossref","first-page":"8223","DOI":"10.1007\/s00500-021-05749-7","article-title":"A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks","volume":"25","author":"Han Lihong","year":"2021","unstructured":"Lihong Han, Kuan-Ching Li, Arcangelo Castiglione, Jianxin Tang, Hengjun Huang, and Qingguo Zhou. 2021. A clique-based discrete bat algorithm for influence maximization in identifying top-k influential nodes of social networks. Soft Computing 25 (2021), 8223\u20138240.","journal-title":"Soft Computing"},{"issue":"5","key":"e_1_3_2_80_2","doi-asserted-by":"crossref","first-page":"2624","DOI":"10.1109\/TCSS.2022.3192410","article-title":"Positive influence maximization in signed networks within a limited time","volume":"10","author":"He Qiang","year":"2023","unstructured":"Qiang He, Hongwei Du, and Ziwei Liang. 2023. Positive influence maximization in signed networks within a limited time. IEEE Transactions on Computational Social Systems 10, 5 (2023), 2624\u20132635.","journal-title":"IEEE Transactions on Computational Social Systems"},{"issue":"4","key":"e_1_3_2_81_2","doi-asserted-by":"crossref","first-page":"599","DOI":"10.1137\/S0036144500371907","article-title":"The mathematics of infectious diseases","volume":"42","author":"Hethcote Herbert W.","year":"2000","unstructured":"Herbert W. Hethcote. 2000. The mathematics of infectious diseases. SIAM Review 42, 4 (2000), 599\u2013653.","journal-title":"SIAM Review"},{"issue":"4","key":"e_1_3_2_82_2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.2307\/1927875","article-title":"The measurement of industrial localization","volume":"18","author":"Hoover Edgar M.","year":"1936","unstructured":"Edgar M. Hoover. 1936. The measurement of industrial localization. The Review of Economics and Statistics 18, 4 (1936), 162\u2013171.","journal-title":"The Review of Economics and Statistics"},{"issue":"10","key":"e_1_3_2_83_2","doi-asserted-by":"crossref","first-page":"3470","DOI":"10.1109\/TFUZZ.2023.3259726","article-title":"FCAN-MOPSO: An improved fuzzy-based graph clustering algorithm for complex networks with multiobjective particle swarm optimization","volume":"31","author":"Hu Lun","year":"2023","unstructured":"Lun Hu, Yue Yang, Zehai Tang, Yizhou He, and Xin Luo. 2023. FCAN-MOPSO: An improved fuzzy-based graph clustering algorithm for complex networks with multiobjective particle swarm optimization. IEEE Transactions on Fuzzy Systems 31, 10 (2023), 3470\u20133484.","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"e_1_3_2_84_2","first-page":"1130","volume-title":"2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD)","author":"Hu Xiao-Min","year":"2023","unstructured":"Xiao-Min Hu, Yi-Qian Zhao, and Zhuo Yang. 2023. Nodes grouping genetic algorithm for influence maximization in multiplex social networks. In 2023 26th International Conference on Computer Supported Cooperative Work in Design (CSCWD), 1130\u20131135."},{"key":"e_1_3_2_85_2","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1016\/j.ins.2020.04.023","article-title":"Recurrent neural variational model for follower-based influence maximization","volume":"528","author":"Huang Huimin","year":"2020","unstructured":"Huimin Huang, Zaiqiao Meng, and Shangsong Liang. 2020. Recurrent neural variational model for follower-based influence maximization. Information Sciences 528 (2020), 280\u2013293.","journal-title":"Information Sciences"},{"key":"e_1_3_2_86_2","doi-asserted-by":"crossref","first-page":"106600","DOI":"10.1016\/j.knosys.2020.106600","article-title":"Competitive and complementary influence maximization in social network: A follower\u2019s perspective","volume":"213","author":"Huang Huimin","year":"2021","unstructured":"Huimin Huang, Zaiqiao Meng, and Hong Shen. 2021. Competitive and complementary influence maximization in social network: A follower\u2019s perspective. Knowledge-Based Systems 213 (2021), 106600.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_87_2","first-page":"9622","volume-title":"Proceedings of the 39th International Conference on Machine Learning","volume":"162","author":"Ireland David","year":"2022","unstructured":"David Ireland and Giovanni Montana. 2022. LeNSE: Learning to navigate subgraph embeddings for large-scale combinatorial optimisation. In Proceedings of the 39th International Conference on Machine Learning. Kamalika Chaudhuri, Stefanie Jegelka, Le Song, Csaba Szepesvari, Gang Niu, and Sivan Sabato (Eds.), Vol. 162, PMLR, 9622\u20139638."},{"key":"e_1_3_2_88_2","doi-asserted-by":"crossref","first-page":"126480","DOI":"10.1016\/j.physa.2021.126480","article-title":"An improved influence maximization method for social networks based on genetic algorithm","volume":"586","author":"Jabari Lotf Jalil","year":"2022","unstructured":"Jalil Jabari Lotf, Mohammad Abdollahi Azgomi, and Mohammad Reza Ebrahimi Dishabi. 2022. An improved influence maximization method for social networks based on genetic algorithm. Physica A: Statistical Mechanics and Its Applications 586 (2022), 126480.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"e_1_3_2_89_2","doi-asserted-by":"crossref","first-page":"123429","DOI":"10.1016\/j.eswa.2024.123429","article-title":"A survey on influence maximization models","volume":"248","author":"Jaouadi Myriam","year":"2024","unstructured":"Myriam Jaouadi and Lotfi Ben Romdhane. 2024. A survey on influence maximization models. Expert Systems with Applications 248 (2024), 123429.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_90_2","doi-asserted-by":"crossref","first-page":"1571","DOI":"10.1016\/j.ins.2019.10.061","article-title":"A new algorithm for positive influence maximization in signed networks","volume":"512","author":"Ju Weijia","year":"2020","unstructured":"Weijia Ju, Ling Chen, Bin Li, Wei Liu, Jun Sheng, and Yuwei Wang. 2020. A new algorithm for positive influence maximization in signed networks. Information Sciences 512 (2020), 1571\u20131591.","journal-title":"Information Sciences"},{"key":"e_1_3_2_91_2","doi-asserted-by":"crossref","first-page":"109916","DOI":"10.1016\/j.comnet.2023.109916","article-title":"K++ shell: Influence maximization in multilayer networks using community detection","volume":"234","author":"Venkatakrishna Rao K.","year":"2023","unstructured":"K. Venkatakrishna Rao and C. Ravindranath Chowdary. 2023. K++ shell: Influence maximization in multilayer networks using community detection. Computer Networks 234 (2023), 109916.","journal-title":"Computer Networks"},{"key":"e_1_3_2_92_2","first-page":"575","volume-title":"Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS \u201920)","author":"Kamarthi Harshavardhan","year":"2020","unstructured":"Harshavardhan Kamarthi, Priyesh Vijayan, Bryan Wilder, Balaraman Ravindran, and Milind Tambe. 2020. Influence maximization in unknown social networks: Learning policies for effective graph sampling. In Proceedings of the 19th International Conference on Autonomous Agents and MultiAgent Systems (AAMAS \u201920), International Foundation for Autonomous Agents and Multiagent Systems, Richland, SC, 575\u2013583."},{"key":"e_1_3_2_93_2","first-page":"1","volume-title":"Proceedings of the 2022 13th International Conference on Information and Knowledge Technology (IKT)","author":"Kazemzadeh Farzaneh","year":"2022","unstructured":"Farzaneh Kazemzadeh, Ali Asghar Safaei, and Mitra Mirzarezaee. 2022. Optimal selection of seed nodes by reducing the influence of common nodes in the influence maximization problem. In Proceedings of the 2022 13th International Conference on Information and Knowledge Technology (IKT), 1\u20137."},{"key":"e_1_3_2_94_2","doi-asserted-by":"crossref","first-page":"112905","DOI":"10.1016\/j.eswa.2019.112905","article-title":"Influence maximization across heterogeneous interconnected networks based on deep learning","volume":"140","author":"Keikha Mohammad Mehdi","year":"2020","unstructured":"Mohammad Mehdi Keikha, Maseud Rahgozar, Masoud Asadpour, and Mohammad Faghih Abdollahi. 2020. Influence maximization across heterogeneous interconnected networks based on deep learning. Expert Systems with Applications 140 (2020), 112905.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_95_2","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1145\/956750.956769","volume-title":"Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201903)","author":"Kempe David","year":"2003","unstructured":"David Kempe, Jon Kleinberg, and \u00c9va Tardos. 2003. Maximizing the spread of influence through a social network. In Proceedings of the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201903), ACM, New York, NY, 137\u2013146."},{"issue":"772","key":"e_1_3_2_96_2","first-page":"), 700","article-title":"A contribution to the mathematical theory of epidemics","volume":"115","author":"Ogilvy Kermack William","year":"1927","unstructured":"William Ogilvy Kermack, A. G. McKendrick, and Gilbert Thomas Walker. 1927. A contribution to the mathematical theory of epidemics. Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character 115, 772 (1927), 700\u2013721.","journal-title":"Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character"},{"key":"e_1_3_2_97_2","volume-title":"Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920","author":"Khajehnejad Moein","year":"2021","unstructured":"Moein Khajehnejad, Ahmad Asgharian Rezaei, Mahmoudreza Babaei, Jessica Hoffmann, Mahdi Jalili, and Adrian Weller. 2021. Adversarial graph embeddings for fair influence maximization over social networks. In Proceedings of the 29th International Joint Conference on Artificial Intelligence (IJCAI \u201920)."},{"key":"e_1_3_2_98_2","first-page":"266","volume-title":"Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE)","author":"Kim Jinha","unstructured":"Jinha Kim, Seung-Keol Kim, and Hwanjo Yu. Scalable and parallelizable processing of influence maximization for large-scale social networks? In Proceedings of the 2013 IEEE 29th International Conference on Data Engineering (ICDE), 266\u2013277."},{"key":"e_1_3_2_99_2","first-page":"259","volume-title":"Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD \u201906)","author":"Kimura Masahiro","year":"2006","unstructured":"Masahiro Kimura and Kazumi Saito. 2006. Tractable models for information diffusion in social networks. In Proceedings of the 10th European Conference on Principles and Practice of Knowledge Discovery in Databases (ECMLPKDD \u201906), Springer-Verlag, Berlin, 259\u2013271."},{"key":"e_1_3_2_100_2","doi-asserted-by":"crossref","first-page":"2303","DOI":"10.1007\/s11280-021-00996-y","article-title":"CSR: A community based spreaders ranking algorithm for influence maximization in social networks","volume":"25","author":"Kumar Sanjay","year":"2022","unstructured":"Sanjay Kumar, Aaryan Gupta, and Inder Khatri. 2022. CSR: A community based spreaders ranking algorithm for influence maximization in social networks. World Wide Web 25 (2022), 2303\u20132322.","journal-title":"World Wide Web"},{"key":"e_1_3_2_101_2","doi-asserted-by":"crossref","first-page":"118770","DOI":"10.1016\/j.eswa.2022.118770","article-title":"Influence maximization in social networks using transfer learning via graph-based LSTM","volume":"212","author":"Kumar Sanjay","year":"2023","unstructured":"Sanjay Kumar, Abhishek Mallik, and Bhawani S. Panda. 2023. Influence maximization in social networks using transfer learning via graph-based LSTM. Expert Systems with Applications 212 (2023), 118770.","journal-title":"Expert Systems with Applications"},{"issue":"4","key":"e_1_3_2_102_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3690644","article-title":"Cuckoo search optimization-based influence maximization in dynamic social networks","volume":"18","author":"Kumar Meena Sunil","year":"2024","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, and Kuldeep Singh. 2024. Cuckoo search optimization-based influence maximization in dynamic social networks. ACM Transactions on the Web 18, 4 (Oct. 2024), 1\u201325.","journal-title":"ACM Transactions on the Web"},{"issue":"3","key":"e_1_3_2_103_2","doi-asserted-by":"crossref","first-page":"247","DOI":"10.1007\/s11334-021-00396-5","article-title":"A discrete genetic learning enabled PSO for targeted positive influence maximization in consumer review networks","volume":"17","author":"Kundu Gouri","year":"2021","unstructured":"Gouri Kundu and Sankhayan Choudhury. 2021. A discrete genetic learning enabled PSO for targeted positive influence maximization in consumer review networks. Innovations in Systems and Software Engineering 17, 3 (2021), 247\u2013259.","journal-title":"Innovations in Systems and Software Engineering"},{"key":"e_1_3_2_104_2","doi-asserted-by":"crossref","first-page":"046110","DOI":"10.1103\/PhysRevE.78.046110","article-title":"Benchmark graphs for testing community detection algorithms","volume":"78","author":"Lancichinetti Andrea","year":"2008","unstructured":"Andrea Lancichinetti, Santo Fortunato, and Filippo Radicchi. 2008. Benchmark graphs for testing community detection algorithms. Physical Review E 78 (Oct. 2008), 046110.","journal-title":"Physical Review E"},{"issue":"6","key":"e_1_3_2_105_2","doi-asserted-by":"crossref","first-page":"188","DOI":"10.1088\/1367-2630\/9\/6\/188","article-title":"A measure of centrality based on network efficiency","volume":"9","author":"Latora Vito","year":"2007","unstructured":"Vito Latora and Massimo Marchiori. 2007. A measure of centrality based on network efficiency. New Journal of Physics 9, 6 (Jun. 2007), 188.","journal-title":"New Journal of Physics"},{"key":"e_1_3_2_106_2","doi-asserted-by":"crossref","first-page":"641","DOI":"10.1145\/1772690.1772756","volume-title":"Proceedings of the 19th International Conference on World Wide Web (WWW \u201910)","author":"Leskovec Jure","year":"2010","unstructured":"Jure Leskovec, Daniel Huttenlocher, and Jon Kleinberg. 2010. Predicting positive and negative links in online social networks. In Proceedings of the 19th International Conference on World Wide Web (WWW \u201910), ACM, New York, NY, 641\u2013650."},{"key":"e_1_3_2_107_2","first-page":"420","volume-title":"Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201907","author":"Leskovec Jure","year":"2007","unstructured":"Jure Leskovec, Andreas Krause, Carlos Guestrin, Christos Faloutsos, Jeanne VanBriesen, and Natalie Glance. 2007. Cost-effective outbreak detection in networks. In Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201907), ACM, New York, NY, 420\u2013429."},{"key":"e_1_3_2_108_2","unstructured":"Jure Leskovec Mary McGlohon Christos Faloutsos Natalie Glance and Matthew Hurst. Cascading behavior in large blog graphs patterns and a model. arXiv:0704.2803. Retrieved from https:\/\/arxiv.org\/abs\/0704.2803"},{"issue":"5","key":"e_1_3_2_109_2","doi-asserted-by":"crossref","first-page":"875","DOI":"10.1016\/j.ijproman.2016.10.007","article-title":"Filling the gaps: An investigation of project governance in a non-governmental organisation\u2019s response to the Haiti earthquake disaster","volume":"35","author":"Levie Fiona","year":"2017","unstructured":"Fiona Levie, Catriona M. Burke, and John Lannon. 2017. Filling the gaps: An investigation of project governance in a non-governmental organisation\u2019s response to the Haiti earthquake disaster. International Journal of Project Management 35, 5 (2017), 875\u2013888.","journal-title":"International Journal of Project Management"},{"issue":"2","key":"e_1_3_2_110_2","first-page":"3821","article-title":"Net positive influence maximization in signed social networks","volume":"41","author":"Li Dong","year":"2021","unstructured":"Dong Li, Yuejiao Wang, Muhao Li, Xin Sun, Jingchang Pan, and Jun Ma. 2021. Net positive influence maximization in signed social networks. Journal of Intelligent and Fuzzy Systems 41, 2 (2021), 3821\u20133832.","journal-title":"Journal of Intelligent and Fuzzy Systems"},{"key":"e_1_3_2_111_2","doi-asserted-by":"crossref","first-page":"7749","DOI":"10.1007\/s10489-021-02283-9","article-title":"Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization","volume":"51","author":"Li Huan","year":"2021","unstructured":"Huan Li, Ruisheng Zhang, Zhili Zhao, Xin Liu, and Yongna Yuan. 2021. Identification of top-k influential nodes based on discrete crow search algorithm optimization for influence maximization. Applied Intelligence 51 (2021), 7749\u20137765.","journal-title":"Applied Intelligence"},{"issue":"3","key":"e_1_3_2_112_2","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 Hui","year":"2023","unstructured":"Hui Li, Mengting Xu, Sourav S. Bhowmick, Joty Shafiq Rayhan, Changsheng Sun, and Jiangtao Cui. 2023. PIANO: Influence maximization meets deep reinforcement learning. IEEE Transactions on Computational Social Systems 10, 3 (2023), 1288\u20131300.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_113_2","unstructured":"Hui Li Susu Yang Mengting Xu Sourav S. Bhowmick and Jiangtao Cui. 2023. Influence maximization in social networks: A survey. arXiv:2309.04668. Retrieved from https:\/\/arxiv.org\/abs\/2309.04668"},{"key":"e_1_3_2_114_2","doi-asserted-by":"crossref","first-page":"101522","DOI":"10.1016\/j.is.2020.101522","article-title":"Community-diversified influence maximization in social networks","volume":"92","author":"Li Jianxin","year":"2020","unstructured":"Jianxin Li, Taotao Cai, Ke Deng, Xinjue Wang, Timos Sellis, and Feng Xia. 2020. Community-diversified influence maximization in social networks. Information Systems 92 (2020), 101522.","journal-title":"Information Systems"},{"key":"e_1_3_2_115_2","doi-asserted-by":"crossref","first-page":"124","DOI":"10.1016\/j.ins.2020.01.040","article-title":"Targeted influence maximization under a multifactor-based information propagation model","volume":"519","author":"Li Lingfei","year":"2020","unstructured":"Lingfei Li, Yezheng Liu, Qing Zhou, Wei Yang, and Jiahang Yuan. 2020. Targeted influence maximization under a multifactor-based information propagation model. Information Sciences 519 (2020), 124\u2013140.","journal-title":"Information Sciences"},{"key":"e_1_3_2_116_2","first-page":"92","volume-title":"Collaborative Computing: Networking, Applications and Worksharing","author":"Li Shasha","year":"2019","unstructured":"Shasha Li, Kai Han, and Jiahao Zhang. 2019. Exploring influence maximization in location-based social networks. In Collaborative Computing: Networking, Applications and Worksharing. Honghao Gao, Xinheng Wang, Yuyu Yin, and Muddesar Iqbal (Eds.), Springer International Publishing, Cham, 92\u2013111."},{"issue":"2","key":"e_1_3_2_117_2","doi-asserted-by":"crossref","first-page":"102818","DOI":"10.1016\/j.ipm.2021.102818","article-title":"An influence maximization method based on crowd emotion under an emotion-based attribute social network","volume":"59","author":"Li Weimin","year":"2022","unstructured":"Weimin Li, Yaqiong Li, Wei Liu, and Can Wang. 2022. An influence maximization method based on crowd emotion under an emotion-based attribute social network. Information Processing and Management 59, 2 (2022), 102818.","journal-title":"Information Processing and Management"},{"key":"e_1_3_2_118_2","doi-asserted-by":"crossref","first-page":"114207","DOI":"10.1016\/j.eswa.2020.114207","article-title":"A dynamic algorithm based on cohesive entropy for influence maximization in social networks","volume":"169","author":"Li Weimin","year":"2021","unstructured":"Weimin Li, Kexin Zhong, Jianjia Wang, and Dehua Chen. 2021. A dynamic algorithm based on cohesive entropy for influence maximization in social networks. Expert Systems with Applications 169 (2021), 114207.","journal-title":"Expert Systems with Applications"},{"issue":"9","key":"e_1_3_2_119_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3604559","article-title":"A survey on influence maximization: From an ML-based combinatorial optimization","volume":"17","author":"Li Yandi","year":"2023","unstructured":"Yandi Li, Haobo Gao, Yunxuan Gao, Jianxiong Guo, and Weili Wu. 2023. A survey on influence maximization: From an ML-based combinatorial optimization. ACM Transactions on Knowledge Discovery from Data 17, 9 (Jul. 2023), 1\u201350.","journal-title":"ACM Transactions on Knowledge Discovery from Data"},{"key":"e_1_3_2_120_2","doi-asserted-by":"crossref","first-page":"117289","DOI":"10.1016\/j.eswa.2022.117289","article-title":"MAHE-IM: Multiple aggregation of heterogeneous relation embedding for influence maximization on heterogeneous information network","volume":"202","author":"Li Ying","year":"2022","unstructured":"Ying Li, Linlin Li, Yijun Liu, and Qianqian Li. 2022. MAHE-IM: Multiple aggregation of heterogeneous relation embedding for influence maximization on heterogeneous information network. Expert Systems with Applications 202 (2022), 117289.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_121_2","doi-asserted-by":"crossref","first-page":"1070","DOI":"10.14778\/2794367.2794376","article-title":"Real-time targeted influence maximization for online advertisements","volume":"8","author":"Li Yuchen","year":"2015","unstructured":"Yuchen Li, Dongxiang Zhang, and Kian-Lee Tan. 2015. Real-time targeted influence maximization for online advertisements. Proceedings of the VLDB Endowment 8 (2015), 1070\u20131081.","journal-title":"Proceedings of the VLDB Endowment"},{"issue":"11","key":"e_1_3_2_122_2","doi-asserted-by":"crossref","first-page":"3666","DOI":"10.14778\/3681954.3682029","article-title":"A benchmark study of deep-RL methods for maximum coverage problems over graphs","volume":"17","author":"Liang Zhicheng","year":"2024","unstructured":"Zhicheng Liang, Yu Yang, Xiangyu Ke, Xiaokui Xiao, and Yunjun Gao. 2024. A benchmark study of deep-RL methods for maximum coverage problems over graphs. Proceedings of the VLDB Endowment 17, 11 (2024), 3666\u20133679.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_123_2","first-page":"46","article-title":"An adaptive immune-inspired multi-objective algorithm with multiple differential evolution strategies","volume":"430","author":"Lin Qiuzhen","year":"2018","unstructured":"Qiuzhen Lin, Yueping Ma, Jianyong Chen, Qingling Zhu, Carlos A. Coello Coello, Ka-Chun Wong, and Fei Chen. 2018. An adaptive immune-inspired multi-objective algorithm with multiple differential evolution strategies. Information Sciences 430\u2013431 (2018), 46\u201364.","journal-title":"Information Sciences"},{"key":"e_1_3_2_124_2","first-page":"695","volume-title":"Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201915","author":"Lin Su-Chen","year":"2015","unstructured":"Su-Chen Lin, Shou-De Lin, and Ming-Syan Chen. 2015. A learning-based framework to handle multi-round multi-party influence maximization on social networks. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201915), ACM, New York, NY, 695\u2013704."},{"key":"e_1_3_2_125_2","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1007\/s10489-019-01506-4","article-title":"An algorithm for influence maximization in competitive social networks with unwanted users","volume":"50","author":"Liu Wei","year":"2020","unstructured":"Wei Liu, Ling Chen, Xin Chen, and Bolun Chen. 2020. An algorithm for influence maximization in competitive social networks with unwanted users. Applied Intelligence 50 (2020), 417\u2013437.","journal-title":"Applied Intelligence"},{"issue":"3","key":"e_1_3_2_126_2","doi-asserted-by":"crossref","first-page":"912","DOI":"10.1007\/s10489-018-1303-2","article-title":"Influence maximization on signed networks under independent cascade model","volume":"49","author":"Liu Wei","year":"2019","unstructured":"Wei Liu, Xin Chen, Byeungwoo Jeon, Ling Chen, and Bolun Chen. 2019. Influence maximization on signed networks under independent cascade model. Applied Intelligence 49, 3 (Mar. 2019), 912\u2013928.","journal-title":"Applied Intelligence"},{"key":"e_1_3_2_127_2","doi-asserted-by":"crossref","first-page":"3487","DOI":"10.1007\/s10489-020-01747-8","article-title":"Maximum likelihood-based influence maximization in social networks","volume":"50","author":"Liu Wei","year":"2020","unstructured":"Wei Liu, Yun Li, Xin Chen, and Jie He. 2020. Maximum likelihood-based influence maximization in social networks. Applied Intelligence 50 (2020), 3487\u20133502.","journal-title":"Applied Intelligence"},{"issue":"1","key":"e_1_3_2_128_2","doi-asserted-by":"crossref","first-page":"018901","DOI":"10.1088\/1674-1056\/acd3e0","article-title":"Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with L\u00e9vy flight","volume":"33","author":"Lu Pengli","year":"2023","unstructured":"Pengli Lu, Jimao Lan, Jianxin Tang, Li Zhang, Shihui Song, and Hongyu Zhu. 2023. Identifying influential spreaders in social networks: A two-stage quantum-behaved particle swarm optimization with L\u00e9vy flight. Chinese Physics B 33, 1 (Dec. 2023), 018901.","journal-title":"Chinese Physics B"},{"key":"e_1_3_2_129_2","doi-asserted-by":"crossref","first-page":"396","DOI":"10.1007\/s00265-003-0651-y","article-title":"The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations","volume":"54","author":"Lusseau David","year":"2003","unstructured":"David Lusseau, Karsten Schneider, Oliver J. Boisseau, Patti Haase, Elisabeth Slooten, and Steve M. Dawson. 2003. The bottlenose dolphin community of doubtful sound features a large proportion of long-lasting associations. Behavioral Ecology and Sociobiology 54 (2003), 396\u2013405.","journal-title":"Behavioral Ecology and Sociobiology"},{"key":"e_1_3_2_130_2","doi-asserted-by":"crossref","first-page":"105606","DOI":"10.1016\/j.asoc.2019.105606","article-title":"Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer","volume":"83","author":"Ma Lianbo","year":"2019","unstructured":"Lianbo Ma and Ying Liu. 2019. Maximizing three-hop influence spread in social networks using discrete comprehensive learning artificial bee colony optimizer. Applied Soft Computing 83 (2019), 105606.","journal-title":"Applied Soft Computing"},{"issue":"4","key":"e_1_3_2_131_2","first-page":"995","article-title":"Influence maximization in complex networks by using evolutionary deep reinforcement learning","volume":"7","author":"Ma Lijia","year":"2023","unstructured":"Lijia Ma, Zengyang Shao, Xiaocong Li, Qiuzhen Lin, Jianqiang Li, Victor C. M. Leung, and Asoke K. Nandi. 2023. Influence maximization in complex networks by using evolutionary deep reinforcement learning. IEEE Transactions on Emerging Topics in Computational Intelligence 7, 4 (2023), 995\u20131009.","journal-title":"IEEE Transactions on Emerging Topics in Computational Intelligence"},{"key":"e_1_3_2_132_2","volume-title":"Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS \u201920)","author":"Manchanda Sahil","year":"2020","unstructured":"Sahil Manchanda, Akash Mittal, Anuj Dhawan, Sourav Medya, Sayan Ranu, and Ambuj Singh. 2020. GCOMB: Learning budget-constrained combinatorial algorithms over billion-sized graphs. In Proceedings of the 34th International Conference on Neural Information Processing Systems (NIPS \u201920), Curran Associates Inc., Red Hook, NY."},{"issue":"4","key":"e_1_3_2_133_2","doi-asserted-by":"crossref","first-page":"1716","DOI":"10.1109\/TCSS.2024.3473948","article-title":"Diversified budgeted influence maximization in dynamic social networks","volume":"12","author":"Kumar Meena Sunil","year":"2025","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, and Kuldeep Singh. 2025. Diversified budgeted influence maximization in dynamic social networks. IEEE Transactions on Computational Social Systems 12, 4 (2025), 1716\u20131727.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_134_2","doi-asserted-by":"crossref","first-page":"113406","DOI":"10.1016\/j.knosys.2025.113406","article-title":"Pruning-enabled dynamic influence maximization using antlion optimization","volume":"317","author":"Kumar Meena Sunil","year":"2025","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, and Kuldeep Singh. 2025. Pruning-enabled dynamic influence maximization using antlion optimization. Knowledge-Based Systems 317 (2025), 113406.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_135_2","doi-asserted-by":"crossref","first-page":"127445","DOI":"10.1016\/j.eswa.2025.127445","article-title":"Fairness-aware influence maximization: A novel learning automata-based approach","volume":"280","author":"Kumar Meena Sunil","year":"2025","unstructured":"Sunil Kumar Meena, Kuldeep Singh, and Bhaskar Biswas. 2025. Fairness-aware influence maximization: A novel learning automata-based approach. Expert Systems with Applications 280 (2025), 127445.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_136_2","first-page":"383","volume-title":"Proceedings of the International Conference on Neural Information Processing","author":"Kumar Meena Sunil","year":"2024","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, Yogendra Meena, and Kuldeep Singh. 2024. Quantum simulations: A new frontier for influence maximization in social networks. In Proceedings of the International Conference on Neural Information Processing, Springer, 383\u2013396."},{"issue":"4","key":"e_1_3_2_137_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3664618","article-title":"DCDIMB: Dynamic community-based diversified influence maximization using bridge nodes","volume":"18","author":"Kumar Meena Sunil","year":"2024","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, and Kuldeep Singh. 2024. DCDIMB: Dynamic community-based diversified influence maximization using bridge nodes. ACM Transactions on the Web 18, 4 (Oct. 2024), 1\u201332.","journal-title":"ACM Transactions on the Web"},{"key":"e_1_3_2_138_2","first-page":"1676","article-title":"Achieving fair influence maximization: Integrating privacy, diversity, and temporal fairness","volume":"13","author":"Kumar Meena Sunil","year":"2025","unstructured":"Sunil Kumar Meena, Shashank Sheshar Singh, and Kuldeep Singh. 2025. Achieving fair influence maximization: Integrating privacy, diversity, and temporal fairness. IEEE Transactions on Network Science and Engineering 13 (2025), 1676\u20131688.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"key":"e_1_3_2_139_2","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/j.eswa.2018.07.038","article-title":"Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks","volume":"114","author":"\u015eim\u015fek Aybike","year":"2018","unstructured":"Aybike \u015eim\u015fek and Resul Kara. 2018. Using swarm intelligence algorithms to detect influential individuals for influence maximization in social networks. Expert Systems with Applications 114 (2018), 224\u2013236.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_140_2","doi-asserted-by":"crossref","first-page":"127407","DOI":"10.1109\/ACCESS.2021.3112344","article-title":"Research on the dynamic multisocial networks influence maximization problem based on common users","volume":"9","author":"Meng Yanhong","year":"2021","unstructured":"Yanhong Meng, Na Chen, Yunhui Yi, Shuanghong Wang, and Changxing Pei. 2021. Research on the dynamic multisocial networks influence maximization problem based on common users. IEEE Access 9 (2018), 127407\u2013127419.","journal-title":"IEEE Access"},{"issue":"3","key":"e_1_3_2_141_2","doi-asserted-by":"crossref","first-page":"1831","DOI":"10.1007\/s11280-020-00792-0","article-title":"Topic based time-sensitive influence maximization in online social networks","volume":"23","author":"Min Huiyu","year":"2020","unstructured":"Huiyu Min, Jiuxin Cao, Tangfei Yuan, and Bo Liu. 2020. Topic based time-sensitive influence maximization in online social networks. World Wide Web 23, 3 (2020), 1831\u20131859.","journal-title":"World Wide Web"},{"key":"e_1_3_2_142_2","doi-asserted-by":"crossref","first-page":"119174","DOI":"10.1016\/j.ins.2023.119174","article-title":"Fuzzy sign-aware diffusion models for influence maximization in signed social networks","volume":"645","author":"Mohammadi Sohameh","year":"2023","unstructured":"Sohameh Mohammadi, Mohammad H. Nadimi-Shahraki, Zahra Beheshti, and Kamran Zamanifar. 2023. Fuzzy sign-aware diffusion models for influence maximization in signed social networks. Information Sciences 645 (2023), 119174.","journal-title":"Information Sciences"},{"issue":"2","key":"e_1_3_2_143_2","doi-asserted-by":"crossref","first-page":"695","DOI":"10.1007\/s11276-023-03496-1","article-title":"Time and cost-effective online advertising in social internet of things using influence maximization problem","volume":"30","author":"Molaei Reza","year":"2024","unstructured":"Reza Molaei, Kheirollah Rahsepar Fard, and Asgarali Bouyer. 2024. Time and cost-effective online advertising in social internet of things using influence maximization problem. Wireless Networks 30, 2 (2024), 695\u2013710.","journal-title":"Wireless Networks"},{"issue":"3","key":"e_1_3_2_144_2","doi-asserted-by":"crossref","first-page":"e33799","DOI":"10.1371\/journal.pone.0033799","article-title":"Hierarchy measure for complex networks","volume":"7","author":"Mones Enys","year":"2012","unstructured":"Enys Mones, Lilla Vicsek, and Tam\u00e1s Vicsek. 2012. Hierarchy measure for complex networks. PLoS One 7, 3 (2012), e33799.","journal-title":"PLoS One"},{"key":"e_1_3_2_145_2","unstructured":"Newman. 2006. Structure of Internet Routers as of July 22 2006. Retrieved from https:\/\/www.cise.ufl.edu\/research\/sparse\/matrices\/Newman\/as-22july06.html"},{"key":"e_1_3_2_146_2","doi-asserted-by":"crossref","first-page":"016131","DOI":"10.1103\/PhysRevE.64.016131","article-title":"Scientific collaboration networks. I. Network construction and fundamental results","volume":"64","author":"Newman Mark E. J.","year":"2001","unstructured":"Mark E. J. Newman. 2001. Scientific collaboration networks. I. Network construction and fundamental results. Physical Review E 64 (Jun. 2001), 016131.","journal-title":"Physical Review E"},{"key":"e_1_3_2_147_2","doi-asserted-by":"crossref","first-page":"016132","DOI":"10.1103\/PhysRevE.64.016132","article-title":"Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality","volume":"64","author":"Newman Mark E. J.","year":"2001","unstructured":"Mark E. J. Newman. 2001. Scientific collaboration networks. II. Shortest paths, weighted networks, and centrality. Physical Review E 64 (Jun. 2001), 016132.","journal-title":"Physical Review E"},{"key":"e_1_3_2_148_2","doi-asserted-by":"crossref","first-page":"208701","DOI":"10.1103\/PhysRevLett.89.208701","article-title":"Assortative mixing in networks","volume":"89","author":"Newman Mark E. J.","year":"2002","unstructured":"Mark E. J. Newman. 2002. Assortative mixing in networks. Physical Review Letters 89 (Oct. 2002), 208701.","journal-title":"Physical Review Letters"},{"issue":"3","key":"e_1_3_2_149_2","doi-asserted-by":"crossref","first-page":"036104","DOI":"10.1103\/PhysRevE.74.036104","article-title":"Finding community structure in networks using the eigenvectors of matrices","volume":"74","author":"Newman Mark E. J.","year":"2006","unstructured":"Mark E. J. Newman. Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74, 3 (Sep. 2006), 036104.","journal-title":"Physical Review E"},{"key":"e_1_3_2_150_2","doi-asserted-by":"crossref","first-page":"026113","DOI":"10.1103\/PhysRevE.69.026113","article-title":"Finding and evaluating community structure in networks","volume":"69","author":"Newman Mark E. J.","year":"2004","unstructured":"Mark E. J. Newman and M. Girvan. 2004. Finding and evaluating community structure in networks. Physical Review E 69 (Feb. 2004), 026113.","journal-title":"Physical Review E"},{"issue":"4","key":"e_1_3_2_151_2","doi-asserted-by":"crossref","first-page":"2419","DOI":"10.1109\/TNET.2017.2691544","article-title":"A billion-scale approximation algorithm for maximizing benefit in viral marketing","volume":"25","author":"Nguyen Hung T.","year":"2017","unstructured":"Hung T. Nguyen, My T. Thai, and Thang N. Dinh. 2017. A billion-scale approximation algorithm for maximizing benefit in viral marketing. IEEE\/ACM Transactions on Networking 25, 4 (2017), 2419\u20132429.","journal-title":"IEEE\/ACM Transactions on Networking"},{"issue":"6","key":"e_1_3_2_152_2","doi-asserted-by":"crossref","first-page":"1084","DOI":"10.1109\/JSAC.2013.130610","article-title":"On budgeted influence maximization in social networks","volume":"31","author":"Nguyen Huy","year":"2013","unstructured":"Huy Nguyen and Rong Zheng. 2013. On budgeted influence maximization in social networks. IEEE Journal on Selected Areas in Communications 31, 6 (2013), 1084\u20131094.","journal-title":"IEEE Journal on Selected Areas in Communications"},{"issue":"1","key":"e_1_3_2_153_2","first-page":"138","article-title":"Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations","volume":"28","author":"Ohsaka Naoto","year":"2014","unstructured":"Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-Ichi Kawarabayashi. 2014. Fast and accurate influence maximization on large networks with pruned Monte-Carlo simulations. Proceedings of the AAAI Conference on Artificial Intelligence 28, 1 (Jun. 2014), 138\u2013144.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"12","key":"e_1_3_2_154_2","doi-asserted-by":"crossref","first-page":"1077","DOI":"10.14778\/2994509.2994525","article-title":"Dynamic influence analysis in evolving networks","volume":"9","author":"Ohsaka Naoto","year":"2016","unstructured":"Naoto Ohsaka, Takuya Akiba, Yuichi Yoshida, and Ken-Ichi Kawarabayashi. 2016. Dynamic influence analysis in evolving networks. Proceedings of the VLDB Endowment 9, 12 (Aug. 2016), 1077\u20131088.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_155_2","unstructured":"Lawrence Page Sergey Brin Rajeev Motwani and Terry Winograd. November. 1999. The PageRank citation ranking: Bringing order to the web. Technical Report 1999-66. Stanford InfoLab."},{"key":"e_1_3_2_156_2","first-page":"10718","volume-title":"Advances in Neural Information Processing Systems","author":"Binghui Peng","year":"2021","unstructured":"Peng Binghui. 2021. Dynamic influence maximization. In Advances in Neural Information Processing Systems. Marc\u2019Aurelio Ranzato, Alina Beygelzimer, Yann Dauphin, Percy S. Liang, and Jenn Wortman Vaughan (Eds.), Vol. 34, Curran Associates, Inc., 10718\u201310731."},{"issue":"8","key":"e_1_3_2_157_2","doi-asserted-by":"crossref","first-page":"183","DOI":"10.3390\/a13080183","article-title":"Influence maximization with priority in online social networks","volume":"13","author":"Pham Canh V.","year":"2020","unstructured":"Canh V. Pham, Dung K. T. Ha, Quang C. Vu, Anh N. Su, and Huan X. Hoang. 2020. Influence maximization with priority in online social networks. Algorithms 13, 8 (2020), 183.","journal-title":"Algorithms"},{"issue":"2","key":"e_1_3_2_158_2","first-page":"221","article-title":"Influence maximization algorithm: Review on current approaches and limitations","volume":"48","author":"Purba Kristo Radion","year":"2021","unstructured":"Kristo Radion Purba, David Asirvatham, and Raja Kumar Murugesan. 2021. Influence maximization algorithm: Review on current approaches and limitations. Engineering and Applied Science Research 48, 2 (Mar. 2021), 221\u2013229.","journal-title":"Engineering and Applied Science Research"},{"issue":"2","key":"e_1_3_2_159_2","doi-asserted-by":"crossref","first-page":"608","DOI":"10.1109\/TNSE.2021.3127921","article-title":"An influence maximization algorithm based on community-topic features for dynamic social networks","volume":"9","author":"Qin Xi","year":"2022","unstructured":"Xi Qin, Cheng Zhong, and Qingshan Yang. 2022. An influence maximization algorithm based on community-topic features for dynamic social networks. IEEE Transactions on Network Science and Engineering 9, 2 (2022), 608\u2013621.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"2","key":"e_1_3_2_160_2","first-page":"025002","article-title":"Personalized information diffusion in signed social networks","volume":"2","author":"Qu Cunquan","year":"2021","unstructured":"Cunquan Qu, Jialin Bi, and Guanghui Wang. 2021. Personalized information diffusion in signed social networks. Journal of Physics: Complexity 2, 2 (Feb. 2021), 025002.","journal-title":"Journal of Physics: Complexity"},{"key":"e_1_3_2_161_2","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1016\/j.tcs.2020.12.040","article-title":"Matching influence maximization in social networks","volume":"857","author":"Rao Guoyao","year":"2021","unstructured":"Guoyao Rao, Yongcai Wang, Wenping Chen, Deying Li, and Weili Wu. 2021. Matching influence maximization in social networks. Theoretical Computer Science 857 (2021), 71\u201386.","journal-title":"Theoretical Computer Science"},{"issue":"4","key":"e_1_3_2_162_2","doi-asserted-by":"crossref","first-page":"357","DOI":"10.1016\/S0378-8733(00)00031-9","article-title":"Eigenvector-centrality \u2014 a node-centrality","volume":"22","author":"Ruhnau Britta","year":"2000","unstructured":"Britta Ruhnau. 2000. Eigenvector-centrality \u2014 a node-centrality? Social Networks 22, 4 (2000), 357\u2013365.","journal-title":"Social Networks"},{"key":"e_1_3_2_163_2","doi-asserted-by":"crossref","first-page":"100614","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 Chiman","year":"2019","unstructured":"Chiman Salavati and Alireza Abdollahpouri. 2019. Identifying influential nodes based on ant colony optimization to maximize profit in social networks. Swarm and Evolutionary Computation 51 (2019), 100614.","journal-title":"Swarm and Evolutionary Computation"},{"issue":"12","key":"e_1_3_2_164_2","doi-asserted-by":"crossref","first-page":"e0168125","DOI":"10.1371\/journal.pone.0168125","article-title":"Learning from bees: An approach for influence maximization on viral campaigns","volume":"11","author":"Prem Sankar C.","year":"2016","unstructured":"C. Prem Sankar, S. Asharaf, and K. Satheesh Kumar. Learning from bees: An approach for influence maximization on viral campaigns. PLoS ONE 11, 12 (2016), e0168125.","journal-title":"PLoS ONE"},{"issue":"8","key":"e_1_3_2_165_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3653711","article-title":"FairSNA: Algorithmic fairness in social network analysis","volume":"56","author":"Saxena Akrati","year":"2024","unstructured":"Akrati Saxena, George Fletcher, and Mykola Pechenizkiy. 2024. FairSNA: Algorithmic fairness in social network analysis. ACM Computing Surveys 56, 8 (Apr. 2024), 1\u201345.","journal-title":"ACM Computing Surveys"},{"issue":"1","key":"e_1_3_2_166_2","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1007\/s13278-020-00654-7","article-title":"Towards establishing the effect of self-similarity on influence maximization in online social networks","volume":"10","author":"Saxena Bhawna","year":"2020","unstructured":"Bhawna Saxena and Vikas Saxena. 2020. Towards establishing the effect of self-similarity on influence maximization in online social networks. Social Network Analysis and Mining 10, 1 (2020), 35.","journal-title":"Social Network Analysis and Mining"},{"issue":"9","key":"e_1_3_2_167_2","doi-asserted-by":"crossref","first-page":"e13375","DOI":"10.1111\/exsy.13375","article-title":"A Hurst-based diffusion model using time series characteristics for influence maximization in social networks","volume":"40","author":"Saxena Bhawna","year":"2023","unstructured":"Bhawna Saxena, Vikas Saxena, Nishit Anand, Vikas Hassija, Vinay Chamola, and Amir Hussain. 2023. A Hurst-based diffusion model using time series characteristics for influence maximization in social networks. Expert Systems 40, 9 (2023), e13375.","journal-title":"Expert Systems"},{"issue":"2","key":"e_1_3_2_168_2","first-page":"290","article-title":"Egonomics, or the art of self-management","volume":"68","author":"Schelling Thomas C.","year":"1978","unstructured":"Thomas C. Schelling. 1978. Egonomics, or the art of self-management. The American Economic Review 68, 2 (1978), 290\u2013294.","journal-title":"The American Economic Review"},{"key":"e_1_3_2_169_2","doi-asserted-by":"crossref","first-page":"106436","DOI":"10.1016\/j.asoc.2020.106436","article-title":"Identifying influential spreaders using multi-objective artificial bee colony optimization","volume":"94","author":"Sheikhahmadi Amir","year":"2020","unstructured":"Amir Sheikhahmadi and Ahmad Zareie. 2020. Identifying influential spreaders using multi-objective artificial bee colony optimization. Applied Soft Computing 94 (2020), 106436.","journal-title":"Applied Soft Computing"},{"key":"e_1_3_2_170_2","first-page":"801","volume-title":"Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR \u201917","author":"Shen Xiao","year":"2017","unstructured":"Xiao Shen, Fu-Lai Chung, and Sitong Mao. 2017. Leveraging cross-network information for graph sparsification in influence maximization. In Proceedings of the 40th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR \u201917), ACM, New York, NY, 801\u2013804."},{"issue":"9","key":"e_1_3_2_171_2","doi-asserted-by":"crossref","first-page":"2195","DOI":"10.1109\/TFUZZ.2019.2931272","article-title":"Cross-network learning with fuzzy labels for seed selection and graph sparsification in influence maximization","volume":"28","author":"Shen Xiao","year":"2020","unstructured":"Xiao Shen, Sitong Mao, and Fu-Lai Chung. 2020. Cross-network learning with fuzzy labels for seed selection and graph sparsification in influence maximization. IEEE Transactions on Fuzzy Systems 28, 9 (2020), 2195\u20132208.","journal-title":"IEEE Transactions on Fuzzy Systems"},{"key":"e_1_3_2_172_2","doi-asserted-by":"crossref","first-page":"14287","DOI":"10.1007\/s00500-020-05195-x","article-title":"Positive influence maximization in signed social networks under independent cascade model","volume":"24","author":"Sheng Jun","year":"2020","unstructured":"Jun Sheng, Ling Chen, Yixin Chen, Bin Li, and Wei Liu. 2020. Positive influence maximization in signed social networks under independent cascade model. Soft Computing 24 (2020), 14287\u201314303.","journal-title":"Soft Computing"},{"key":"e_1_3_2_173_2","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/j.neucom.2021.04.084","article-title":"Link prediction-based influence maximization in online social networks","volume":"453","author":"Singh Ashwini Kumar","year":"2021","unstructured":"Ashwini Kumar Singh and Lakshmanan Kailasam. 2021. Link prediction-based influence maximization in online social networks. Neurocomputing 453 (2021), 151\u2013163.","journal-title":"Neurocomputing"},{"key":"e_1_3_2_174_2","doi-asserted-by":"crossref","first-page":"796","DOI":"10.1016\/j.physa.2018.09.142","article-title":"C2im: Community-based context-aware influence maximization in social networks","volume":"514","author":"Singh Shashank Sheshar","year":"2019","unstructured":"Shashank Sheshar Singh, Ajay Kumar, Kuldeep Singh, and Bhaskar Biswas. 2019. C2im: Community-based context-aware influence maximization in social networks. Physica A: Statistical Mechanics and Its Applications 514 (2019), 796\u2013818.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"key":"e_1_3_2_175_2","doi-asserted-by":"crossref","first-page":"105554","DOI":"10.1016\/j.asoc.2019.105554","article-title":"LAPSO-IM: A learning-based influence maximization approach for social networks","volume":"82","author":"Singh Shashank Sheshar","year":"2019","unstructured":"Shashank Sheshar Singh, Ajay Kumar, Kuldeep Singh, and Bhaskar Biswas. 2019. LAPSO-IM: A learning-based influence maximization approach for social networks. Applied Soft Computing 82 (2019), 105554.","journal-title":"Applied Soft Computing"},{"issue":"2","key":"e_1_3_2_176_2","doi-asserted-by":"crossref","first-page":"e5421","DOI":"10.1002\/cpe.5421","article-title":"IM-SSO: Maximizing influence in social networks using social spider optimization","volume":"32","author":"Singh Shashank Sheshar","year":"2020","unstructured":"Shashank Sheshar Singh, Ajay Kumar, Kuldeep Singh, and Bhaskar Biswas. 2020. IM-SSO: Maximizing influence in social networks using social spider optimization. Concurrency and Computation: Practice and Experience 32, 2 (2020), e5421.","journal-title":"Concurrency and Computation: Practice and Experience"},{"issue":"8","key":"e_1_3_2_177_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3648470","article-title":"Social network analysis: A survey on process, tools, and application","volume":"56","author":"Singh Shashank Sheshar","year":"2024","unstructured":"Shashank Sheshar Singh, Samya Muhuri, Shivansh Mishra, Divya Srivastava, Harish Kumar Shakya, and Neeraj Kumar. 2024. Social network analysis: A survey on process, tools, and application. ACM Computing Surveys 56, 8 (Apr. 2024), 1\u201339.","journal-title":"ACM Computing Surveys"},{"key":"e_1_3_2_178_2","doi-asserted-by":"crossref","first-page":"120902","DOI":"10.1016\/j.physa.2019.04.138","article-title":"Mim2: Multiple influence maximization across multiple social networks","volume":"526","author":"Singh Shashank Sheshar","year":"2019","unstructured":"Shashank Sheshar Singh, Kuldeep Singh, Ajay Kumar, and Bhaskar Biswas. 2019. Mim2: Multiple influence maximization across multiple social networks. Physica A: Statistical Mechanics and Its Applications 526 (2019), 120902.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"issue":"13","key":"e_1_3_2_179_2","doi-asserted-by":"crossref","first-page":"10181","DOI":"10.1007\/s00500-019-04533-y","article-title":"ACO-IM: Maximizing influence in social networks using ant colony optimization","volume":"24","author":"Singh Shashank Sheshar","year":"2020","unstructured":"Shashank Sheshar Singh, Kuldeep Singh, Ajay Kumar, and Bhaskar Biswas. 2020. ACO-IM: Maximizing influence in social networks using ant colony optimization. Soft Computing 24, 13 (2020), 10181\u201310203.","journal-title":"Soft Computing"},{"issue":"9","key":"e_1_3_2_180_2","doi-asserted-by":"crossref","first-page":"7570","DOI":"10.1016\/j.jksuci.2021.08.009","article-title":"Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study","volume":"34","author":"Singh Shashank Sheshar","year":"2022","unstructured":"Shashank Sheshar Singh, Divya Srivastva, Madhushi Verma, and Jagendra Singh. 2022. Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study. Journal of King Saud University - Computer and Information Sciences 34, 9 (2022), 7570\u20137603.","journal-title":"Journal of King Saud University - Computer and Information Sciences"},{"key":"e_1_3_2_181_2","first-page":"1","volume-title":"Proceedings of the 2014 6th International Conference on Communication Systems and Networks (COMSNETS)","author":"Srinivasan Balaji V.","year":"2014","unstructured":"Balaji V. Srinivasan, Natarajan Anandhavelu, Aseem Dalal, Madhavi Yenugula, Prashanth Srikanthan, and Arijit Layek. 2014. Topic-based targeted influence maximization. In Proceedings of the 2014 6th International Conference on Communication Systems and Networks (COMSNETS), 1\u20136."},{"key":"e_1_3_2_182_2","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1145\/3308560.3317588","volume-title":"Proceedings of the Companion Proceedings of the 2019 World Wide Web Conference (WWW \u201919","author":"Stoica Ana-Andreea","year":"2019","unstructured":"Ana-Andreea Stoica and Augustin Chaintreau. 2019. Fairness in social influence maximization. In Proceedings of the Companion Proceedings of the 2019 World Wide Web Conference (WWW \u201919), ACM, New York, NY, 569\u2013574."},{"key":"e_1_3_2_183_2","volume-title":"Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication (IMCOM \u201916)","author":"Sun Honglin","year":"2016","unstructured":"Honglin Sun, Xiaofeng Gao, Guihai Chen, Jian Gu, and Yongjian Wang. 2016. Multiple influence maximization in social networks. In Proceedings of the 10th International Conference on Ubiquitous Information Management and Communication (IMCOM \u201916), ACM, New York, NY."},{"key":"e_1_3_2_184_2","first-page":"1","article-title":"Influence maximization algorithm based on reverse reachable set","volume":"2021","author":"Chih-Cheng Chen","year":"2021","unstructured":"Chen Chih-Cheng and Sun Gengxin. 2021. Influence maximization algorithm based on reverse reachable set. Mathematical Problems in Engineering 2021 (2021), 1\u201312.","journal-title":"Mathematical Problems in Engineering"},{"key":"e_1_3_2_185_2","volume-title":"Social Network Analysis","author":"Chakraborty Tanmoy","year":"2021","unstructured":"Tanmoy Chakraborty. 2021. Social Network Analysis. Wiley India Pvt. Ltd."},{"key":"e_1_3_2_186_2","first-page":"455","volume-title":"Proceedings of the 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM \u201914)","author":"Tang Fangshuang","year":"2014","unstructured":"Fangshuang Tang, Qi Liu, Hengshu Zhu, Enhong Chen, and Feida Zhu. 2014. Diversified social influence maximization. In Proceedings of the 2014 IEEE\/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM \u201914), 455\u2013459."},{"key":"e_1_3_2_187_2","doi-asserted-by":"crossref","first-page":"104833","DOI":"10.1016\/j.knosys.2019.07.004","article-title":"A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks","volume":"187","author":"Tang Jianxin","year":"2020","unstructured":"Jianxin Tang, Ruisheng Zhang, Ping Wang, Zhili Zhao, Li Fan, and Xin Liu. 2020. A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks. Knowledge-Based Systems 187 (2020), 104833.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_188_2","doi-asserted-by":"crossref","first-page":"477","DOI":"10.1016\/j.physa.2018.09.040","article-title":"Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization","volume":"513","author":"Tang Jianxin","year":"2019","unstructured":"Jianxin Tang, Ruisheng Zhang, Yabing Yao, Fan Yang, Zhili Zhao, Rongjing Hu, and Yongna Yuan. 2019. Identification of top-k influential nodes based on enhanced discrete particle swarm optimization for influence maximization. Physica A: Statistical Mechanics and Its Applications 513 (2019), 477\u2013496.","journal-title":"Physica A: Statistical Mechanics and Its Applications"},{"issue":"6","key":"e_1_3_2_189_2","doi-asserted-by":"crossref","first-page":"1950050","DOI":"10.1142\/S0129183119500505","article-title":"An adaptive discrete particle swarm optimization for influence maximization based on network community structure","volume":"30","author":"Tang Jianxin","year":"2019","unstructured":"Jianxin Tang, Ruisheng Zhang, Yabing Yao, Zhili Zhao, Baoqiang Chai, and Huan Li. 2019. An adaptive discrete particle swarm optimization for influence maximization based on network community structure. International Journal of Modern Physics C 30, 6 (Jan. 2019), 1950050\u20131950066.","journal-title":"International Journal of Modern Physics C"},{"key":"e_1_3_2_190_2","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/j.knosys.2018.06.013","article-title":"Maximizing the spread of influence via the collective intelligence of discrete bat algorithm","volume":"160","author":"Tang Jianxin","year":"2018","unstructured":"Jianxin Tang, Ruisheng Zhang, Yabing Yao, Zhili Zhao, Ping Wang, Huan Li, and Jinliang Yuan. 2018. Maximizing the spread of influence via the collective intelligence of discrete bat algorithm. Knowledge-Based Systems 160 (2018), 88\u2013103.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_191_2","doi-asserted-by":"crossref","first-page":"1539","DOI":"10.1145\/2723372.2723734","volume-title":"Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201915)","author":"Tang Youze","year":"2015","unstructured":"Youze Tang, Yanchen Shi, and Xiaokui Xiao. 2015. Influence maximization in near-linear time: A martingale approach. In Proceedings of the 2015 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201915). ACM, New York, NY, 1539\u20131554."},{"key":"e_1_3_2_192_2","doi-asserted-by":"crossref","first-page":"75","DOI":"10.1145\/2588555.2593670","volume-title":"Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201914","author":"Tang Youze","year":"2014","unstructured":"Youze Tang, Xiaokui Xiao, and Yanchen Shi. 2014. Influence maximization: Near-optimal time complexity meets practical efficiency. In Proceedings of the 2014 ACM SIGMOD International Conference on Management of Data (SIGMOD \u201914), ACM, New York, NY, 75\u201386."},{"key":"e_1_3_2_193_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s41019-020-00117-1","article-title":"Deep reinforcement learning-based approach to tackle topic-aware influence maximization","volume":"5","author":"Tian Shan","year":"2020","unstructured":"Shan Tian, Songsong Mo, Liwei Wang, and Zhiyong Peng. 2020. Deep reinforcement learning-based approach to tackle topic-aware influence maximization. Data Science and Engineering 5 (2020), 1\u201311.","journal-title":"Data Science and Engineering"},{"issue":"2","key":"e_1_3_2_194_2","doi-asserted-by":"crossref","first-page":"130","DOI":"10.26599\/BDMA.2021.9020024","article-title":"A novel influence maximization algorithm for a competitive environment based on social media data analytics","volume":"5","author":"Tong Jie","year":"2022","unstructured":"Jie Tong, Leilei Shi, Lu Liu, John Panneerselvam, and Zixuan Han. 2022. A novel influence maximization algorithm for a competitive environment based on social media data analytics. Big Data Mining and Analytics 5, 2 (2020), 130\u2013139.","journal-title":"Big Data Mining and Analytics"},{"key":"e_1_3_2_195_2","first-page":"5997","volume-title":"Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI \u201919)","author":"Tsang Alan","year":"2019","unstructured":"Alan Tsang, Bryan Wilder, Eric Rice, Milind Tambe, and Yair Zick. 2019. Group-fairness in influence maximization. In Proceedings of the 28th International Joint Conference on Artificial Intelligence (IJCAI \u201919). International Joint Conferences on Artificial Intelligence Organization, 5997\u20136005."},{"issue":"7","key":"e_1_3_2_196_2","doi-asserted-by":"crossref","first-page":"1124","DOI":"10.14778\/3450980.3450981","article-title":"Collective influence maximization for multiple competing products with an awareness-to-influence model","volume":"14","author":"Tsaras Dimitris","year":"2021","unstructured":"Dimitris Tsaras, George Trimponias, Lefteris Ntaflos, and Dimitris Papadias. 2021. Collective influence maximization for multiple competing products with an awareness-to-influence model. Proceedings of the VLDB Endowment 14, 7 (Mar. 2021), 1124\u20131136.","journal-title":"Proceedings of the VLDB Endowment"},{"key":"e_1_3_2_197_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.socnet.2020.12.001","article-title":"Social network analysis: New ethical approaches through collective reflexivity. introduction to the special issue of social networks","volume":"67","author":"Tubaro Paola","year":"2021","unstructured":"Paola Tubaro, Louise Ryan, Antonio A. Casilli, and Alessio D\u2019Angelo. 2021. Social network analysis: New ethical approaches through collective reflexivity. introduction to the special issue of social networks. Social Networks 67 (2021), 1\u20138.","journal-title":"Social Networks"},{"key":"e_1_3_2_198_2","doi-asserted-by":"crossref","first-page":"106692","DOI":"10.1016\/j.knosys.2020.106692","article-title":"Efficient diversified influence maximization with adaptive policies","volume":"213","author":"Wang Can","year":"2021","unstructured":"Can Wang, Qihao Shi, Weizhao Xian, Yan Feng, and Chun Chen. 2021. Efficient diversified influence maximization with adaptive policies. Knowledge-Based Systems 213 (2021), 106692.","journal-title":"Knowledge-Based Systems"},{"issue":"3","key":"e_1_3_2_199_2","doi-asserted-by":"crossref","first-page":"545","DOI":"10.1007\/s10618-012-0262-1","article-title":"Scalable influence maximization for independent cascade model in large-scale social networks","volume":"25","author":"Wang Chi","year":"2012","unstructured":"Chi Wang, Wei Chen, and Yajun Wang. 2012. Scalable influence maximization for independent cascade model in large-scale social networks. Data Mining and Knowledge Discovery 25, 3 (Apr. 2012), 545\u2013576.","journal-title":"Data Mining and Knowledge Discovery"},{"key":"e_1_3_2_200_2","first-page":"1","volume-title":"Proceedings of the 2016 IEEE Global Communications Conference (GLOBECOM)","author":"Wang Chih-Hang","year":"2016","unstructured":"Chih-Hang Wang, Po-Shun Huang, De-Nian Yang, and Wen-Tsuen Chen. 2016. Cross-layer design of influence maximization in mobile social networks. In Proceedings of the 2016 IEEE Global Communications Conference (GLOBECOM), 1\u20137."},{"issue":"8","key":"e_1_3_2_201_2","doi-asserted-by":"crossref","first-page":"1790","DOI":"10.3390\/electronics12081790","article-title":"A multi-objective crow search algorithm for influence maximization in social networks","volume":"12","author":"Wang Ping","year":"2023","unstructured":"Ping Wang and Ruisheng Zhang. 2023. A multi-objective crow search algorithm for influence maximization in social networks. Electronics 12, 8 (2023), 1790.","journal-title":"Electronics"},{"key":"e_1_3_2_202_2","doi-asserted-by":"crossref","first-page":"106944","DOI":"10.1016\/j.knosys.2021.106944","article-title":"Multi-community influence maximization in device-to-device social networks","volume":"221","author":"Wang Xiaofei","year":"2021","unstructured":"Xiaofei Wang, Xu Tong, Hao Fan, Chenyang Wang, Jianxin Li, and Xin Wang. 2021. Multi-community influence maximization in device-to-device social networks. Knowledge-Based Systems 221 (2021), 106944.","journal-title":"Knowledge-Based Systems"},{"issue":"2","key":"e_1_3_2_203_2","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1109\/TKDE.2016.2624734","article-title":"Bring order into the samples: A novel scalable method for influence maximization","volume":"29","author":"Wang Xiaoyang","year":"2017","unstructured":"Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, and Chen Chen. 2017. Bring order into the samples: A novel scalable method for influence maximization. IEEE Transactions on Knowledge and Data Engineering 29, 2 (2021), 243\u2013256.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_204_2","first-page":"367","volume-title":"Proceedings of the 2022 IEEE 38th International Conference on Data Engineering (ICDE)","author":"Wang Yishu","year":"2022","unstructured":"Yishu Wang, Ye Yuan, Wenjie Zhang, Yi Zhang, Xuemin Lin, and Guoren Wang. 2022. Reachability-driven influence maximization in time-dependent road-social networks. In Proceedings of the 2022 IEEE 38th International Conference on Data Engineering (ICDE), 367\u2013379."},{"issue":"9","key":"e_1_3_2_205_2","doi-asserted-by":"crossref","first-page":"5766","DOI":"10.1073\/pnas.082090499","article-title":"A simple model of global cascades on random networks","volume":"99","author":"Watts Duncan J.","year":"2002","unstructured":"Duncan J. Watts. 2002. A simple model of global cascades on random networks. Proceedings of the National Academy of Sciences 99, 9 (2002), 5766\u20135771.","journal-title":"Proceedings of the National Academy of Sciences"},{"issue":"6684","key":"e_1_3_2_206_2","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1038\/30918","article-title":"Collective dynamics of \u2018small-world\u2019 networks","volume":"393","author":"Watts Duncan J.","year":"1998","unstructured":"Duncan J. Watts and Steven H. Strogatz. 1998. Collective dynamics of \u2018small-world\u2019 networks. Nature 393, 6684 (1998), 440\u2013442.","journal-title":"Nature"},{"issue":"10","key":"e_1_3_2_207_2","doi-asserted-by":"crossref","first-page":"4753","DOI":"10.1109\/TKDE.2020.3048414","article-title":"DiffNet++: A neural influence and interest diffusion network for social recommendation","volume":"34","author":"Wu Le","year":"2022","unstructured":"Le Wu, Junwei Li, Peijie Sun, Richang Hong, Yong Ge, and Meng Wang. 2022. DiffNet++: A neural influence and interest diffusion network for social recommendation. IEEE Transactions on Knowledge and Data Engineering 34, 10 (2022), 4753\u20134766.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"4","key":"e_1_3_2_208_2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/3409370","article-title":"Evolving influence maximization in evolving networks","volume":"20","author":"Wu Xudong","year":"2020","unstructured":"Xudong Wu, Luoyi Fu, Zixin Zhang, Huan Long, Jingfan Meng, Xinbing Wang, and Guihai Chen. Evolving influence maximization in evolving networks. ACM Transactions on Internet Technology 20, 4 (Oct. 2020), 1\u201331.","journal-title":"ACM Transactions on Internet Technology"},{"issue":"3","key":"e_1_3_2_209_2","doi-asserted-by":"crossref","first-page":"1321","DOI":"10.3390\/app12031321","article-title":"A hierarchical generative embedding model for influence maximization in attributed social networks","volume":"12","author":"Xie Luodi","year":"2022","unstructured":"Luodi Xie, Huimin Huang, and Qing Du. A hierarchical generative embedding model for influence maximization in attributed social networks. Applied Sciences 12, 3 (2022), 1321.","journal-title":"Applied Sciences"},{"key":"e_1_3_2_210_2","doi-asserted-by":"crossref","first-page":"107497","DOI":"10.1016\/j.knosys.2021.107497","article-title":"Competitive influence maximization considering inactive nodes and community homophily","volume":"233","author":"Xie Xiaoqin","year":"2021","unstructured":"Xiaoqin Xie, Jiahui Li, Yi Sheng, Wei Wang, and Wu Yang. 2021. Competitive influence maximization considering inactive nodes and community homophily. Knowledge-Based Systems 233 (2021), 107497.","journal-title":"Knowledge-Based Systems"},{"key":"e_1_3_2_211_2","first-page":"1","volume-title":"Proceedings of the 3rd International Workshop on Social Influence Analysis (SocInf \u201917)","author":"Yadav Amulya","year":"2017","unstructured":"Amulya Yadav, Aida Rahmattalabi, Ece Kamar, Phebe Vayanos, Milind Tambe, and Venil Loyd Noronha. 2017. Explanation systems for influence maximization algorithms. In Proceedings of the 3rd International Workshop on Social Influence Analysis (SocInf \u201917), 1\u201312."},{"issue":"1","key":"e_1_3_2_212_2","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1007\/s41109-024-00625-3","article-title":"Influence maximization on temporal networks: A review","volume":"9","author":"Yanchenko Eric","year":"2024","unstructured":"Eric Yanchenko, Tsuyoshi Murata, and Petter Holme. 2024. Influence maximization on temporal networks: A review. Applied Network Science 9, 1 (2024), 16.","journal-title":"Applied Network Science"},{"key":"e_1_3_2_213_2","first-page":"1","volume-title":"Artificial Intelligence: Theories and Applications","author":"Yang Wan-Shiou","year":"2012","unstructured":"Wan-Shiou Yang and Shi-Xin Weng. 2012. Application of the ant colony optimization algorithm to competitive viral marketing. In Artificial Intelligence: Theories and Applications. Ilias Maglogiannis, Vassilis Plagianakos, and Ioannis Vlahavas (Eds), Springer, Berlin, 1\u20138."},{"key":"e_1_3_2_214_2","first-page":"1248","volume-title":"Proceedings of the 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA)","volume":"1","author":"Yang Wenjing","year":"2018","unstructured":"Wenjing Yang, Leonardo Brenner, and Alessandro Giua. 2018. Influence maximization by link activation in social networks. In Proceedings of the 2018 IEEE 23rd International Conference on Emerging Technologies and Factory Automation (ETFA), Vol. 1, 1248\u20131251."},{"key":"e_1_3_2_215_2","doi-asserted-by":"crossref","first-page":"169","DOI":"10.1007\/s00521-013-1367-1","article-title":"Cuckoo search: Recent advances and applications","volume":"24","author":"Yang Xin-She","year":"2014","unstructured":"Xin-She Yang and Suash Deb. 2014. Cuckoo search: Recent advances and applications. Neural Computing and Applications 24 (2014), 169\u2013174.","journal-title":"Neural Computing and Applications"},{"key":"e_1_3_2_216_2","doi-asserted-by":"crossref","first-page":"100264","DOI":"10.1016\/j.array.2022.100264","article-title":"Influence maximization in social networks: Theories, methods and challenges","volume":"16","author":"Ye Yuxin","year":"2022","unstructured":"Yuxin Ye, Yunliang Chen, and Wei Han. 2022. Influence maximization in social networks: Theories, methods and challenges. Array 16 (2022), 100264.","journal-title":"Array"},{"issue":"5","key":"e_1_3_2_217_2","first-page":"2208","article-title":"Signed-PageRank: An efficient influence maximization framework for signed social networks","volume":"33","author":"Yin Xiaoyan","year":"2021","unstructured":"Xiaoyan Yin, Xiao Hu, Yanjiao Chen, Xu Yuan, and Baochun Li. 2021. Signed-PageRank: An efficient influence maximization framework for signed social networks. IEEE Transactions on Knowledge and Data Engineering 33, 5 (May 2022), 2208\u20132222.","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"e_1_3_2_218_2","doi-asserted-by":"crossref","first-page":"107169","DOI":"10.1016\/j.asoc.2021.107169","article-title":"Influence-aware graph neural networks","volume":"104","author":"Yu Bin","year":"2021","unstructured":"Bin Yu, Yu Zhang, Yu Xie, Chen Zhang, and Ke Pan. 2021. Influence-aware graph neural networks. Applied Soft Computing 104 (2021), 107169.","journal-title":"Applied Soft Computing"},{"issue":"20","key":"e_1_3_2_219_2","doi-asserted-by":"crossref","first-page":"22475","DOI":"10.1609\/aaai.v38i20.30255","article-title":"Graph bayesian optimization for multiplex influence maximization","volume":"38","author":"Yuan Zirui","year":"2024","unstructured":"Zirui Yuan, Minglai Shao, and Zhiqian Chen. 2024. Graph bayesian optimization for multiplex influence maximization. Proceedings of the AAAI Conference on Artificial Intelligence 38, 20 (May 2024), 22475\u201322483.","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"issue":"1","key":"e_1_3_2_220_2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/s13278-023-01078-9","article-title":"Influence maximization in social networks: a survey of behaviour-aware methods","volume":"13","author":"Zareie Ahmad","year":"2023","unstructured":"Ahmad Zareie and Rizos Sakellariou. 2023. Influence maximization in social networks: a survey of behaviour-aware methods. Social Network Analysis and Mining 13, 1 (2023), 78.","journal-title":"Social Network Analysis and Mining"},{"key":"e_1_3_2_221_2","doi-asserted-by":"crossref","first-page":"112971","DOI":"10.1016\/j.eswa.2019.112971","article-title":"Identification of influential users in social network using gray wolf optimization algorithm","volume":"142","author":"Zareie Ahmad","year":"2020","unstructured":"Ahmad Zareie, Amir Sheikhahmadi, and Mahdi Jalili. 2020. Identification of influential users in social network using gray wolf optimization algorithm. Expert Systems with Applications 142 (2020), 112971.","journal-title":"Expert Systems with Applications"},{"key":"e_1_3_2_222_2","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s10707-020-00419-6","article-title":"Dynamic top-k influence maximization in social networks","volume":"26","author":"Zhang Binbin","year":"2022","unstructured":"Binbin Zhang, Hao Wang, and Leong Hou Uu. 2022. Dynamic top-k influence maximization in social networks. GeoInformatica 26 (2022), 323\u2013346.","journal-title":"GeoInformatica"},{"issue":"6","key":"e_1_3_2_223_2","doi-asserted-by":"crossref","first-page":"3361","DOI":"10.1109\/TCSS.2022.3193583","article-title":"Network dynamic GCN influence maximization algorithm with leader fake labeling mechanism","volume":"10","author":"Zhang Cai","year":"2023","unstructured":"Cai Zhang, Weimin Li, Dingmei Wei, Yanxia Liu, and Zheng Li. 2023. Network dynamic GCN influence maximization algorithm with leader fake labeling mechanism. IEEE Transactions on Computational Social Systems 10, 6 (2023), 3361\u20133369.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_224_2","first-page":"2764","volume-title":"Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201920","author":"Zhang Kaichen","year":"2020","unstructured":"Kaichen Zhang, Jingbo Zhou, Donglai Tao, Panagiotis Karras, Qing Li, and Hui Xiong. 2020. Geodemographic influence maximization. In Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD \u201920), ACM, New York, NY, 2764\u20132774."},{"issue":"2","key":"e_1_3_2_225_2","doi-asserted-by":"crossref","first-page":"1557","DOI":"10.1109\/TNSE.2021.3064828","article-title":"A local-global influence indicator based constrained evolutionary algorithm for budgeted influence maximization in social networks","volume":"8","author":"Zhang Lei","year":"2021","unstructured":"Lei Zhang, Yutong Liu, Fan Cheng, Jianfeng Qiu, and Xingyi Zhang. 2021. A local-global influence indicator based constrained evolutionary algorithm for budgeted influence maximization in social networks. IEEE Transactions on Network Science and Engineering 8, 2 (2021), 1557\u20131570.","journal-title":"IEEE Transactions on Network Science and Engineering"},{"issue":"5","key":"e_1_3_2_226_2","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 Lei","year":"2023","unstructured":"Lei Zhang, Kaicong Ma, Haipeng Yang, Cheng Zhang, Haiping Ma, and Qi Liu. 2023. A search space reduction-based progressive evolutionary algorithm for influence maximization in social networks. IEEE Transactions on Computational Social Systems 10, 5 (2023), 2385\u20132399.","journal-title":"IEEE Transactions on Computational Social Systems"},{"key":"e_1_3_2_227_2","doi-asserted-by":"crossref","first-page":"104","DOI":"10.1016\/j.tcs.2022.06.018","article-title":"Adaptive influence maximization under fixed observation time-step","volume":"928","author":"Zhang Yapu","year":"2022","unstructured":"Yapu Zhang, Shengminjie Chen, Wenqing Xu, and Zhenning Zhang. 2022. Adaptive influence maximization under fixed observation time-step. Theoretical Computer Science 928 (2022), 104\u2013114.","journal-title":"Theoretical Computer Science"},{"key":"e_1_3_2_228_2","doi-asserted-by":"crossref","first-page":"61462","DOI":"10.1109\/ACCESS.2018.2876141","article-title":"Location-aware influence blocking maximization in social networks","volume":"6","author":"Zhu Wenlong","year":"2018","unstructured":"Wenlong Zhu, Wu Yang, Shichang Xuan, Dapeng Man, Wei Wang, and Xiaojiang Du. 2018. Location-aware influence blocking maximization in social networks. IEEE Access 6 (2018), 61462\u201361477.","journal-title":"IEEE Access"},{"key":"e_1_3_2_229_2","doi-asserted-by":"crossref","first-page":"27272","DOI":"10.1109\/ACCESS.2019.2900708","article-title":"Location-based seeds selection for influence blocking maximization in social networks","volume":"7","author":"Zhu Wenlong","year":"2019","unstructured":"Wenlong Zhu, Wu Yang, Shichang Xuan, Dapeng Man, Wei Wang, Xiaojiang Du, and Mohsen Guizani. 2019. Location-based seeds selection for influence blocking maximization in social networks. IEEE Access 7 (2019), 27272\u201327287.","journal-title":"IEEE Access"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3779058","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,13]],"date-time":"2026-01-13T14:54:03Z","timestamp":1768316043000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3779058"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,1,13]]},"references-count":228,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2026,2,28]]}},"alternative-id":["10.1145\/3779058"],"URL":"https:\/\/doi.org\/10.1145\/3779058","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"value":"1556-4681","type":"print"},{"value":"1556-472X","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,1,13]]},"assertion":[{"value":"2025-01-20","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2025-11-20","order":2,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2026-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}