MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 7 documents:

  1. 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]
  2. All-pairs nearly 2-approximate shortest paths in $O(n^2 \mathrm polylog n)$ time
    Surender Baswana, Vishrut Goyal, and Sandeep Sen
    In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science, Stuttgart, Germany, 2005, 666-679
    [PS: Download: stacs05.ps]
  3. Roundings Respecting Hard Constraints
    Benjamin Doerr
    In: STACS 2005 : 22nd Annual Symposium on Theoretical Aspects of Computer Science (STACS'05), Stuttgart, Germany, 2005, 617-628
  4. Matching Algorithms Are Fast in Sparse Random Graphs
    Holger Bast, Kurt Mehlhorn, Guido Schäfer, and Hisao Tamaki
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 81-92

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

  6. Sum-Multicoloring on Paths
    Annamária Kovács
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 68-80
  7. Topology matters: Smoothed competitiveness of metrical task systems
    Guido Schäfer and Naveen Sivadasan
    In: 21st Annual Symposium on Theoretical Aspects of Computer Science (STACS-04), Montpellier, France, 2004, 489-500
    [PS: Download: stacs04.ps]