MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 7 documents:

  1. Simpler Approximation of the Maximum Asymmetric Traveling Salesman Problem
    Khaled Elbassioni, Katarzyna Paluch, and Anke van Zuylen
    In: 29th International Symposium on Theoretical Aspects of Computer Science : STACS'12, Paris, France, 2012, 501-506
  2. 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

  3. A New Approximation Algorithm for Multidimensional Rectangle Tiling
    Katarzyna Paluch
    In: Algorithms and Computation : 17th International Symposium, ISAAC 2006, Kolkata, India, 2006, 712-721
    [PDF: Download: isaac.pdf]
  4. Rank-Maximal Matchings
    Robert W. Irving, Kavitha Telikepalli, Kurt Mehlhorn, Dimitrios Michail, and Katarzyna Paluch
    ACM Transactions on Algorithms 2 (4): 602-610, 2006

  5. 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]
  6. 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

  7. 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