 A Survey on the Densest Subgraph Problem and Its VariantsACM Computing Surveys (ACM Comput. Surv.), 2023 |
 Parallelizing Maximal Clique Enumeration on GPUsInternational Conference on Parallel Architectures and Compilation Techniques (PACT), 2022 |
 Hierarchical Agglomerative Graph Clustering in Poly-Logarithmic DepthNeural Information Processing Systems (NeurIPS), 2022 |
 Efficient and Scalable Graph Pattern Mining on GPUsUSENIX Symposium on Operating Systems Design and Implementation (OSDI), 2021 |
 Theoretically and Practically Efficient Parallel Nucleus DecompositionProceedings of the VLDB Endowment (PVLDB), 2021 |
 Parallel K-Clique Counting on GPUsInternational Conference on Supercomputing (ICS), 2021 |
 GraphMineSuite: Enabling High-Performance and Programmable Graph Mining
Algorithms with Set AlgebraProceedings of the VLDB Endowment (PVLDB), 2021 |
 On the Locality of Nash-Williams Forest Decomposition and Star-Forest
DecompositionACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2020 |
 Parallel Batch-Dynamic -Clique CountingSIAM Symposium on Algorithmic Principles of Computer Systems (SAPCS), 2020 |
 Massively Parallel Algorithms for Small Subgraph CountingInternational Workshop and International Workshop on Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX/RANDOM), 2020 |
