| 115 | -- | 128 | Micha Streppel, Ke Yi. Approximate Range Searching in External Memory |
| 129 | -- | 144 | Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Stefan Langerman, Ilan Newman, Oren Weimann. The Stackelberg Minimum Spanning Tree Game |
| 145 | -- | 168 | Alfredo García Olaverri, Javier Tejel. Augmenting the Rigidity of a Graph in ::::R:::::::2::: |
| 169 | -- | 194 | Frédéric Havet, Martin Klazar, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff. Exact Algorithms for ::::L::::(2, 1)-Labeling of Graphs |
| 195 | -- | 214 | Viet Tung Hoang, Wing-Kin Sung. Improved Algorithms for Maximum Agreement and Compatible Supertrees |
| 215 | -- | 239 | Benson L. Joeris, Min Chih Lin, Ross M. McConnell, Jeremy Spinrad, Jayme Luiz Szwarcfiter. Linear-Time Recognition of Helly Circular-Arc Models and Graphs |
| 240 | -- | 255 | Lukasz Kowalik, Marcin Mucha. 35/44-approximation for Asymmetric Maximum TSP with Triangle Inequality |
| 256 | -- | 268 | Christoph Dürr, Mathilde Hurand. Finding Total Unimodularity in Optimization Problems Solved by Linear Programs |
| 269 | -- | 297 | Dong Kyue Kim, Joong Chae Na, Jeong Seop Sim, Kunsoo Park. Linear-Time Construction of Two-Dimensional Suffix Trees |