Your search returned the following 27 documents:

27. Max-coloring paths: tight bounds and extensions
    Telikepalli Kavitha and Julián Mestre
    Journal of Combinatiorial Optimization 24 (1): 1-14, 2012
    
26. Additive Spanners and (α, β)-Spanners
    Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie
    ACM Transactions on Algorithms 7 (1): 5:1-5:26, 2011
    
25. Bounded Unpopularity Matchings
    Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michael, and Meghana Nasr
    Algorithmica 61 (3): 738-757, 2011
    
24. Near-popular matchings in the Roommates problem
    Chien-Chung Huang and Telikepalli Kavitha
    In: 19th European Symposium on Algorithms (ESA), Saarbrücken, Germany, 2011. Note: Journal version to appear in SIAM Journal on Discrete Mathematics
    
23. New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    Algorithmica 59 (4): 471-488, 2011
    
22. Popular mixed matchings
    Telikepalli Kavitha, Julian Mestre, and Meghana Nasre
    Theoretical Computer Science 412 (24): 2679-2690, 2011
    
21. Popular Matchings in the Stable Marriage Problem
    Chien-Chung Huang and Telikepalli Kavitha
    In: 38th International Colloquium on Automata, Languages and Programming (ICALP), Zürich, Switzerland, 2011. Note: Journal version to appear in Information and Computation
    
20. Max-coloring paths: Tight bounds and extensions
    Telikepalli Kavitha and Julian Mestre
    Journal of Combinatorial Optimization Online First: 1 - 14, 2010
    
19. Max-coloring paths: Tight bounds and extensions
    Telikepalli Kavitha and Julian Mestre
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawai, USA, 2009, 87-96
    
18. Bounded Unpopularity Matchings
    Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, and Meghana Nasre
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 127-137
    
17. On a Special Co-cycle Basis of Graphs
    Telikepalli Kavitha
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 343-354
    
16. Optimal Popular Matchings
    Telikepalli Kavitha and Meghana Nasre
    Workshop MATCH-UP: Matching Under Preferences, Reykjavik, Iceland
    
15. Algorithms to compute minimum cycle basis in directed graphs
    Telikepalli Kavitha and Kurt Mehlhorn
    Theory of Computing Systems 40 (4): 485-505, 2007
    
    
14. New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 512-523
    [PDF: Download: Mehlhorn_2007_a_m.pdf]
    
13. Popular Matchings
    David J. Abraham, Robert W. Irving, Telikepalli Kavitha, and Kurt Mehlhorn
    SIAM Journal on Computing 37 (4): 1030-1045, 2007
    
    
12. Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
    Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna E. Paluch
    ACM Transactions on Algorithms 3 (2): 15.1-15.18, 2007
    
    
11. A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
    Ramesh Hariharan, Kavitha Telikepalli, and Kurt Mehlhorn
    In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, Venice, Italy, 2006, 250-261
    [PDF: Download: Mehlhorn_2006_a_m.pdf]
    
10. Rank-Maximal Matchings
    Robert W. Irving, Kavitha Telikepalli, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    ACM Transactions on Algorithms 2 (4): 602-610, 2006
    
    
9. A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
   Telikepalli Kavitha and Kurt Mehlhorn
   In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005, 654-665
   [PDF: Download: 185.pdf] [PDF: Download: Mehlhorn184.pdf]
   
8. New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
   Surender Baswana, Kavitha Telikepalli, Kurt Mehlhorn, and Seth Pettie
   In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 672-681
   
   
7. Popular Matchings
   David Abraham, Robert W. Irving, Kurt Mehlhorn, and Kavitha Telikepalli
   In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 424-432
   
   
6. A Faster Algorithm for Minimum Cycle Basis of Graphs
   Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
   In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, 2004, 846-857
   [PDF: Download: 179.pdf] [PDF: Download: Mehlhorn178.pdf]
   
5. Rank-Maximal Matchings
   Kurt Mehlhorn, Dimitrios Michail, Kavitha Telikepalli, Robert W. Irving, and Katarzyna Paluch
   In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 68-75
   
   
4. Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
   Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
   In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 222-233
   
   
3. Efficient Algorithms for Abelian group isomorphism and related problems
   Kavitha Telikepalli
   In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, IIT Mumbai, India., December 15-17,2003, 2003, 277-288
   
2. Isoperimetric Inequalities and Width Parameters of Graphs
   Kavitha Telikepalli, Sunil Chandran, and C. R. Subramanian
   In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, Montana, July 25-28, 2003, 2003, 385-393
   
1. On Shortest Paths in Line Arrangements
   Kavitha Telikepalli and Kasturi Varadarajan
   In: 15th Canadian Conference in Computational Geometry (CCCG-03), Dalhousie University, Halifax, Canada, August 11-13, 2003, 2003, 170-173