Kavitha Telikepalli (born 1974)[1] is an Indian computer scientist known for her research on graph algorithms and combinatorial optimization, particularly concerning matchings, cycle bases, and graph spanners. She is a professor in the School of Technology & Computer Science at the Tata Institute of Fundamental Research.[2]