1. Foreword

   • Susanne Albers
   • Tomasz Radzik

   EditorialNotes Pages: 1 - 2

2. Maximum matchings in planar graphs via gaussian elimination

   • Marcin Mucha
   • Piotr Sankowski

   OriginalPaper Pages: 3 - 20

3. Hardness and approximation results for packing steiner trees

   • Joseph Cheriyan
   • Mohammad R. Salavatipour

   OriginalPaper Pages: 21 - 43

4. Direct routing: Algorithms and complexity

   • Costas Busch
   • Malik Magdon-Ismail
   • Paul Spirakis

   OriginalPaper Pages: 45 - 68

5. Maximizing throughput in multi-queue switches

   • Yossi Azar
   • Arik Litichevskey

   OriginalPaper Pages: 69 - 90

6. Approximate unions of lines and minkowski sums

   • Marc van Kreveld
   • A. Frank van der Stappen

   OriginalPaper Pages: 91 - 107

7. Swap and mismatch edit distance

   • Amihood Amir
   • Estrella Eisenberg
   • Ely Porat

   OriginalPaper Pages: 109 - 120

8. An experimental study of random knapsack problems

   • Rene Beier
   • Berthold Vöcking

   OriginalPaper Pages: 121 - 136

9. Data migration on parallel disks: Algorithms and evaluation

   • Leana Golubchik
   • Samir Khuller
   • Yung-Chun (Justin) Wan

   OriginalPaper Pages: 137 - 158