| 149 | -- | 151 | David Fernández-Baca. Editorial |
| 152 | -- | 170 | Hee-Kap Ahn, Sang Won Bae, Otfried Cheong, Joachim Gudmundsson, Takeshi Tokuyama, Antoine Vigneron. A Generalization of the Convex Kakeya Problem |
| 171 | -- | 194 | Armando Castañeda, Maurice Herlihy, Sergio Rajsbaum. An Equivariance Theorem with Applications to Renaming |
| 195 | -- | 207 | Marek Cygan, Marcin Pilipczuk, Michal Pilipczuk, Jakub Onufry Wojtaszczyk. Solving the 2-Disjoint Connected Subgraphs Problem Faster than 2 n |
| 208 | -- | 244 | Daniel Dadush. A Randomized Sieving Algorithm for Approximate Integer Programming |
| 245 | -- | 266 | Michel Habib, Antoine Mamcarz, Fabien de Montgolfier. Computing H-Joins with Application to 2-Modular Decomposition |
| 267 | -- | 300 | Ahmed Helmi, Conrado Martínez, Alois Panholzer. Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate" |
| 301 | -- | 325 | Bernard Mans, Igor Shparlinski. Random Walks, Bisections and Gossiping in Circulant Graphs |
| 326 | -- | 339 | Monaldo Mastrolilli. The Feedback Arc Set Problem with Triangle Inequality Is a Vertex Cover Problem |
| 340 | -- | 364 | Zeev Nutov. Degree Constrained Node-Connectivity Problems |