MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 27 documents:

  1. Telikepalli Kavitha and Julián Mestre
    Max-coloring paths: tight bounds and extensions
    Journal of Combinatiorial Optimization 24 (1): 1-14, 2012
  2. Surender Baswana, Telikepalli Kavitha, Kurt Mehlhorn, and Seth Pettie
    Additive Spanners and (α, β)-Spanners
    ACM Transactions on Algorithms 7 (1): 5:1-5:26, 2011
  3. Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michael, and Meghana Nasr
    Bounded Unpopularity Matchings
    Algorithmica 61 (3): 738-757, 2011
  4. Chien-Chung Huang and Telikepalli Kavitha
    Near-popular matchings in the Roommates problem
    In: 19th European Symposium on Algorithms (ESA), Saarbrücken, Germany, 2011. Note: Journal version to appear in SIAM Journal on Discrete Mathematics
  5. Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Algorithmica 59 (4): 471-488, 2011
  6. Telikepalli Kavitha, Julian Mestre, and Meghana Nasre
    Popular mixed matchings
    Theoretical Computer Science 412 (24): 2679-2690, 2011
  7. Chien-Chung Huang and Telikepalli Kavitha
    Popular Matchings in the Stable Marriage Problem
    In: 38th International Colloquium on Automata, Languages and Programming (ICALP), Zürich, Switzerland, 2011. Note: Journal version to appear in Information and Computation
  8. Telikepalli Kavitha and Julian Mestre
    Max-coloring paths: Tight bounds and extensions
    Journal of Combinatorial Optimization Online First: 1 - 14, 2010
  9. Telikepalli Kavitha and Julian Mestre
    Max-coloring paths: Tight bounds and extensions
    In: Algorithms and Computation : 20th International Symposium, ISAAC 2009, Hawai, USA, 2009, 87-96
  10. Chien-Chung Huang, Telikepalli Kavitha, Dimitrios Michail, and Meghana Nasre
    Bounded Unpopularity Matchings
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 127-137
  11. Telikepalli Kavitha
    On a Special Co-cycle Basis of Graphs
    In: 11th Scandinavian Workshop on Algorithm Theory (SWAT), Gothenburg, Sweden, 2008, 343-354
  12. Telikepalli Kavitha and Meghana Nasre
    Optimal Popular Matchings
    Workshop MATCH-UP: Matching Under Preferences, Reykjavik, Iceland
  13. Telikepalli Kavitha and Kurt Mehlhorn
    Algorithms to compute minimum cycle basis in directed graphs
    Theory of Computing Systems 40 (4): 485-505, 2007

  14. Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    New Approximation Algorithms for Minimum Cycle Bases of Graphs
    In: STACS 2007 : 24th Annual Symposium on Theoretical Aspects of Computer Science, Aachen, Germany, 2007, 512-523
    [PDF: Download: Mehlhorn_2007_a_m.pdf]
  15. David J. Abraham, Robert W. Irving, Telikepalli Kavitha, and Kurt Mehlhorn
    Popular Matchings
    SIAM Journal on Computing 37 (4): 1030-1045, 2007

  16. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna E. Paluch
    Strongly stable matchings in time O(nm) and extension to the hospitals-residents problem
    ACM Transactions on Algorithms 3 (2): 15.1-15.18, 2007

  17. Ramesh Hariharan, Kavitha Telikepalli, and Kurt Mehlhorn
    A Faster Deterministic Algorithm for Minimum Cycle Bases in Directed Graphs
    In: Automata, Languages and Programming, 33rd International Colloquium, ICALP 2006, Part I, Venice, Italy, 2006, 250-261
    [PDF: Download: Mehlhorn_2006_a_m.pdf]
  18. Robert W. Irving, Kavitha Telikepalli, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    Rank-Maximal Matchings
    ACM Transactions on Algorithms 2 (4): 602-610, 2006

  19. Telikepalli Kavitha and Kurt Mehlhorn
    A Polynomial Time Algorithm for Minimum Cycle Basis in Directed Graphs
    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]
  20. Surender Baswana, Kavitha Telikepalli, Kurt Mehlhorn, and Seth Pettie
    New Constructions of (alpha, beta)-Spanners and Purely Additive Spanners
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 672-681

  21. David Abraham, Robert W. Irving, Kurt Mehlhorn, and Kavitha Telikepalli
    Popular Matchings
    In: Proceedings of the sixteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-05), Vancouver, Canada, 2005, 424-432

  22. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    A Faster Algorithm for Minimum Cycle Basis of Graphs
    In: Automata, languages and programming : 31st International Colloquium, ICALP 2004, Turku, Finland, 2004, 846-857
    [PDF: Download: 179.pdf] [PDF: Download: Mehlhorn178.pdf]
  23. Kurt Mehlhorn, Dimitrios Michail, Kavitha Telikepalli, Robert W. Irving, and Katarzyna Paluch
    Rank-Maximal Matchings
    In: Proceedings of the Fifteenth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA-04), New Orleans, USA, 2004, 68-75

  24. Telikepalli Kavitha, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    Strongly Stable Matchings in Time O(nm) and Extension to the Hospitals-Residents Problem
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 222-233

  25. Kavitha Telikepalli
    Efficient Algorithms for Abelian group isomorphism and related problems
    In: FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science : 23rd Conference, IIT Mumbai, India., December 15-17,2003, 2003, 277-288
  26. Kavitha Telikepalli, Sunil Chandran, and C. R. Subramanian
    Isoperimetric Inequalities and Width Parameters of Graphs
    In: Computing and Combinatorics : 9th Annual International Conference, COCOON 2003, Big Sky, Montana, July 25-28, 2003, 2003, 385-393
  27. Kavitha Telikepalli and Kasturi Varadarajan
    On Shortest Paths in Line Arrangements
    In: 15th Canadian Conference in Computational Geometry (CCCG-03), Dalhousie University, Halifax, Canada, August 11-13, 2003, 2003, 170-173