MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 15 documents:

  1. New Approximation Algorithms for Minimum Cycle Bases of Graphs
    Telikepalli Kavitha, Kurt Mehlhorn, and Dimitrios Michail
    Algorithmica 59 (4): 471-488, 2011
  2. 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
  3. Cycle Bases of Graphs and Sampled Manifolds
    Craig Gotsman, Kanela Kaligosi, Kurt Mehlhorn, Dimitrios Michail, and Evangelia Pyrga
    Computer Aided Geometric Design 24 (8/9): 464 p., 2007. Note: accepted for publication in Computer Aided Geometric Design journal

  4. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    Journal of Experimental Algorithmics 11: 1-14, 2007
    [PDF: Download: Mehlhorn2007b.pdf]
  5. 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]
  6. Reducing rank-maximal to maximum weight matching
    Dimitrios Michail
    Theoretical Computer Science 389 (1-2): 125-132, 2007
  7. 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

  8. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    ACM Journal of Experimental Algorithmics 11: 1-14, 2006

  9. Minimum Cycle Basis, Algorithms & Applications
    Dimitrios Michail
    Doctoral dissertation, Universit├Ąt des Saarlandes, 2006
    [PDF: Download: thesis.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

  11. Implementing Minimum Cycle Basis Algorithms
    Kurt Mehlhorn and Dimitrios Michail
    In: Experimental and Efficient Algorithms, 4th InternationalWorkshop, WEA 2005, Santorini, Greece, 2005, 32-43
    [PDF: Download: 187.pdf]
  12. Network Problems with Non-Polynomial Weights and Applications
    Kurt Mehlhorn and Dimitrios Michail

    [PDF: Download: 181.pdf]
  13. 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]
  14. 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

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