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 Clique Counting and Peeling Algorithms
Jessica Shi, Laxman Dhulipala, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2021), pp. 135-146
Open Access | Times Cited: 23
Jessica Shi, Laxman Dhulipala, Julian Shun
Society for Industrial and Applied Mathematics eBooks (2021), pp. 135-146
Open Access | Times Cited: 23
Showing 23 citing articles:
A Survey on the Densest Subgraph Problem and its Variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
ACM Computing Surveys (2024) Vol. 56, Iss. 8, pp. 1-40
Open Access | Times Cited: 17
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
ACM Computing Surveys (2024) Vol. 56, Iss. 8, pp. 1-40
Open Access | Times Cited: 17
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
Michael T. Goodrich, Ryuto Kitagawa, Michael Mitzenmacher
Lecture notes in computer science (2025), pp. 70-84
Closed Access
Ordering heuristics for k -clique listing
Rong-Hua Li, Sen Gao, Lu Qin, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 12, pp. 2536-2548
Closed Access | Times Cited: 29
Rong-Hua Li, Sen Gao, Lu Qin, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 12, pp. 2536-2548
Closed Access | Times Cited: 29
Parallel K-clique counting on GPUs
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
(2022), pp. 1-14
Open Access | Times Cited: 15
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
(2022), pp. 1-14
Open Access | Times Cited: 15
Sage
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 9, pp. 1598-1613
Open Access | Times Cited: 21
Laxman Dhulipala, Charles McGuffey, Hongbo Kang, et al.
Proceedings of the VLDB Endowment (2020) Vol. 13, Iss. 9, pp. 1598-1613
Open Access | Times Cited: 21
Efficient k -Clique Count Estimation with Accuracy Guarantee
Lijun Chang, Rashmika Gamage, Jeffrey Xu Yu
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 11, pp. 3707-3719
Closed Access | Times Cited: 2
Lijun Chang, Rashmika Gamage, Jeffrey Xu Yu
Proceedings of the VLDB Endowment (2024) Vol. 17, Iss. 11, pp. 3707-3719
Closed Access | Times Cited: 2
Parallelizing Maximal Clique Enumeration on GPUs
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, et al.
(2023), pp. 162-175
Open Access | Times Cited: 6
Mohammad Almasri, Yen-Hsiang Chang, Izzat El Hajj, et al.
(2023), pp. 162-175
Open Access | Times Cited: 6
Parallel Batch-Dynamic k-Clique Counting
Laxman Dhulipala, Quanquan C. Liu, Julian Shun, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 129-143
Closed Access | Times Cited: 14
Laxman Dhulipala, Quanquan C. Liu, Julian Shun, et al.
Society for Industrial and Applied Mathematics eBooks (2021), pp. 129-143
Closed Access | Times Cited: 14
Parallel Algorithms for Finding Large Cliques in Sparse Graphs
Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, et al.
(2021), pp. 243-253
Open Access | Times Cited: 14
Lukas Gianinazzi, Maciej Besta, Yannick Schaffner, et al.
(2021), pp. 243-253
Open Access | Times Cited: 14
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
Efficient shortest path counting on large road networks
Yu-Xuan Qiu, Dong Wen, Lu Qin, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 10, pp. 2098-2110
Closed Access | Times Cited: 7
Yu-Xuan Qiu, Dong Wen, Lu Qin, et al.
Proceedings of the VLDB Endowment (2022) Vol. 15, Iss. 10, pp. 2098-2110
Closed Access | Times Cited: 7
A Survey on the Densest Subgraph Problem and its Variants
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 2
Tommaso Lanciano, Atsushi Miyauchi, Adriano Fazzone, et al.
arXiv (Cornell University) (2023)
Open Access | Times Cited: 2
GraphMineSuite: Enabling High-Performance and Programmable Graph Mining Algorithms with Set Algebra
Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
Maciej Besta, Zur Vonarburg-Shmaria, Yannick Schaffner, et al.
arXiv (Cornell University) (2021)
Closed Access | Times Cited: 5
On the Locality of Nash-Williams Forest Decomposition and Star-Forest Decomposition
David G. Harris, Hsin-Hao Su, Hoa T. Vu
(2021) Vol. 43, pp. 295-305
Open Access | Times Cited: 5
David G. Harris, Hsin-Hao Su, Hoa T. Vu
(2021) Vol. 43, pp. 295-305
Open Access | Times Cited: 5
Teaching Parallel Algorithms Using the Binary-Forking Model
Guy E. Blelloch, Yan Gu, Yihan Sun
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2024), pp. 346-351
Closed Access
Guy E. Blelloch, Yan Gu, Yihan Sun
2022 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW) (2024), pp. 346-351
Closed Access
A Combined Content Addressable Memory and In-Memory Processing Approach for k-Clique Counting Acceleration
Xiaoyan Ma, W F Zhang, Xueyan Wang, et al.
(2024), pp. 1-6
Closed Access
Xiaoyan Ma, W F Zhang, Xueyan Wang, et al.
(2024), pp. 1-6
Closed Access
k-Clique counting on large scale-graphs: a survey
Büşra Çalmaz, Belgin Ergenç Bostanoğlu
PeerJ Computer Science (2024) Vol. 10, pp. e2501-e2501
Open Access
Büşra Çalmaz, Belgin Ergenç Bostanoğlu
PeerJ Computer Science (2024) Vol. 10, pp. e2501-e2501
Open Access
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
Xiaojun Dong, Yunshu Wu, Zhongqi Wang, et al.
(2023), pp. 341-353
Open Access | Times Cited: 1
Flash: A Framework for Programming Distributed Graph Processing Algorithms
Xue Li, Ke Meng, Lu Qin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 232-244
Closed Access | Times Cited: 1
Xue Li, Ke Meng, Lu Qin, et al.
2022 IEEE 38th International Conference on Data Engineering (ICDE) (2023), pp. 232-244
Closed Access | Times Cited: 1
Sage: Parallel Semi-Asymmetric Graph Algorithms for NVRAMs
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 2
Laxman Dhulipala, Charlie McGuffey, Hongbo Kang, et al.
arXiv (Cornell University) (2019)
Open Access | Times Cited: 2
Parallel Five-cycle Counting Algorithms
Jessica Shi, Louisa Ruixue Huang, Julian Shun
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-23
Open Access | Times Cited: 1
Jessica Shi, Louisa Ruixue Huang, Julian Shun
ACM Journal of Experimental Algorithmics (2022) Vol. 27, pp. 1-23
Open Access | Times Cited: 1
On linear algebraic algorithms for the subgraph matching problem and its variants
M. D. Emelin, Ilya A. Khlystov, D. S. Malyshev, et al.
Optimization Letters (2023) Vol. 17, Iss. 7, pp. 1533-1549
Closed Access
M. D. Emelin, Ilya A. Khlystov, D. S. Malyshev, et al.
Optimization Letters (2023) Vol. 17, Iss. 7, pp. 1533-1549
Closed Access
K-Clique Counting on GPUs.
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
arXiv (Cornell University) (2021)
Closed Access
Mohammad Almasri, Izzat El Hajj, Rakesh Nagi, et al.
arXiv (Cornell University) (2021)
Closed Access
