Kheeran K. Naidu

According to our database, Kheeran K. Naidu authored at least 9 papers between 2021 and 2026.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2026

Unit Interval Selection in Random Order Streams.

Cezar-Mihail Alexandru, Adithya Diddapur, Magnús M. Halldórsson, Christian Konrad, Kheeran K. Naidu

Proceedings of the 43rd International Symposium on Theoretical Aspects of Computer Science, 2026

2025

Settling the Pass Complexity of Approximate Matchings in Dynamic Graph Streams.

Sepehr Assadi, Soheil Behnezhad, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan

Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 2025

2024

O(log log n) Passes Is Optimal for Semi-streaming Maximal Independent Set.

Sepehr Assadi, Christian Konrad, Kheeran K. Naidu, Janani Sundaresan

Proceedings of the 56th Annual ACM Symposium on Theory of Computing, 2024

An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation.

Christian Konrad, Kheeran K. Naidu

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023

Improved Weighted Matching in the Sliding Window Model.

Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu

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

Maximum Matching via Maximal Matching Queries.

Christian Konrad, Kheeran K. Naidu, Arun Steward

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

2022

Closing the Gap between Weighted and Unweighted Matching in the Sliding Window Model.

Cezar-Mihail Alexandru, Pavel Dvorák, Christian Konrad, Kheeran K. Naidu

CoRR, 2022

Space Optimal Vertex Cover in Dynamic Streams.

Kheeran K. Naidu, Vihan Shah

Proceedings of the Approximation, 2022

2021

On Two-Pass Streaming Algorithms for Maximum Bipartite Matching.

Christian Konrad, Kheeran K. Naidu

Proceedings of the Approximation, 2021