| 901 | -- | 913 | Timothy M. Chan, Stephane Durocher, Matthew Skala, Bryan T. Wilkinson. Linear-Space Data Structures for Range Minority Query in Arrays |
| 914 | -- | 939 | Paola Bonizzoni, Riccardo Dondi, Giancarlo Mauri, Italo Zoppis. Restricted and Swap Common Superstring: A Multivariate Algorithmic Perspective |
| 940 | -- | 968 | Keith Edwards, Eric McDermid. A General Reduction Theorem with Applications to Pathwidth and the Complexity of MAX 2-CSP |
| 969 | -- | 994 | Joan Boyar, Sandy Irani, Kim S. Larsen. A Comparison of Performance Measures for Online Algorithms |
| 995 | -- | 1010 | Fabrizio Frati, Serge Gaspers, Joachim Gudmundsson, Luke Mathieson. Augmenting Graphs to Minimize the Diameter |
| 1011 | -- | 1032 | Gruia Calinescu, Minming Li. Register Loading via Linear Programming |
| 1033 | -- | 1054 | Seok-Hee Hong, Peter Eades, Naoki Katoh, Giuseppe Liotta, Pascal Schweitzer, Yusuke Suzuki. A Linear-Time Algorithm for Testing Outer-1-Planarity |
| 1055 | -- | 1096 | Gianlorenzo D'Angelo, Gabriele Di Stefano, Alfredo Navarra, Nicolas Nisse, Karol Suchan. Computing on Rings by Oblivious Robots: A Unified Approach for Different Tasks |
| 1097 | -- | 1129 | Luis Barba, Matias Korman, Stefan Langerman, Kunihiko Sadakane, Rodrigo I. Silveira. Space-Time Trade-offs for Stack-Based Algorithms |
| 1130 | -- | 1171 | Leah Epstein, Asaf Levin, Gerhard J. Woeginger. The (Weighted) Metric Dimension of Graphs: Hard and Easy Cases |