MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 7 documents:

  1. On the value of preemption in scheduling
    Yair Bartal, Stefano Leonardi, Gill Shallom, and Rene Sitters
    In: 9th Workshop on Approximation Algorithms for Combinatorial Optimization Problems, APPROX, Barcelona, Spain, 2006, 39-48
  2. A Practical Minimum Spanning Tree Algorithm Using the Cycle Property
    Irit Katriel, Peter Sanders, and Jesper Larsson Träff
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September, 16-19, 2003, 679-690
  3. Algorithms and Experiments for the Webgraph
    Luigi Laura, Stefano Leonardi, Stefano Millozzi, Ulrich Meyer, and Jop F. Sibeyn
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 703-714
  4. Approximating Energy Efficient Paths in Wireless Multi-hop Networks
    Stefan Funke, Domagoj Matijevic, and Peter Sanders
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 2003, 2003, 230-241
    [PS: Download: RadioESA03long.ps.gz]
  5. Boolean Operations on 3D Selective Nef Complexes: Data Structure, Algorithms, and Implementation
    Miguel Granados, Peter Hachenberger, Susan Hert, Lutz Kettner, Kurt Mehlhorn, and Michael Seel
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 16-19, 2003, 2003, 654-666

  6. Packing a Trunk
    Friedrich Eisenbrand, Stefan Funke, Joachim Reichel, and Elmar Schömer
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, Hungary, September 2003, 2003, 618-629
    [PS: Download: trunk-esa03.ps.gz]
  7. I/O-Efficient Undirected Shortest Paths
    Ulrich Meyer and Norbert Zeh
    In: Algorithms - ESA 2003: 11th Annual European Symposium, Budapest, September, 16 - September, 19, 2003, 434-445