On Two-Pass Streaming Algorithms for Maximum Bipartite Matching. - Christian Konrad 001; Kheeran K. Naidu (APPROX-RANDOM, 2021)

Space Optimal Vertex Cover in Dynamic Streams. - Kheeran K. Naidu; Vihan Shah (APPROX/RANDOM, 2022)

Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model. - Cezar-Mihail Alexandru; Pavel Dvorák; Christian Konrad 001; Kheeran K. Naidu (CoRR, 2022)

Maximum Matching via Maximal Matching Queries. - Christian Konrad 001; Kheeran K. Naidu; Arun Steward (STACS, 2023)

Improved Weighted Matching in the Sliding Window Model. - Cezar-Mihail Alexandru; Pavel Dvorák; Christian Konrad 001; Kheeran K. Naidu (STACS, 2023)

An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation. - Christian Konrad 001; Kheeran K. Naidu (SODA, 2024)

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set. - Sepehr Assadi; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (STOC, 2024)

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams. - Sepehr Assadi; Soheil Behnezhad; Christian Konrad 001; Kheeran K. Naidu; Janani Sundaresan (SODA, 2025)