Telikepalli Kavitha

Publications

363

Citations

H-Index

2003

Active since

Affiliations

Indian Institute of Science Bangalore(Current)

Max Planck Institute for Informatics

Max Planck Society

Telikepalli Kavitha is an author at Indian Institute of Science Bangalore specializing in engineering, computational complexity, and combinatorial optimization.

Top concepts

EngineeringComputational ComplexityGraph TheoryCombinatorial OptimizationComputer ScienceApproximation TheoryDiscrete MathematicsGraph AlgorithmsNetwork AnalysisEducation

Publications per year

2003–2015

Publications

Cycle bases in graphs characterization, algorithms, complexity, and applications

Telikepalli Kavitha, Christian Liebchen, Kurt Mehlhorn et al. · Computer Science Review · 2009 · 162 citations

Engineering, Graph Theory, Graph Algorithms +7

Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths

Surender Baswana, Telikepalli Kavitha · 2006 · 78 citations

Engineering, Estimate Deltacirc, Computational Complexity +18

Better lower bounds for locally decodable codes

Ajay Deshpande, Rahul Jain, Telikepalli Kavitha et al. · 2003 · 41 citations

Mathematical Programming, Engineering, Adaptive Decoding Algorithm +18

An $\tilde{O}(m^{2}n)$ Algorithm for Minimum Cycle Basis of Graphs

Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail et al. · Algorithmica · 2007 · 38 citations · Full text

Engineering, Planar Graph, Network Analysis +16

Faster Algorithms for All-pairs Approximate Shortest Paths in Undirected Graphs

Surender Baswana, Telikepalli Kavitha · SIAM Journal on Computing · 2010 · 29 citations

Directed Graph, Engineering, Stretch T +18

Rows per page

1–5 of 6