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 12 citing articles:
Trustworthy Graph Neural Networks: Aspects, Methods, and Trends
He Zhang, Bang Ye Wu, Xingliang Yuan, et al.
Proceedings of the IEEE (2024) Vol. 112, Iss. 2, pp. 97-139
Open Access | Times Cited: 30
He Zhang, Bang Ye Wu, Xingliang Yuan, et al.
Proceedings of the IEEE (2024) Vol. 112, Iss. 2, pp. 97-139
Open Access | Times Cited: 30
InFoRM: Individual Fairness on Graph Mining
Jian Kang, Jingrui He, Ross Maciejewski, et al.
(2020), pp. 379-389
Open Access | Times Cited: 81
Jian Kang, Jingrui He, Ross Maciejewski, et al.
(2020), pp. 379-389
Open Access | Times Cited: 81
A Data-Driven Graph Generative Model for Temporal Interaction Networks
Dawei Zhou, Lecheng Zheng, Jiawei Han, et al.
(2020)
Closed Access | Times Cited: 76
Dawei Zhou, Lecheng Zheng, Jiawei Han, et al.
(2020)
Closed Access | Times Cited: 76
Adversarial Attacks and Defenses
Ninghao Liu, Mengnan Du, Ruocheng Guo, et al.
ACM SIGKDD Explorations Newsletter (2021) Vol. 23, Iss. 1, pp. 86-99
Closed Access | Times Cited: 24
Ninghao Liu, Mengnan Du, Ruocheng Guo, et al.
ACM SIGKDD Explorations Newsletter (2021) Vol. 23, Iss. 1, pp. 86-99
Closed Access | Times Cited: 24
Graph Sanitation with Application to Node Classification
Zhe Xu, Boxin Du, Hanghang Tong
Proceedings of the ACM Web Conference 2022 (2022), pp. 1136-1147
Open Access | Times Cited: 17
Zhe Xu, Boxin Du, Hanghang Tong
Proceedings of the ACM Web Conference 2022 (2022), pp. 1136-1147
Open Access | Times Cited: 17
NetTrans: Neural Cross-Network Transformation
Si Zhang, Hanghang Tong, Yinglong Xia, et al.
(2020)
Closed Access | Times Cited: 23
Si Zhang, Hanghang Tong, Yinglong Xia, et al.
(2020)
Closed Access | Times Cited: 23
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
Zuobai Zhang, Zhongzhi Zhang, Guanrong Chen
(2021), pp. 2657-2667
Closed Access | Times Cited: 9
Auditing the Sensitivity of Graph-based Ranking with Visual Analytics
Tiankai Xie, Yuxin Ma, Hanghang Tong, et al.
IEEE Transactions on Visualization and Computer Graphics (2020) Vol. 27, Iss. 2, pp. 1459-1469
Open Access | Times Cited: 7
Tiankai Xie, Yuxin Ma, Hanghang Tong, et al.
IEEE Transactions on Visualization and Computer Graphics (2020) Vol. 27, Iss. 2, pp. 1459-1469
Open Access | Times Cited: 7
On the Sensitivity of Individual Fairness: Measures and Robust Algorithms
Xinyu He, Jian Kang, Ruizhong Qiu, et al.
(2024) Vol. 133, pp. 829-838
Closed Access
Xinyu He, Jian Kang, Ruizhong Qiu, et al.
(2024) Vol. 133, pp. 829-838
Closed Access
Algorithmic Fairness on Graphs
Jian Kang, Hanghang Tong
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2022), pp. 4798-4799
Closed Access | Times Cited: 2
Jian Kang, Hanghang Tong
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2022), pp. 4798-4799
Closed Access | Times Cited: 2
Maximizing the Smallest Eigenvalue of Grounded Laplacian Matrix
Run Wang, Xiaotian Zhou, Wei Li, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
Run Wang, Xiaotian Zhou, Wei Li, et al.
arXiv (Cornell University) (2021)
Open Access | Times Cited: 2
Auditing the Sensitivity of Graph-based Ranking with Visual Analytics
Tiankai Xie, Yuxin Ma, Hanghang Tong, et al.
arXiv (Cornell University) (2020)
Open Access
Tiankai Xie, Yuxin Ma, Hanghang Tong, et al.
arXiv (Cornell University) (2020)
Open Access
