Kavitha Telikepalli
Associate Professor
Department of Technology and Computer Science
Tata Institute of Fundamental Research
India
Biography
Dr. Kavita Telikepal is an Assistant professor at the School of technology and computer science, TIFR. Her work is primarily in designing efficient algorithms for problems in graphs, such as computing shortest paths and distances, computing matchings that satisfy certain optimality criteria, computing minimum cuts and related problems.
Research Interest
Graph algorithms and Computational complexity.
Publications
-
Telikepali K, Huang C (2011) Near-popular matchings in the Roommates problem ESA.
-
Telikepali K, Huang C (2012) Efficient Algorithms for Maximum Weight Matchings in General Graphs with Small Edge Weights SODA,
-
Telikepali K (2012) Popularity vs Maximum cardinality in the stable marriage setting SODA.
