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:

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

Showing 1-25 of 30 citing articles:

FIP: A fast overlapping community-based influence maximization algorithm using probability coefficient of global diffusion in social networks
Asgarali Bouyer, Hamid Ahmadi Beni, Bahman Arasteh, et al.
Expert Systems with Applications (2022) Vol. 213, pp. 118869-118869
Closed Access | Times Cited: 48
Determination of influential nodes based on the Communities’ structure to maximize influence in social networks
Farzaneh Kazemzadeh, Ali Safaei, Mitra Mirzarezaee, et al.
Neurocomputing (2023) Vol. 534, pp. 18-28
Closed Access | Times Cited: 30
Influence maximization in social networks using effective community detection
Farzaneh Kazemzadeh, Ali Safaei, Mitra Mirzarezaee
Physica A Statistical Mechanics and its Applications (2022) Vol. 598, pp. 127314-127314
Closed Access | Times Cited: 28
A fast module identification and filtering approach for influence maximization problem in social networks
Hamid Ahmadi Beni, Asgarali Bouyer, Sevda Azimi, et al.
Information Sciences (2023) Vol. 640, pp. 119105-119105
Closed Access | Times Cited: 18
Finding robust and influential nodes on directed networks using a memetic algorithm
Zhaoxi Ou, Shuai Wang
Swarm and Evolutionary Computation (2024) Vol. 87, pp. 101542-101542
Closed Access | Times Cited: 5
DCDIMB: Dynamic Community-based Diversified Influence Maximization using Bridge Nodes
Sunil Kumar Meena, Shashank Sheshar Singh, Kuldeep Singh
ACM Transactions on the Web (2024) Vol. 18, Iss. 4, pp. 1-32
Open Access | Times Cited: 5
Structure-and-embedding-based centrality on network fragility in hypergraphs
L.W. Chang, Tian Qiu, Guang Chen
Chaos An Interdisciplinary Journal of Nonlinear Science (2025) Vol. 35, Iss. 3
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
Identifying top influential spreaders based on the influence weight of layers in multiplex networks
Xiaohui Zhou, Asgarali Bouyer, Morteza Maleki, et al.
Chaos Solitons & Fractals (2023) Vol. 173, pp. 113769-113769
Closed Access | Times Cited: 8
An Improved Influence Maximization Method for Online Advertising in Social Internet of Things
Reza Molaei, Kheirollah Rahsepar Fard, Asgarali Bouyer
Big Data (2023) Vol. 12, Iss. 3, pp. 173-190
Closed Access | Times Cited: 8
Multi-source detection based on neighborhood entropy in social networks
Yanxia Liu, Weimin Li, Chao Yang, et al.
Scientific Reports (2022) Vol. 12, Iss. 1
Open Access | Times Cited: 10
Identifying vital nodes for influence maximization in attributed networks
Ying Wang, Yunan Zheng, Yiguang Liu
Scientific Reports (2022) Vol. 12, Iss. 1
Open Access | Times Cited: 9
Maximizing Influence in Social Networks Using Combined Local Features and Deep Learning-Based Node Embedding
Asgarali Bouyer, Hamid Ahmadi Beni, Amin Golzari Oskouei, et al.
Big Data (2024)
Closed Access | Times Cited: 1
Time and cost-effective online advertising in social Internet of Things using influence maximization problem
Reza Molaei, Kheirollah Rahsepar Fard, Asgarali Bouyer
Wireless Networks (2023) Vol. 30, Iss. 2, pp. 695-710
Closed Access | Times Cited: 4
A New BAT and PageRank Algorithm for Propagation Probability in Social Networks
Wei‐Chang Yeh, Wenbo Zhu, Chia‐Ling Huang, et al.
Applied Sciences (2022) Vol. 12, Iss. 14, pp. 6858-6858
Open Access | Times Cited: 7
Discovering overlapping communities using a new diffusion approach based on core expanding and local depth traveling in social networks
Asgarali Bouyer, Maryam Sabavand Monfared, Esmaeil Nouranı, et al.
International Journal of General Systems (2023) Vol. 52, Iss. 8, pp. 991-1019
Closed Access | Times Cited: 3
Identifying influential nodes based on new layer metrics and layer weighting in multiplex networks
Asgarali Bouyer, Moslem Mohammadi Jenghara, Bahman Arasteh
Knowledge and Information Systems (2023) Vol. 66, Iss. 2, pp. 1011-1035
Closed Access | Times Cited: 3
A new technique for influence maximization on social networks using a moth-flame optimization algorithm
Qi Cui, Feng Liu
Heliyon (2023) Vol. 9, Iss. 11, pp. e22191-e22191
Open Access | Times Cited: 3
Optimal selection of seed nodes by reducing the influence of common nodes in the influence maximization problem
Farzaneh Kazemzadeh, Ali Safaei, Mitra Mirzarezaee
(2022), pp. 1-7
Closed Access | Times Cited: 3
A mathematical multi-objective optimization model and metaheuristic algorithm for effective advertising in the social internet of things
Reza Molaei, Kheirollah Rahsepar Fard, Asgarali Bouyer
Neural Computing and Applications (2024)
Closed Access
A hybrid dynamic memetic algorithm for the influence maximization problem in social networks
Jianxin Tang, Yihui Li
International Journal of Modern Physics C (2024) Vol. 36, Iss. 03
Closed Access
Tuned Linear Threshold Model for Tracking Influential Node in Social Network
VIMAL KUMAR P., C. Balasubramanian
IETE Journal of Research (2024), pp. 1-15
Closed Access
An Efficient Algorithm for Influence Maximization in Signed Social Networks
M Namiranian, Mohammad Reza Meybodi
(2023), pp. 63-73
Closed Access | Times Cited: 1
Identify Initial Nodes for Spreader in A New Diffusion Model Based on Topology (DBT) in Social Networks
Ehsan Khosravi, Fatemeh Yazdanifar, N. Somnath and R.S. Sreenivas E. Salimi, et al.
(2023), pp. 52-57
Closed Access | Times Cited: 1
Solving the influence maximization problem by using entropy and weight of edges
Farzaneh Kazemzadeh, Amir Karian, Mitra Mirzarezaee, et al.
(2022) Vol. 37, pp. 410-414
Closed Access | Times Cited: 2
Page 1 - Next Page

Scroll to top