Open Access Helper

OpenAlex Citation Counts

OpenAlex Citations Logo

OpenAlex is a bibliographic catalogue of scientific papers, authors and institutions accessible in open access mode, named after the Library of Alexandria. It's citation coverage is excellent and I hope you will find utility in this listing of citing articles!

If you click the article title, you'll navigate to the article, as listed in CrossRef. If you click the Open Access links, you'll navigate to the "best Open Access location". Clicking the citation count will open this listing for that article. Lastly at the bottom of the page, you'll find basic pagination options.

Requested Article:

A discrete shuffled frog-leaping algorithm to identify influential nodes for influence maximization in social networks
Jianxin Tang, Ruisheng Zhang, Ping Wang, et al.
Knowledge-Based Systems (2019) Vol. 187, pp. 104833-104833
Closed Access | Times Cited: 100

Showing 1-25 of 100 citing articles:

GMM: A generalized mechanics model for identifying the importance of nodes in complex networks
Fan Liu, Zhen Wang, Yong Deng
Knowledge-Based Systems (2020) Vol. 193, pp. 105464-105464
Closed Access | Times Cited: 96
A systematic survey on influential spreaders identification in complex networks with a focus on K-shell based techniques
Giridhar Maji, Sharmistha Mandal, Soumya Sen
Expert Systems with Applications (2020) Vol. 161, pp. 113681-113681
Closed Access | Times Cited: 85
Influence maximization frameworks, performance, challenges and directions on social network: A theoretical study
Shashank Sheshar Singh, Divya Srivastva, Madhushi Verma, et al.
Journal of King Saud University - Computer and Information Sciences (2021) Vol. 34, Iss. 9, pp. 7570-7603
Open Access | Times Cited: 67
New trends in influence maximization models
Mehdi Azaouzi, Wassim Mnasri, Lotfi Ben Romdhane
Computer Science Review (2021) Vol. 40, pp. 100393-100393
Open Access | Times Cited: 58
The identification of crucial spreaders in complex networks by effective gravity model
Shuyu Li, Fuyuan Xiao
Information Sciences (2021) Vol. 578, pp. 725-749
Closed Access | Times Cited: 56
Identifying Influential Spreaders in Social Networks Through Discrete Moth-Flame Optimization
Lu Wang, Лей Ма, Chao Wang, et al.
IEEE Transactions on Evolutionary Computation (2021) Vol. 25, Iss. 6, pp. 1091-1102
Open Access | Times Cited: 55
An MCDM integrated adaptive simulated annealing approach for influence maximization in social networks
Tarun Kumer Biswas, Alireza Abbasi, Ripon K. Chakrabortty
Information Sciences (2020) Vol. 556, pp. 27-48
Closed Access | Times Cited: 55
A survey on meta-heuristic algorithms for the influence maximization problem in the social networks
Zahra Aghaee, Mohammad Mahdi Ghasemi, Hamid Ahmadi Beni, et al.
Computing (2021) Vol. 103, Iss. 11, pp. 2437-2477
Closed Access | Times Cited: 48
A discrete shuffled frog-leaping algorithm based on heuristic information for traveling salesman problem
Yao Huang, Xiaoning Shen, Xuan You
Applied Soft Computing (2021) Vol. 102, pp. 107085-107085
Closed Access | Times Cited: 42
Investigation of Effectiveness of Shuffled Frog-Leaping Optimizer in Training a Convolution Neural Network
Soroush Baseri Saadi, N. Sarshar, Soroush Sadeghi, et al.
Journal of Healthcare Engineering (2022) Vol. 2022, pp. 1-11
Open Access | Times Cited: 32
TSIFIM: A three-stage iterative framework for influence maximization in complex networks
Chen Dong, Guiqiong Xu, Pingle Yang, et al.
Expert Systems with Applications (2022) Vol. 212, pp. 118702-118702
Closed Access | Times Cited: 32
Influence maximization problem by leveraging the local traveling and node labeling method for discovering most influential nodes in social networks
Asgarali Bouyer, Hamid Ahmadi Beni
Physica A Statistical Mechanics and its Applications (2022) Vol. 592, pp. 126841-126841
Closed Access | Times Cited: 30
Wind speed forecasting using multi-scale feature adaptive extraction ensemble model with error regression correction
Jun Chen, Hui Liu, Chao Chen, et al.
Expert Systems with Applications (2022) Vol. 207, pp. 117358-117358
Closed Access | Times Cited: 30
A multi-objective linear threshold influence spread model solved by swarm intelligence-based methods
Rodrigo Olivares, Francisco Muñoz, Fabián Riquelme
Knowledge-Based Systems (2020) Vol. 212, pp. 106623-106623
Closed Access | Times Cited: 46
A two-stage VIKOR assisted multi-operator differential evolution approach for Influence Maximization in social networks
Tarun Kumer Biswas, Alireza Abbasi, Ripon K. Chakrabortty
Expert Systems with Applications (2021) Vol. 192, pp. 116342-116342
Closed Access | Times Cited: 38
Novel Influence Maximization Algorithm for Social Network Behavior Management
D Sivaganesan
Journal of ISMAC (2021) Vol. 3, Iss. 1, pp. 60-68
Open Access | Times Cited: 36
Identification of influential users with cost minimization via an improved moth flame optimization
Chao Wang, Liangliang Ma, Лей Ма, et al.
Journal of Computational Science (2023) Vol. 67, pp. 101955-101955
Closed Access | Times Cited: 15
A Multi-Transformation Evolutionary Framework for Influence Maximization in Social Networks
Chao Wang, Jiaxuan Zhao, Lingling Li, et al.
IEEE Computational Intelligence Magazine (2023) Vol. 18, Iss. 1, pp. 52-67
Open Access | Times Cited: 15
PHEE: Identifying influential nodes in social networks with a phased evaluation-enhanced search
Enqiang Zhu, Haosen Wang, Yu Zhang, et al.
Neurocomputing (2023) Vol. 572, pp. 127195-127195
Closed Access | Times Cited: 13
Improved shuffled Frog leaping algorithm with unsupervised population partitioning strategies for complex optimization problems
Shikha Mehta
Journal of Combinatorial Optimization (2024) Vol. 47, Iss. 2
Closed Access | Times Cited: 4
MECIM: Multi-entity evolutionary competitive influence maximization in social networks
Ziwei Liang, Jiancong Liu, Hongwei Du, et al.
Expert Systems with Applications (2025), pp. 126436-126436
Closed Access
Maximizing Information Dissemination in Social Network via a Fast Local Search
Tian Li, X. L. Ji, Yupeng Zhou
Systems (2025) Vol. 13, Iss. 1, pp. 59-59
Open Access
A community-based simulated annealing approach with a new structure-based neighborhood search to identify influential nodes in social networks
Farzaneh Rajaee Abyaneh, Nasrollah Moghadam Charkari, Mehdy Roayaei
Soft Computing (2025)
Closed Access
EIM: A Novel Evolutionary Influence Maximizer in Complex Networks
Vahideh Sahargahi, Vahid Majidnezhad, Saeid Taghavi Afshord, et al.
Complexity (2025) Vol. 2025, Iss. 1
Open Access
Bi-objective influence maximization with consideration of node burden
Mingyang Feng, Qi Zhao, Shan He, et al.
Memetic Computing (2025) Vol. 17, Iss. 2
Closed Access
Page 1 - Next Page

Scroll to top