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]

Education and career

Telikepalli graduated from IIT Madras in 1995, with a bachelor's degree in computer science and engineering. She completed a PhD through the Tata Institute of Fundamental Research in 2002.[2]

After postdoctoral research with Kurt Mehlhorn at the Max Planck Institute for Informatics in Saarbrücken, Germany from 2002 to 2004, she returned to India as an assistant professor at the Indian Institute of Science in Bangalore in 2005. She moved from the Indian Institute of Science to the Tata Institute of Fundamental Research as a reader in 2010, became an associate professor in 2011, and was promoted to full professor in 2021.[2]

Recognition

Telikepalli was named an associate fellow of the Indian Academy of Sciences in 2007.[1] She was one of the winners of the 2008 Indian National Science Academy Medal for Young Scientists.[3][4]

References

  1. 1 2 "Dr Kavitha Telikepalli", Fellows' portal, Indian Academy of Sciences, retrieved 2022-02-06
  2. 1 2 3 Curriculum vitae, retrieved 2022-02-06
  3. ↑ Recipients of INSA Medal for Young Scientists 1974–2022, Indian National Science Academy, archived from the original on 2022-01-12, retrieved 2022-02-06
  4. ↑ "Kavitha Telikepalli". CSA - IISc Bangalore. Retrieved 2023-11-08.
This article is issued from Wikipedia. The text is licensed under Creative Commons - Attribution - Sharealike. Additional terms may apply for the media files.