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:

Showing 1-25 of 28 citing articles:

Rewiring What-to-Watch-Next Recommendations to Reduce Radicalization Pathways
Francesco Fabbri, Yanhao Wang, Francesco Bonchi, et al.
Proceedings of the ACM Web Conference 2022 (2022), pp. 2719-2728
Open Access | Times Cited: 23
Diffusion Containment in Complex Networks Through Collective Influence of Connections
Yang Liu, Guangbo Liang, Xi Wang, et al.
IEEE Transactions on Information Forensics and Security (2023) Vol. 19, pp. 1510-1524
Closed Access | Times Cited: 12
Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs
Xiaotian Zhou, Haoxin Sun, Wanyue Xu, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 12, pp. 8313-8327
Open Access | Times Cited: 2
Link Recommendations for PageRank Fairness
Sotiris Tsioutsiouliklis, Evaggelia Pitoura, Konstantinos Semertzidis, et al.
Proceedings of the ACM Web Conference 2022 (2022)
Open Access | Times Cited: 10
A Nearly-Linear Time Algorithm for Minimizing Risk of Conflict in Social Networks
Liwang Zhu, Zhongzhi Zhang
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2022), pp. 2648-2656
Open Access | Times Cited: 9
Opinion Dynamics Optimization by Varying Susceptibility to Persuasion via Non-Convex Local Search
Rediet Abebe, T-H. Hubert Chan, Jon Kleinberg, et al.
ACM Transactions on Knowledge Discovery from Data (2021) Vol. 16, Iss. 2, pp. 1-34
Open Access | Times Cited: 11
A Sublinear Time Algorithm for Opinion Optimization in Directed Social Networks via Edge Recommendation
Xiaotian Zhou, Liwang Zhu, Wei Li, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 3593-3602
Closed Access | Times Cited: 4
Maximizing Influence of Leaders in Social Networks
Xiaotian Zhou, Zhongzhi Zhang
(2021), pp. 2400-2408
Open Access | Times Cited: 10
Approximate Algorithms for Data-driven Influence Limitation
Sourav Medya, Arlei Silva, Ambuj K. Singh
IEEE Transactions on Knowledge and Data Engineering (2020) Vol. 34, Iss. 6, pp. 2641-2652
Closed Access | Times Cited: 10
Susceptible user search for defending opinion manipulation
Wenyi Tang, Ling Tian, Xu Zheng, et al.
Future Generation Computer Systems (2020) Vol. 115, pp. 531-541
Open Access | Times Cited: 10
Altruism Design in Networked Public Goods Games
Sixie Yu, David Kempe, Yevgeniy Vorobeychik
(2021), pp. 493-499
Open Access | Times Cited: 8
Manipulating Node Similarity Measures in Networks
Palash Dey, Sourav Medya
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Recommending Links to Control Elections via Social Influence
Federico Corò, Gianlorenzo D’Angelo, Yllka Velaj
Algorithms (2019) Vol. 12, Iss. 10, pp. 207-207
Open Access | Times Cited: 6
Mitigating Filter Bubbles Under a Competitive Diffusion Model
Prithu Banerjee, Wei Chen, Laks V. S. Lakshmanan
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 2, pp. 1-26
Closed Access | Times Cited: 2
Improving Fairness in Information Exposure by Adding Links
Ruben Becker, Gianlorenzo D’Angelo, Sajjad Ghobadi
Proceedings of the AAAI Conference on Artificial Intelligence (2023) Vol. 37, Iss. 12, pp. 14119-14126
Open Access | Times Cited: 2
Workplace Recommendation with Temporal Network Objectives
Kiran Tomlinson, J. Neville, Longqi Yang, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 4958-4969
Closed Access | Times Cited: 2
Reducing Exposure to Harmful Content via Graph Rewiring
Corinna Coupette, Stefan Neumann, Aristides Gionis
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 323-334
Open Access | Times Cited: 2
Defending Against Malicious Influence Control in Online Leader-Follower Social Networks
Liwang Zhu, Xiaotian Zhou, Jiahe Tian, et al.
IEEE Transactions on Information Forensics and Security (2024) Vol. 19, pp. 4809-4819
Closed Access
Minimizing Hitting Time between Disparate Groups with Shortcut Edges
Florian Adriaens, Honglian Wang, Aristides Gionis
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 1-10
Open Access | Times Cited: 1
Minimizing Polarization in Noisy Leader-Follower Opinion Dynamics
Wanyue Xu, Zhongzhi Zhang
(2023), pp. 2856-2865
Open Access | Times Cited: 1
Robust Opinion Control Under Network Perturbation
Yuejiang Li, Zhanjiang Chen, H. Vicky Zhao
IEEE Signal Processing Letters (2022) Vol. 29, pp. 1649-1653
Closed Access | Times Cited: 2
Zombie politics: evolutionary algorithms to counteract the spread of negative opinions
Ronald Hochreiter, Christoph Waldhauser
Soft Computing (2019) Vol. 24, Iss. 1, pp. 591-601
Closed Access | Times Cited: 1
An Adversarial Dynamic Game to Controlling Information Diffusion under Typical Strategies on Online Social Networks
Yifan Liu, Ruinan Zeng, Lili Chen, et al.
Frontiers in Physics (2022) Vol. 10
Open Access | Times Cited: 1
Altruism Design in Networked Public Goods Games
Sixie Yu, David Kempe, Yevgeniy Vorobeychik
arXiv (Cornell University) (2021)
Open Access | Times Cited: 1
POTION : Optimizing Graph Structure for Targeted Diffusion
Sixie Yu, Leo Torres, Scott Alfeld, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 154-162
Open Access | Times Cited: 1
Page 1 - Next Page

Scroll to top