Publications

2025 | with Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Janani Sundaresan Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams

arxiv

SODA 2025Proceedings of the 36th ACM-SIAM Symposium on Discrete Algorithms

2024 | with Sepehr Assadi, Christian Konrad, Janani Sundaresan O(log log n) Passes is Optimal for Semi-Streaming Maximal Independent Set

arxiv

STOC 2024Proceedings of the 56th Annual ACM Symposium on Theory of Computing (invited to SICOMP special issue)

2024 | with Christian Konrad An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

slides

SODA 2024Proceedings of the 35th ACM-SIAM Symposium on Discrete Algorithms

2023 | with Christian Konrad, Arun Steward Maximum Matching via Maximal Matching Queries

slides

STACS 2023Proceedings of the 40th Symposium on Theoretical Aspects of Computer Science

2023 | with Cezar-Mihail Alexandru, Pavel Dvořák, Christian Konrad Improved Weighted Matching in the Sliding Window Model

arxiv slides

STACS 2023Proceedings of the 40th Symposium on Theoretical Aspects of Computer Science

2022 | with Vihan Shah (student-only) Space Optimal Vertex Cover in Dynamic Streams

arxiv slides

APPROX 2022Proceedings of the 25th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems

2021 | with Christian Konrad On Two-Pass Streaming Algorithms for Maximum Bipartite Matching

arxiv video slides

APPROX 2021Proceedings of the 24th International Workshop on Approximation Algorithms for Combinatorial Optimization Problems