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:

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

Showing 21 citing articles:

Efficient Top-k Vulnerable Nodes Detection in Uncertain Graphs
Dawei Cheng, Chen Chen, Xiaoyang Wang, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Open Access | Times Cited: 23
Maximum Signed Θ-Clique Identification in Large Signed Graphs
Chen Chen, Yanping Wu, Renjie Sun, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Closed Access | Times Cited: 15
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
Clique Identification in Signed Graphs: A Balance Theory Based Model
Renjie Sun, Yanping Wu, Xiaoyang Wang, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 12, pp. 12513-12527
Closed Access | Times Cited: 6
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
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
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
Efficient Algorithm for Maximizing Betweenness Centrality in Large Networks
Lele Zhang, Yanping Wu, Jinghao Wang, et al.
(2023)
Closed Access | Times Cited: 2
MONA: An Efficient and Scalable Strategy for Targeted k-Nodes Collapse
Yuqian Lv, Bo Zhou, Jinhuan Wang, et al.
IEEE Transactions on Circuits & Systems II Express Briefs (2024) Vol. 71, Iss. 6, pp. 3106-3110
Open Access
Targeted k-node collapse problem: Towards understanding the robustness of local k-core structure
Yuqian Lv, Bo Zhou, Jinhuan Wang, et al.
Physica A Statistical Mechanics and its Applications (2024) Vol. 641, pp. 129732-129732
Closed Access
Discovering critical vertices for reinforcement of large-scale bipartite networks
Yizhang He, Kai Wang, Wenjie Zhang, et al.
The VLDB Journal (2024) Vol. 33, Iss. 6, pp. 1861-1886
Closed Access
Edge-Based Minimal k-Core Subgraph Search
Wang Ting, Yu Jiang, Jianye Yang, et al.
Mathematics (2023) Vol. 11, Iss. 15, pp. 3407-3407
Open Access | Times Cited: 1
Improving the core resilience of real-world hypergraphs
Manh Tuan, Kijung Shin
Data Mining and Knowledge Discovery (2023) Vol. 37, Iss. 6, pp. 2438-2493
Open Access | Times Cited: 1
Cohesive Subgraph Identification in Weighted Bipartite Graphs
Xijuan Liu, Xiaoyang Wang
Applied Sciences (2021) Vol. 11, Iss. 19, pp. 9051-9051
Open Access | Times Cited: 3
Personalized Influential Community Search in Large Networks: A K-ECC-Based Model
Meng Shi, Hao Yang, Xijuan Liu, et al.
Discrete Dynamics in Nature and Society (2021) Vol. 2021, pp. 1-10
Open Access | Times Cited: 2
Critical Nodes Identification in Large Networks: An Inclination-Based Model
Chen Chen, Xijuan Liu, Xu Shuangyan, et al.
Lecture notes in computer science (2021), pp. 453-468
Closed Access | Times Cited: 2
Stable Community Detection in Signed Social Networks (Extended abstract)
Renjie Sun, Chen Chen, Xiaoyang Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 1495-1496
Closed Access | Times Cited: 1
Targeted K-Node Collapse Problem: Towards Understanding the Robustness of Local K-Core Structure
Yuqian Lv, Zhou Bo, Jinhuan Wang, et al.
(2023)
Open Access
Higher-Order Peak Decomposition
Xingyu Tan, Jingya Qian, Chen Chen, et al.
(2023), pp. 4310-4314
Closed Access
KGNIE: A Learning Method for Estimating Node Importance in Knowledge Graphs
Yin Chen, Jianke Yu, Qing Sima, et al.
(2023)
Closed Access
Page 1

Scroll to top