Kheeran K. Naidu

My current research interest is in algorithms for processing massive graphs; in particular, data streaming algorithms.

PhD in Computer Science

Algorithms and Complexity Group, University of Bristol

Home CV

Contact me

Publications

2024 | Christian Konrad, Kheeran K. Naidu An Unconditional Lower Bound for Two-Pass Streaming Algorithms for Maximum Matching Approximation

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

2023 | Christian Konrad, Kheeran K. Naidu, Arun Steward Maximum Matching via Maximal Matching Queries

LIPIcs slides

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

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

arxiv slides

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

2022 | Kheeran K. Naidu, Vihan Shah Space Optimal Vertex Cover in Dynamic Streams

arxiv slides

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

2021 | Christian Konrad, Kheeran K. Naidu 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