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:
K-Core Minimization: A Game Theoretic Approach
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Showing 8 citing articles:
K-Core Maximization: An Edge Addition Approach
Zhongxin Zhou, Fan Zhang, Xuemin Lin, et al.
(2019), pp. 4867-4873
Open Access | Times Cited: 38
Zhongxin Zhou, Fan Zhang, Xuemin Lin, et al.
(2019), pp. 4867-4873
Open Access | Times Cited: 38
A Game Theoretic Approach For Core Resilience
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
(2020), pp. 3473-3479
Open Access | Times Cited: 18
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
(2020), pp. 3473-3479
Open Access | Times Cited: 18
Finding Critical Users in Social Communities via Graph Convolutions
Kangfei Zhao, Zhiwei Zhang, Yu Rong, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Closed Access | Times Cited: 12
Kangfei Zhao, Zhiwei Zhang, Yu Rong, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Closed Access | Times Cited: 12
Residual Core Maximization: An Efficient Algorithm for Maximizing the Size of the k-Core
Ricky Laishram, Ahmet Erdem Sar, Tina Eliassi‐Rad, et al.
Society for Industrial and Applied Mathematics eBooks (2020), pp. 325-333
Open Access | Times Cited: 12
Ricky Laishram, Ahmet Erdem Sar, Tina Eliassi‐Rad, et al.
Society for Industrial and Applied Mathematics eBooks (2020), pp. 325-333
Open Access | Times Cited: 12
Manipulating Node Similarity Measures in Networks
Palash Dey, Sourav Medya
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Palash Dey, Sourav Medya
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
A Dynamic Model of Network Formation: Network Participation Game and Network Sharing Game
Ahmed Luqman, Hassan Jaleel
2022 European Control Conference (ECC) (2024), pp. 774-779
Closed Access
Ahmed Luqman, Hassan Jaleel
2022 European Control Conference (ECC) (2024), pp. 774-779
Closed Access
K-Core Maximization through Edge Additions
Zhongxin Zhou, Fan Zhang, Xuemin Lin, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 1
Zhongxin Zhou, Fan Zhang, Xuemin Lin, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 1
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
Longxu Sun, Xin Huang, Rong-Hua Li, et al.
arXiv (Cornell University) (2019)
Open Access
Longxu Sun, Xin Huang, Rong-Hua Li, et al.
arXiv (Cornell University) (2019)
Open Access
