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:

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

Showing 22 citing articles:

Rumor blocking with pertinence set in large graphs
Fangsong Xiang, Jinghao Wang, Yanping Wu, et al.
World Wide Web (2024) Vol. 27, Iss. 1
Closed Access | Times Cited: 4
Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs
Renjie Sun, Yanping Wu, Chen Chen, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022)
Closed Access | Times Cited: 18
Polarity-based graph neural network for sign prediction in signed bipartite graphs
Xianhang Zhang, Hanchen Wang, Jianke Yu, et al.
World Wide Web (2022) Vol. 25, Iss. 2, pp. 471-487
Open Access | Times Cited: 13
Distributed (α, β)-Core Decomposition over Bipartite Graphs
Qing Liu, Xuankun Liao, Xin Huang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 909-921
Closed Access | Times Cited: 6
Efficient Balanced Signed Biclique Search in Signed Bipartite Graphs
Renjie Sun, Yanping Wu, Xiaoyang Wang, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 36, Iss. 3, pp. 1069-1083
Closed Access | Times Cited: 5
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
Persistent Community Search Over Temporal Bipartite Graphs
Mo Li, Zhiran Xie, Linlin Ding
Lecture notes in computer science (2023), pp. 324-339
Closed Access | Times Cited: 3
Efficient Core Maintenance in Large Bipartite Graphs
Wensheng Luo, Qiaoyuan Yang, Yixiang Fang, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 3, pp. 1-26
Closed Access | Times Cited: 3
Efficient continuous kNN join over dynamic high-dimensional data
Nimish Ukey, Guangjian Zhang, Zhengyi Yang, et al.
World Wide Web (2023) Vol. 26, Iss. 6, pp. 3759-3794
Open Access | Times Cited: 2
Maximum Balanced ( k , ϵ )-Bitruss Detection in Signed Bipartite Graph
Kai Hiu Chung, Alexander Zhou, Yue Wang, et al.
Proceedings of the VLDB Endowment (2023) Vol. 17, Iss. 3, pp. 332-344
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
Efficient Reinforcement of Bipartite Networks at Billion Scale
Yizhang He, Kai Wang, Wenjie Zhang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 446-458
Closed Access | Times Cited: 3
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
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
Efficient reachability queries in multi-relation graph: An index-based approach
Xijuan Liu, Mengqi Zhang, Xianming Fu, et al.
Computers & Electrical Engineering (2021) Vol. 96, pp. 107469-107469
Closed Access | Times Cited: 3
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
Efficient Continuous kNN Join over Dynamic High-dimensional Data
Nimish Ukey, Guangjian Zhang, Zhengyi Yang, et al.
Research Square (Research Square) (2023)
Open Access
Efficient Continuous kNN Join over Dynamic High-dimensional Data
Nimish Ukey, Guangjian Zhang, Zhengyi Yang, et al.
Research Square (Research Square) (2023)
Open Access
Efficient Continuous kNN Join over Dynamic High-dimensional Data
Nimish Ukey, Guangjian Zhang, Zhengyi Yang, et al.
Research Square (Research Square) (2023)
Open Access
Efficient Continuous kNN Join over Dynamic High-dimensional Data
Nimish Ukey, Guangjian Zhang, Zhengyi Yang, et al.
Research Square (Research Square) (2023)
Open Access
Efficient Attribute (α,β)-Core Detection in Large Bipartite Graphs (Student Abstract)
Yanping Wu, Renjie Sun, Chen Chen, et al.
Proceedings of the AAAI Conference on Artificial Intelligence (2022) Vol. 36, Iss. 11, pp. 13087-13088
Open Access
CSS on Bipartite Networks
Yixiang Fang, Kai Wang, Xuemin Lin, et al.
SpringerBriefs in computer science (2022), pp. 11-26
Closed Access
Page 1

Scroll to top