| 1 | -- | 2 | Susanne Albers, Tomasz Radzik. Foreword |
| 3 | -- | 20 | Marcin Mucha, Piotr Sankowski. Maximum Matchings in Planar Graphs via Gaussian Elimination |
| 21 | -- | 43 | Joseph Cheriyan, Mohammad R. Salavatipour. Hardness and Approximation Results for Packing Steiner Trees |
| 45 | -- | 68 | Costas Busch, Malik Magdon-Ismail, Marios Mavronicolas, Paul G. Spirakis. Direct Routing: Algorithms and Complexity |
| 69 | -- | 90 | Yossi Azar, Arik Litichevskey. Maximizing Throughput in Multi-Queue Switches |
| 91 | -- | 107 | Marc J. van Kreveld, A. Frank van der Stappen. Approximate Unions of Lines and Minkowski Sums |
| 109 | -- | 120 | Amihood Amir, Estrella Eisenberg, Ely Porat. Swap and Mismatch Edit Distance |
| 121 | -- | 136 | René Beier, Berthold Vöcking. An Experimental Study of Random Knapsack Problems |
| 137 | -- | 158 | Leana Golubchik, Samir Khuller, Yoo Ah Kim, Svetlana Shargorodskaya, Yung-Chun (Justin) Wan. Data Migration on Parallel Disks: Algorithms and Evaluation |