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:

K-core Minimization
Weijie Zhu, Chen Chen, Xiaoyang Wang, et al.
(2018)
Closed Access | Times Cited: 40

Showing 1-25 of 40 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
K-Core Maximization: An Edge Addition Approach
Zhongxin Zhou, Fan Zhang, Xuemin Lin, et al.
(2019), pp. 4867-4873
Open Access | Times Cited: 38
Efficient Personalized Influential Community Search in Large Networks
Yanping Wu, Jun Zhao, Renjie Sun, et al.
Data Science and Engineering (2021) Vol. 6, Iss. 3, pp. 310-322
Open Access | Times Cited: 24
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
Targeted Filter Bubbles Mitigating via Edges Insertion
Yanping Wu, Jinghao Wang, Renjie Sun, et al.
(2024), pp. 734-737
Open Access | Times Cited: 2
A Game Theoretic Approach For Core Resilience
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
(2020), pp. 3473-3479
Open Access | Times Cited: 18
Index-Based Intimate-Core Community Search in Large Weighted Graphs
Longxu Sun, Xin Huang, Rong-Hua Li, et al.
IEEE Transactions on Knowledge and Data Engineering (2020) Vol. 34, Iss. 9, pp. 4313-4327
Closed Access | Times Cited: 16
Attacking the Core Structure of Complex Network
Bo Zhou, Yuqian Lv, Jinhuan Wang, et al.
IEEE Transactions on Computational Social Systems (2022) Vol. 10, Iss. 4, pp. 1428-1442
Closed Access | Times Cited: 10
Maximum Signed (k,r)-Truss Identification in Signed Networks
Yanping Wu, Renjie Sun, Chen Chen, et al.
(2020), pp. 3337-3340
Closed Access | Times Cited: 14
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
Fast algorithms for core maximization on large graphs
Xin Sun, Xin Huang, Di Jin
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 7, pp. 1350-1362
Closed Access | Times Cited: 8
Hypercore decomposition for non-fragile hyperedges: concepts, algorithms, observations, and applications
Fanchen Bu, Geon Lee, Kijung Shin
Data Mining and Knowledge Discovery (2023) Vol. 37, Iss. 6, pp. 2389-2437
Open Access | Times Cited: 4
Optimizing Network Resilience via Vertex Anchoring
Siyi Teng, Jiadong Xie, Fan Zhang, et al.
Proceedings of the ACM Web Conference 2022 (2024), pp. 606-617
Closed Access | Times Cited: 1
Robustness analysis of multi-dependency networks: k-core percolation and deliberate attacks
Lili Zhou, Haibin Liao, Fei Tan, et al.
Chaos Solitons & Fractals (2024) Vol. 188, pp. 115559-115559
Closed Access | Times Cited: 1
Critical Nodes Identification in Large Networks: The Inclined and Detached Models
Renjie Sun, Chen Chen, Xijuan Liu, et al.
World Wide Web (2022) Vol. 25, Iss. 3, pp. 1315-1341
Closed Access | Times Cited: 7
K-Core Minimization: A Game Theoretic Approach
Sourav Medya, Tiyani Ma, Arlei Silva, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Manipulating Node Similarity Measures in Networks
Palash Dey, Sourav Medya
arXiv (Cornell University) (2019)
Open Access | Times Cited: 8
Locating pivotal connections: the K-Truss minimization and maximization problems
Chen Chen, Mengqi Zhang, Renjie Sun, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 899-926
Closed Access | Times Cited: 7
Efficient Adoption Maximization in Multi-layer Social Networks
Shuntong Chen, Huaien Qian, Yanping Wu, et al.
2021 International Conference on Data Mining Workshops (ICDMW) (2019)
Closed Access | Times Cited: 6
On Breaking Truss-Based Communities
Huiping Chen, Alessio Conte, Roberto Grossi, et al.
(2021), pp. 117-126
Open Access | Times Cited: 6
Budget-constrained Truss Maximization over Large Graphs
Xin Sun, Xin Huang, Zitan Sun, et al.
(2021)
Closed Access | Times Cited: 6
Quantifying Node Importance over Network Structural Stability
Fan Zhang, Qingyuan Linghu, Jiadong Xie, et al.
Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (2023), pp. 3217-3228
Closed Access | Times Cited: 2
Fast Algorithms for Intimate-Core Group Search in Weighted Graphs
Longxu Sun, Xin Huang, Rong-Hua Li, et al.
Lecture notes in computer science (2019), pp. 728-744
Closed Access | Times Cited: 4
A Game Theoretic Approach For k-Core Minimization
Sourav Medya, Tianyi Ma, Arlei Silva, et al.
Adaptive Agents and Multi-Agents Systems (2020), pp. 1922-1924
Closed Access | Times Cited: 4
Page 1 - Next Page

Scroll to top