Homepage of Kavitha Telikepalli
  • Popular Mixed Matchings
    Telikepalli Kavitha, Julian Mestre, Meghana Nasre
    To appear in ICALP 2009
  • Dynamic matrix rank with partial look-ahead
    Telikepalli Kavitha
    To appear in FSTTCS 2008
  • Optimal Popular Matchings
    Telikepalli Kavitha and Meghana Nasre
    To appear in MATCH-UP: Matching Under Preferences - Algorithms and Complexity (http://www.optimalmatching.com/workshop)
  • Faster Algorithms for Incremental Topological Ordering
    Berhhard Haeupler, Telikepalli Kavitha, Rogers Mathew, Siddhartha Sen, and Robert Tarjan
    To appear in ICALP 2008
  • On a special co-cycle basis of graphs
    Telikepalli Kavitha
    To appear in SWAT 2008
  • Bounded Unpopurality Matchings
    Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, Meghana Nasre
    To appear in SWAT 2008
  • Faster Algorithms for Minimum Cycle Basis in Directed Graphs
    Ramesh Hariharan, Telikepalli Kavitha and Kurt Mehlhorn
    To appear in SIAM Journal on Computing
  • Faster Algorithms for Online Topological Ordering
    Telikepalli Kavitha and Rogers Mathew
    IISc-CSA-Technical Report-2007-12
  • Fast Edge Splitting and Edmonds' Arborescence Construction for Unweighted Graphs
    Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
    To appear in SODA 2008.
  • Linear Time Algorithms for Abelian Group Isomorphism and Related Results
    To appear in Journal of Computer and System Sciences.
  • Faster Algorithms for All-Pairs Small Stretch Distances in Weighted Graphs
    To appear in FSTTCS 2007.
  • An \tilde{O}(mn) Gomory-Hu tree construction algorithm for unweighted graphs
    Anand Bhalgat, Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
    To appear in STOC 2007.
  • New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail
    to appear in STACS 2007.
  • Efficient Algorithms for computing all low s-t connectivities and Related Problems
    Ramesh Hariharan, Telikepalli Kavitha, Debmalya Panigrahi
    to appear in SODA 2007.
  • Efficient Algorithms for Weighted Rank-Maximal Matchings and Related Problems
    Telikepalli Kavitha and Chintan Shah
    to appear in ISAAC 2006.
  • Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths
    Surender Baswana and Telikepalli Kavitha
    to appear in FOCS 2006.
  • A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
    Ramesh Hariharan, Telikepalli Kavitha, Kurt Mehlhorn
    ICALP 2006: pp.250-261.
  • Dynamic Matching Markets and Voting Paths
    David Abraham and Telikepalli Kavitha
    SWAT 2006: pp.65-76
  • An \tilde{O}(m^2n) Randomized Algorithm to Compute a Minimum Cycle Basis of a Directed Graph
    Telikepalli Kavitha
    ICALP 2005: pp.273-284
  • A Polynomial Time Algorithm for Minimum Cycle Basis in directed graphs
    Telikepalli Kavitha and Kurt Mehlhorn
    STACS 2005: pp.654-665.
    Journal version to appear in a special issue of Theory of Computing Systems.
  • Efficient Construction of (\alpha,\beta)-Spanners and Purely Additive Spanners
    Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, Seth Pettie
    SODA 2005: pp.672-681.
  • Popular Matchings
    David Abraham, Robert Irving, Telikepalli Kavitha, Kurt Mehlhorn
    SODA 2005: pp.424-432.
    Journal version to appear in SIAM Journal on Computing.
  • Rank-Maximal Matchings
    Robert Irving, Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch
    SODA 2004: pp.68-75.
    Journal version to appear in a special issue of ACM Transactions on Algorithms.
  • Strongly Stable Matchings in Time O(mn) and Extension to the Hospitals-Residents Problem
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch
    STACS 2004: pp.222-233.
    Journal version to appear in ACM Transactions on Algorithms.
  • A faster algorithm for Minimum Cycle Basis of graphs
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, Katarzyna Paluch
    ICALP 2004: pp.846-857.
  • On Shortest Paths in Line Arrangements
    Telikepalli Kavitha and Kasturi Varadarajan
    CCCG 2003: pp.170-173.
  • Isoperimetric Inequalities and Width Parameters of Graphs
    L. Sunil Chandran, T. Kavitha, C.R. Subramanian
    COCOON 2003: pp.385-393.
    Journal version in Discrete Mathematics.
  • Efficient Algorithms for Abelian Group Isomorphism and Related Problems
    Telikepalli Kavitha
    FSTTCS 2003: pp.277-288.
  • An algorithm for computing a convex and simple path of bounded curvature in a simple polygon
    J-D Boissonnat, S.K. Ghosh, T. Kavitha, S. Lazard
    Algorithmica, 34 (October 2002), pp.109-156.
  • Better Lower Bounds for Locally Decodable Codes
    A. Deshpande, R. Jain, T. Kavitha, S.V. Lokam, J. Radhakrishnan
    Computational Complexity Conference (2002), pp.184-193.
    Journal version to appear in Random Structures and Algorithms.