| 0 | -- | 0 | Éva Tardos. Invited Articles Foreword |
| 40 | -- | 0 | Chandra Chekuri, Julia Chuzhoy. Polynomial Bounds for the Grid-Minor Theorem |
| 41 | -- | 0 | Ittai Abraham, Daniel Delling, Amos Fiat, Andrew V. Goldberg, Renato F. Werneck. Highway Dimension and Provably Efficient Shortest Path Algorithms |
| 42 | -- | 0 | Benjamin Doerr, Carola Doerr, Reto Spöhel, Henning Thomas. Playing Mastermind With Many Colors |
| 43 | -- | 0 | Heidi Gebauer, Tibor Szabó, Gábor Tardos. The Local Lemma Is Asymptotically Tight for SAT |
| 44 | -- | 0 | Hans L. Bodlaender, Fedor V. Fomin, Daniel Lokshtanov, Eelko Penninkx, Saket Saurabh, Dimitrios M. Thilikos. (Meta) Kernelization |
| 45 | -- | 0 | Julia Chuzhoy, Shi Li. A Polylogarithmic Approximation Algorithm for Edge-Disjoint Paths with Congestion 2 |
| 46 | -- | 0 | Anat Ganor, Gillat Kol, Ran Raz. Exponential Separation of Information and Communication for Boolean Functions |
| 47 | -- | 0 | Leonid Barenboim. Deterministic (Δ + 1)-Coloring in Sublinear (in Δ) Time in Static, Dynamic, and Faulty Networks |