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:

Parallel Algorithms for Butterfly Computations
Jessica Shi, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2019), pp. 16-30
Open Access | Times Cited: 33

Showing 1-25 of 33 citing articles:

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
Fast Approximate Temporal Butterfly Counting on Bipartite Graphs via Edge Sampling
Jiaxi Pu, Yanhao Wang, Yuchen Li, et al.
Lecture notes in computer science (2025), pp. 42-57
Closed Access
Parallel Peeling of Invertible Bloom Lookup Tables in a Constant Number of Rounds
Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher
Lecture notes in computer science (2025), pp. 70-84
Closed Access
sGrapp: Butterfly Approximation in Streaming Graphs
Aida Sheshbolouki, M. TAMER ÖZSU
ACM Transactions on Knowledge Discovery from Data (2022) Vol. 16, Iss. 4, pp. 1-43
Open Access | Times Cited: 17
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
Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs
Kai Wang, Gengda Zhao, Wenjie Zhang, et al.
IEEE Transactions on Knowledge and Data Engineering (2023) Vol. 35, Iss. 11, pp. 11165-11179
Closed Access | Times Cited: 8
Approximately Counting Butterflies in Large Bipartite Graph Streams
Rundong Li, Pinghui Wang, Peng Jia, et al.
IEEE Transactions on Knowledge and Data Engineering (2021) Vol. 34, Iss. 12, pp. 5621-5635
Closed Access | Times Cited: 20
Efficient load-balanced butterfly counting on GPU
Qingyu Xu, Feng Zhang, Zhiming Yao, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 11, pp. 2450-2462
Closed Access | Times Cited: 12
Efficient Index for Temporal Core Queries over Bipartite Graphs
Anxin Tian, Alexander Zhou, Yue Wang, et al.
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 11, pp. 2813-2825
Closed Access | Times Cited: 2
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 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
Towards distributed bitruss decomposition on bipartite graphs
Yue Wang, Ruiqi Xu, Xun Jian, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 9, pp. 1889-1901
Closed Access | Times Cited: 8
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
On Extracting Socially Tenuous Groups for Online Social Networks with k-Triangles
Chih-Ya Shen, Hong-Han Shuai, De-Nian Yang, et al.
IEEE Transactions on Knowledge and Data Engineering (2020), pp. 1-1
Closed Access | Times Cited: 9
FLEET
Seyed-Vahid Sanei-Mehri, Yu Zhang, Ahmet Erdem Sarıyüce, et al.
(2019), pp. 1201-1210
Open Access | Times Cited: 9
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
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
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
Counting Butterflies in Fully Dynamic Bipartite Graph Streams
Serafeim Papadias, Zoi Kaoudi, Varun Pandey, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2024), pp. 2917-2930
Open Access
Maximum Butterfly Generators Search in Bipartite Networks
Ji Huang, Guangyao Pang, Fei Hao
Mathematics (2024) Vol. 13, Iss. 1, pp. 88-88
Open Access
Monarch: Distributed Butterfly Counting for Large-scale Bipartite Graph
Yuxin Tang, Mangesh Bendre, Mahashweta Das
2021 IEEE International Conference on Big Data (Big Data) (2024), pp. 799-804
Closed Access
Parallel Peeling of Bipartite Networks for Hierarchical Dense Subgraph Discovery
Kartik Lakhotia, Rajgopal Kannan, Viktor K. Prasanna
ACM Transactions on Parallel Computing (2023) Vol. 10, Iss. 2, pp. 1-35
Open Access | Times Cited: 1
High-Performance and Flexible Parallel Algorithms for Semisort and Related Problems
Xiaojun Dong, Yunshu Wu, Zhongqi Wang, et al.
(2023), pp. 341-353
Open Access | Times Cited: 1
Finding Top-k Important Edges on Bipartite Graphs: Ego-betweenness Centrality-based Approaches
Tongfeng Weng, Xu Zhou, Yixiang Fang, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 2415-2428
Closed Access | Times Cited: 1
Counting Induced 6-Cycles in Bipartite Graphs
Jason Niu, Jarosław Żola, Ahmet Erdem Sarıyüce
(2022), pp. 1-10
Closed Access | Times Cited: 2
Page 1 - Next Page

Scroll to top