 |
 Faster Cycle Detection in the Congested CliqueInternational Symposium on Distributed Computing (DISC), 2024 |
 The Complexity of Distributed Approximation of Packing and Covering
Integer Linear ProgramsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2023 |
 Deterministic Near-Optimal Distributed Listing of CliquesACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Narrowing the LOCALCONGEST Gaps in Sparse Networks via
Expander DecompositionsACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2022 |
 Distributed Subgraph Finding: Progress and ChallengesInternational Colloquium on Automata, Languages and Programming (ICALP), 2022 |
 Quantum Distributed Algorithms for Detection of CliquesInformation Technology Convergence and Services (ITCS), 2022 |
 Strong-Diameter Network DecompositionACM SIGACT-SIGOPS Symposium on Principles of Distributed Computing (PODC), 2021 |
 Finding Subgraphs in Highly Dynamic NetworksACM Symposium on Parallelism in Algorithms and Architectures (SPAA), 2020 |
