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:
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
Renjie Sun, Yanping Wu, Chen Chen, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022)
Closed Access | Times Cited: 18
Showing 18 citing articles:
k-Balanced Biclique Partition on Signed Bipartite Graphs
Yifei Li, Donghua Yang, Jianzhong Li
Lecture notes in computer science (2025), pp. 78-90
Closed Access
Yifei Li, Donghua Yang, Jianzhong Li
Lecture notes in computer science (2025), pp. 78-90
Closed Access
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: 7
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: 7
Efficient Maximum Signed Biclique Identification
Renjie Sun, Chen Chen, Xiaoyang Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023)
Closed Access | Times Cited: 7
Renjie Sun, Chen Chen, Xiaoyang Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023)
Closed Access | Times Cited: 7
Friedkin-Johnsen Model for Opinion Dynamics on Signed Graphs
Xiaotian Zhou, Haoxin Sun, Wanyue Xu, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 12, pp. 8313-8327
Open Access | Times Cited: 2
Xiaotian Zhou, Haoxin Sun, Wanyue Xu, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 12, pp. 8313-8327
Open Access | Times Cited: 2
Efficient Maximal Temporal Plex Enumeration
Yanping Wu, Renjie Sun, Xiaoyang Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 3098-3110
Closed Access | Times Cited: 2
Yanping Wu, Renjie Sun, Xiaoyang Wang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 3098-3110
Closed Access | Times Cited: 2
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
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
Balanced Butterfly Counting in Bipartite-Network
Apurba Das, Aman Abidi, Mekala Kiran, et al.
Research Square (Research Square) (2024)
Open Access | Times Cited: 1
Apurba Das, Aman Abidi, Mekala Kiran, et al.
Research Square (Research Square) (2024)
Open Access | Times Cited: 1
Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs
Jianhua Wang, Jianye Yang, Zhaoquan Gu, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 9, pp. 4618-4631
Closed Access | Times Cited: 1
Jianhua Wang, Jianye Yang, Zhaoquan Gu, et al.
IEEE Transactions on Knowledge and Data Engineering (2024) Vol. 36, Iss. 9, pp. 4618-4631
Closed Access | Times Cited: 1
Algorithm for Mining Maximal Balanced Bicliques using Formal Concept Analysis
Sadriddinov Ilkhomjon Rovshan Ugli, Sony Peng, Sophort Siet, et al.
IEEE Access (2024) Vol. 13, pp. 35113-35123
Open Access | Times Cited: 1
Sadriddinov Ilkhomjon Rovshan Ugli, Sony Peng, Sophort Siet, et al.
IEEE Access (2024) Vol. 13, pp. 35113-35123
Open Access | Times Cited: 1
Accelerating Biclique Counting on GPU
Linshan Qiu, Zhonggen Li, Xiangyu Ke, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 3191-3203
Open Access | Times Cited: 1
Linshan Qiu, Zhonggen Li, Xiangyu Ke, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 3191-3203
Open Access | Times Cited: 1
Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs
Yiwei Zhao, Zi Chen, Chen Chen, et al.
IEEE Transactions on Knowledge and Data Engineering (2022), pp. 1-14
Closed Access | Times Cited: 6
Yiwei Zhao, Zi Chen, Chen Chen, et al.
IEEE Transactions on Knowledge and Data Engineering (2022), pp. 1-14
Closed Access | Times Cited: 6
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
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
AMBEA: Aggressive Maximal Biclique Enumeration in Large Bipartite Graph Computing
Zhe Pan, Xu Li, Shuibing He, et al.
IEEE Transactions on Computers (2024) Vol. 73, Iss. 12, pp. 2664-2677
Closed Access
Zhe Pan, Xu Li, Shuibing He, et al.
IEEE Transactions on Computers (2024) Vol. 73, Iss. 12, pp. 2664-2677
Closed Access
Efficient p-Biclique Query on Large Bipartite Networks
Zhizhi Gao, Deming Chu, Fan Zhang, et al.
Lecture notes in computer science (2024), pp. 203-214
Closed Access
Zhizhi Gao, Deming Chu, Fan Zhang, et al.
Lecture notes in computer science (2024), pp. 203-214
Closed Access
Efficient Maximum Vertex (k,ℓ)-Biplex Computation on Bipartite Graphs
Hui Zhou, Shengxin Liu, Ruidi Cao
Tsinghua Science & Technology (2024) Vol. 30, Iss. 2, pp. 569-584
Closed Access
Hui Zhou, Shengxin Liu, Ruidi Cao
Tsinghua Science & Technology (2024) Vol. 30, Iss. 2, pp. 569-584
Closed Access
Efficient counting of balanced (2, k)-bicliques in Signed Bipartite Graphs
Mekala Kiran, Apurba Das, Suman Banerjee
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 735-740
Closed Access
Mekala Kiran, Apurba Das, Suman Banerjee
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 735-740
Closed Access
Balanced Hop-Constrained Path Enumeration in Signed Directed Graphs
Zhiyang Tang, Jinghao Wang, Yanping Wu, et al.
Lecture notes in computer science (2023), pp. 315-328
Closed Access | Times Cited: 1
Zhiyang Tang, Jinghao Wang, Yanping Wu, et al.
Lecture notes in computer science (2023), pp. 315-328
Closed Access | Times Cited: 1
Higher-Order Peak Decomposition
Xingyu Tan, Jingya Qian, Chen Chen, et al.
(2023), pp. 4310-4314
Closed Access
Xingyu Tan, Jingya Qian, Chen Chen, et al.
(2023), pp. 4310-4314
Closed Access
