| Publication | Date of Publication | Type |
|---|
| Fully dynamic ( + 1)-coloring against adaptive adversaries | 2026-07-03 | Paper |
| Beating two-thirds for random-order streaming matching | 2026-05-12 | Paper |
| Sublinear algorithms for TSP via path covers | 2026-01-14 | Paper |
| Streaming edge coloring with asymptotically optimal colors | 2026-01-14 | Paper |
| Almost 3-approximate correlation clustering in constant rounds | 2025-08-15 | Paper |
| Local computation algorithms for maximum matching: new lower bounds | 2025-08-15 | Paper |
| Time-optimal sublinear algorithms for matching and vertex cover | 2025-08-13 | Paper |
| Fully dynamic maximal independent set with polylogarithmic update time | 2025-08-12 | Paper |
| Near-optimal massively parallel graph connectivity | 2025-08-12 | Paper |
| Exponentially faster massively parallel maximal matching | 2025-08-12 | Paper |
| Stochastic weighted matching: (1- ) approximation | 2025-08-12 | Paper |
Exponentially faster massively parallel maximal matching
Journal of the ACM | 2025-02-05 | Paper |
| Fully dynamic matching: \((2 - \sqrt{2})\)-approximation in polylog update time | 2024-11-28 | Paper |
| Robust communication complexity of matching: EDCS achieves 5/6 approximation | 2024-11-14 | Paper |
| Stochastic vertex cover with few queries | 2024-07-19 | Paper |
| New trade-offs for fully dynamic matching via hierarchical EDCS | 2024-07-19 | Paper |
| Beating greedy matching in sublinear time | 2024-05-14 | Paper |
| Single-pass streaming algorithms for correlation clustering | 2024-05-14 | Paper |
| Dynamic algorithms for maximum matching size | 2024-05-14 | Paper |
| Sublinear time algorithms and complexity of approximate maximum matching | 2024-05-08 | Paper |
| On regularity lemma and barriers in streaming and dynamic matching | 2024-05-08 | Paper |
Fast and Simple Solutions of Blotto Games
Operations Research | 2024-03-12 | Paper |
| On the Robust Communication Complexity of Bipartite Matching | 2023-11-20 | Paper |
| Streaming and massively parallel algorithms for edge coloring | 2022-05-11 | Paper |
| Brief announcement: MapReduce algorithms for massive trees | 2021-07-28 | Paper |
Fully Dynamic Matching: Beating 2-Approximation in Δ<sup><i>ϵ</i></sup> Update Time
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Massively Parallel Computation of Matching and MIS in Sparse Graphs
Proceedings of the 2019 ACM Symposium on Principles of Distributed Computing | 2021-01-20 | Paper |
Stochastic matching with few queries: (1-ε) approximation
Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing | 2021-01-19 | Paper |
| Stochastic matching on uniformly sparse graphs | 2020-02-04 | Paper |
Stochastic Matching with Few Queries: New Algorithms and Tools
Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms | 2019-10-15 | Paper |
| From battlefields to elections: winning strategies of Blotto and auditing games | 2018-03-15 | Paper |
