| 1 | -- | 2 | Burkhard Monien, Ulf-Peter Schroeder. Preface |
| 3 | -- | 14 | Matthias Englert, Thomas Franke, Lars Olbrich. Sensitivity of Wardrop Equilibria |
| 15 | -- | 37 | Niv Buchbinder, Liane Lewin-Eytan, Joseph Naor, Ariel Orda. Non-Cooperative Cost Sharing Games via Subsidies |
| 38 | -- | 59 | Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spirakis. Atomic Congestion Games: Fast, Myopic and Concurrent |
| 60 | -- | 112 | Rainer Feldmann, Marios Mavronicolas, Andreas Pieris. Facets of the Fully Mixed Nash Equilibrium Conjecture |
| 113 | -- | 136 | Dimitris Fotakis. Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy |
| 137 | -- | 161 | Jeff Edmonds, Suprakash Datta, Patrick W. Dymond. TCP is Competitive with Resource Augmentation |
| 162 | -- | 178 | Olaf Beyersdorff. The Deduction Theorem for Strong Propositional Proof Systems |
| 179 | -- | 195 | Francine Blanchet-Sadri, E. Clader, O. Simpson. Border Correlations of Partial Words |
| 196 | -- | 217 | Falk Hüffner, Christian Komusiewicz, Hannes Moser, Rolf Niedermeier. Fixed-Parameter Algorithms for Cluster Vertex Deletion |
| 218 | -- | 249 | Dimitris Fotakis. Stackelberg Strategies for Atomic Congestion Games |
| 250 | -- | 258 | Olgo Kharlampovich, I. G. Lysënok, Alexei G. Myasnikov, Nicholas W. M. Touikan. The Solvability Problem for Quadratic Equations over Free Groups is NP-Complete |
| 259 | -- | 287 | Philippe Raipin Parvédy, Michel Raynal, Corentin Travers. Strongly Terminating Early-Stopping ::::k::::-Set Agreement in Synchronous Systems with General Omission Failures |
| 288 | -- | 299 | Jacobo Torán. Reductions to Graph Isomorphism |