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:

Eigen-Optimization on Large Graphs by Edge Manipulation
Chen Chen, Hanghang Tong, B. Aditya Prakash, et al.
ACM Transactions on Knowledge Discovery from Data (2016) Vol. 10, Iss. 4, pp. 1-30
Open Access | Times Cited: 53

Showing 1-25 of 53 citing articles:

Graph Vulnerability and Robustness: A Survey
Scott Freitas, Diyi Yang, Srijan Kumar, et al.
IEEE Transactions on Knowledge and Data Engineering (2022), pp. 1-1
Open Access | Times Cited: 77
Interactive Anomaly Detection on Attributed Networks
Kaize Ding, Jundong Li, Huan Liu
(2019)
Open Access | Times Cited: 126
Adversarial Attacks on Node Embeddings via Graph Poisoning
Aleksandar Bojchevski, Stephan Günnemann
arXiv (Cornell University) (2018)
Open Access | Times Cited: 89
Finding the key nodes to minimize the victims of the malicious information in complex network
Mingyang Zhou, Hongwu Liu, Hao Liao, et al.
Knowledge-Based Systems (2024) Vol. 293, pp. 111632-111632
Closed Access | Times Cited: 7
K-core Minimization
Weijie Zhu, Chen Chen, Xiaoyang Wang, et al.
(2018)
Closed Access | Times Cited: 40
To Design Scalable Free Energy Perturbation Networks, Optimal Is Not Enough
Mary Pitman, David F. Hahn, Gary Tresadern, et al.
Journal of Chemical Information and Modeling (2023) Vol. 63, Iss. 6, pp. 1776-1793
Closed Access | Times Cited: 10
Fighting Opinion Control in Social Networks via Link Recommendation
Victor Amelkin, Ambuj K. Singh
(2019)
Open Access | Times Cited: 28
Efficient critical relationships identification in bipartite networks
Chen Chen, Qiuyu Zhu, Yanping Wu, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 741-761
Closed Access | Times Cited: 22
Edge Manipulation Approaches for K-core Minimization: Metrics and Analytics
Chen Chen, Qiuyu Zhu, Renjie Sun, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Closed Access | Times Cited: 21
Towards Optimal Connectivity on Multi-Layered Networks
Chen Chen, Jingrui He, Nadya Bliss, et al.
IEEE Transactions on Knowledge and Data Engineering (2017) Vol. 29, Iss. 10, pp. 2332-2346
Open Access | Times Cited: 24
Transient Dynamics of Epidemic Spreading and Its Mitigation on Large Networks
Chul‐Ho Lee, Srinivas Tenneti, Do Young Eun
(2019) Vol. 60, pp. 191-200
Open Access | Times Cited: 21
DeepEC: Adversarial attacks against graph structure prediction models
Xingping Xian, Tao Wu, Shaojie Qiao, et al.
Neurocomputing (2020) Vol. 437, pp. 168-185
Closed Access | Times Cited: 20
On the sensitivity of centrality metrics
Lucia Cavallaro, Pasquale De Meo, Giacomo Fiumara, et al.
PLoS ONE (2024) Vol. 19, Iss. 5, pp. e0299255-e0299255
Open Access | Times Cited: 2
Network Connectivity Optimization
Chen Chen, Ruiyue Peng, Lei Ying, et al.
(2018), pp. 1167-1176
Open Access | Times Cited: 18
A Spectral Method for Unsupervised Multi-Document Summarization
Kexiang Wang, Baobao Chang, Zhifang Sui
(2020), pp. 435-445
Open Access | Times Cited: 14
N2N
Jian Kang, Hanghang Tong
(2019), pp. 861-870
Open Access | Times Cited: 12
Social interactions and the prophylaxis of SI epidemics on networks
Géraldine Bouveret, Antoine Mandel
Journal of Mathematical Economics (2021) Vol. 93, pp. 102486-102486
Open Access | Times Cited: 10
Network Connectivity Under a Probabilistic Node Failure Model
Lucia Cavallaro, Stefania Costantini, Pasquale De Meo, et al.
IEEE Transactions on Network Science and Engineering (2022) Vol. 9, Iss. 4, pp. 2463-2480
Open Access | Times Cited: 7
Minimizing Spectral Radius of Non-Backtracking Matrix by Edge Removal
Zuobai Zhang, Zhongzhi Zhang, Guanrong Chen
(2021), pp. 2657-2667
Closed Access | Times Cited: 9
Optimization on the smallest eigenvalue of grounded Laplacian matrix via edge addition
Xiaotian Zhou, Haoxin Sun, Wei Li, et al.
Theoretical Computer Science (2023) Vol. 980, pp. 114220-114220
Open Access | Times Cited: 3
Altruism Design in Networked Public Goods Games
Sixie Yu, David Kempe, Yevgeniy Vorobeychik
(2021), pp. 493-499
Open Access | Times Cited: 8
Generative Graph Models based on Laplacian Spectra?
Alana Shine, David Kempe
(2019), pp. 1691-1701
Closed Access | Times Cited: 7
Reliability Maximization in Uncertain Graphs
Xiangyu Ke, Arijit Khan, Mohammad Al Hasan, et al.
IEEE Transactions on Knowledge and Data Engineering (2020) Vol. 34, Iss. 2, pp. 894-913
Open Access | Times Cited: 7
Assessing Percolation Threshold Based on High-Order Non-Backtracking Matrices
Lin Yuan, Wei Chen, Zhongzhi Zhang
(2017), pp. 223-232
Open Access | Times Cited: 6
Measures and Optimization for Robustness and Vulnerability in Disconnected Networks
Liwang Zhu, Qi Bao, Zhongzhi Zhang
IEEE Transactions on Information Forensics and Security (2023) Vol. 18, pp. 3350-3362
Open Access | Times Cited: 2
Page 1 - Next Page

Scroll to top