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 ($$\alpha $$, $$\beta $$)-core computation in bipartite graphs
Boge Liu, Long Yuan, Xuemin Lin, et al.
The VLDB Journal (2020) Vol. 29, Iss. 5, pp. 1075-1099
Closed Access | Times Cited: 62

Showing 26-50 of 62 citing articles:

Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs
Kai Wang, Wenjie Zhang, Xuemin Lin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2022), pp. 2291-2305
Closed Access | Times Cited: 9
Butterfly counting and bitruss decomposition on uncertain bipartite graphs
Alexander Zhou, Yue Wang, Lei Chen
The VLDB Journal (2023) Vol. 32, Iss. 5, pp. 1013-1036
Open Access | Times Cited: 5
Scalable Algorithms for Densest Subgraph Discovery
Wensheng Luo, Zhuo Tang, Yixiang Fang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 287-300
Closed Access | Times Cited: 4
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
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
Efficient Maximal Biplex Enumerations with Improved Worst-Case Time Guarantee
Qiangqiang Dai, Rong-Hua Li, Donghang Cui, et al.
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 3, pp. 1-26
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
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
Efficient and Scalable Distributed Graph Structural Clustering at Billion Scale
Kongzhang Hao, Long Yuan, Zhengyi Yang, et al.
Lecture notes in computer science (2023), pp. 234-251
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
Label-constrained shortest path query processing on road networks
Junhua Zhang, Long Yuan, Wentao Li, et al.
The VLDB Journal (2023) Vol. 33, Iss. 3, pp. 569-593
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
Effective Community Search on Large Attributed Bipartite Graphs
Zongyu Xu, Yihao Zhang, Long Yuan, et al.
International Journal of Pattern Recognition and Artificial Intelligence (2022) Vol. 37, Iss. 02
Open Access | Times Cited: 5
Community search over large semantic-based attribute graphs
Pei-Ying Lin, Siyang Yu, Xu Zhou, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 927-948
Closed Access | Times Cited: 6
Contraction Hierarchies with Label Restrictions Maintenance in Dynamic Road Networks
Bo Feng, Zi Chen, Long Yuan, et al.
Lecture notes in computer science (2023), pp. 269-285
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
Efficient Personalized Influential Community Search in Large Networks
Yanping Wu, Jun Zhao, Renjie Sun, et al.
Lecture notes in computer science (2020), pp. 86-101
Closed Access | Times Cited: 4
Generalized core maintenance of dynamic bipartite graphs
Wen Bai, Yadi Chen, Di Wu, et al.
Data Mining and Knowledge Discovery (2021) Vol. 36, Iss. 1, pp. 209-239
Closed Access | Times Cited: 4
Multi-label transfer learning via latent graph alignment
Jianghui Sang, Yongli Wang, Long Yuan, et al.
World Wide Web (2021) Vol. 25, Iss. 2, pp. 879-898
Closed Access | Times Cited: 4
$(\alpha,\ \beta)$-AWCS: $(\alpha,\ \beta)$-Attributed Weighted Community Search on Bipartite Graphs
Dengshi Li, Xiaocong Liang, Ruimin Hu, et al.
2022 International Joint Conference on Neural Networks (IJCNN) (2022), pp. 1-8
Closed Access | Times Cited: 3
MCR-Tree: An Efficient Index for Multi-dimensional Core Search
Chengyang Luo, Yifan Zhu, Liu Qing, et al.
Proceedings of the ACM on Management of Data (2024) Vol. 2, Iss. 3, pp. 1-25
Closed Access
GPU-based butterfly counting
Yifei Xia, Feng Zhang, Qingyu Xu, et al.
The VLDB Journal (2024) Vol. 33, Iss. 5, pp. 1543-1567
Closed Access
Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract)
Yiwei Zhao, Zi Chen, Chen Chen, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 5697-5698
Closed Access
Querying Historical Cohesive Subgraphs Over Temporal Bipartite Graphs
Shunyang Li, Kai Wang, Xuemin Lin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 2503-2516
Closed Access
Bipartite Graph Analytics: Current Techniques and Future Trends
Hanchen Wang, Kai Wang, Wenjie Zhang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 01-07
Closed Access

Scroll to top