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:

Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs
Kai Wang, Xuemin Lin, Lu Qin, et al.
The VLDB Journal (2021) Vol. 31, Iss. 2, pp. 203-226
Closed Access | Times Cited: 34

Showing 1-25 of 34 citing articles:

Efficient Personalized Maximum Biclique Search
Kai Wang, Wenjie Zhang, Xuemin Lin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 498-511
Closed Access | Times Cited: 20
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs
Yanping Wu, Renjie Sun, Xiaoyang Wang, et al.
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 11, pp. 3243-3255
Closed Access | Times Cited: 4
Finding top-r weighted k-wing communities in bipartite graphs
Jiahao He, Zijun Chen, Xue Sun, et al.
Journal of Computational Science (2025), pp. 102530-102530
Closed Access
Density Decomposition of Bipartite Graphs
Qi Zhang, R Li, Qi Zhang, et al.
Proceedings of the ACM on Management of Data (2025) Vol. 3, Iss. 1, pp. 1-25
Closed Access
Efficient indexing and searching of constrained core in hypergraphs
Qi Luo, Wenjie Zhang, Zhengyi Yang, et al.
The VLDB Journal (2025) Vol. 34, Iss. 3
Closed Access
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs
Xinwei Cai, Xiangyu Ke, Kai Wang, et al.
Proceedings of the VLDB Endowment (2023) Vol. 17, Iss. 4, pp. 657-670
Open Access | Times Cited: 9
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
Accelerated butterfly counting with vertex priority on bipartite graphs
Kai Wang, Xuemin Lin, Lu Qin, et al.
The VLDB Journal (2022) Vol. 32, Iss. 2, pp. 257-281
Open Access | Times Cited: 15
Index-Based Biclique Percolation Communities Search on Bipartite Graphs
Zi Chen, Yiwei Zhao, Long Yuan, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023)
Closed Access | Times Cited: 8
Hierarchical Structure Construction on Hypergraphs
Qi Luo, Wenjie Zhang, Zhengyi Yang, et al.
(2024), pp. 1597-1606
Closed Access | Times Cited: 2
Reliable Community Search on Uncertain Graphs
Xiaoye Miao, Yue Liu, Lu Chen, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 1166-1179
Closed Access | Times Cited: 11
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
Discovering key users for defending network structural stability
Fan Zhang, Jiadong Xie, Kai Wang, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 679-701
Closed Access | Times Cited: 14
Discovering Significant Communities on Bipartite Graphs: An Index-based Approach
Kai Wang, Wenjie Zhang, Ying Zhang, et al.
IEEE Transactions on Knowledge and Data Engineering (2021), pp. 1-1
Closed Access | Times Cited: 13
Scalable Approximate Butterfly and Bi-triangle Counting for Large Bipartite Networks
Fangyuan Zhang, D. Chen, Sibo Wang, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 4, pp. 1-26
Closed Access | Times Cited: 5
Maximal size constraint community search over bipartite graphs
Mo Li, Renata Borovica‐Gajic, Farhana M. Choudhury, et al.
Knowledge-Based Systems (2024) Vol. 297, pp. 111961-111961
Closed Access | Times Cited: 1
Parallelization of butterfly counting on hierarchical memory
Zhibin Wang, Longbin Lai, Yixue Liu, et al.
The VLDB Journal (2024) Vol. 33, Iss. 5, pp. 1453-1484
Closed Access | Times Cited: 1
Efficient maintenance for maximal bicliques in bipartite graph streams
Ziyi Ma, Yuling Liu, Yikun Hu, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 857-877
Closed Access | Times Cited: 10
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
Searching Personalized $k$-wing in Bipartite Graphs
Aman Abidi, Lu Chen, Rui Zhou, et al.
IEEE Transactions on Knowledge and Data Engineering (2022), pp. 1-14
Open Access | Times Cited: 5
I/O-Efficient Butterfly Counting at Scale
Zhibin Wang, Longbin Lai, Yixue Liu, et al.
Proceedings of the ACM on Management of Data (2023) Vol. 1, Iss. 1, pp. 1-27
Closed Access | Times Cited: 2
Effective and efficient community search with size constraint on bipartite graphs
Keqi Zhou, Junchang Xin, Jinyi Chen, et al.
Information Sciences (2023) Vol. 647, pp. 119511-119511
Closed Access | Times Cited: 2
Co-Engaged Location Group Search in Location-Based Social Networks
Nur Al Hasan Haldar, Jianxin Li, Naveed Akhtar, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 36, Iss. 7, pp. 2910-2926
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
Page 1 - Next Page

Scroll to top