| 247 | -- | 248 | Laura Sanità, Martin Skutella. WAOA 2015 Special Issue on TOCS |
| 249 | -- | 267 | Yishay Mansour, Boaz Patt-Shamir, Shai Vardi. Constant-Time Local Computation Algorithms |
| 268 | -- | 303 | Sándor P. Fekete, Kan Huang, Joseph S. B. Mitchell, Ojas Parekh, Cynthia A. Phillips. Geometric Hitting Set for Segments of Few Orientations |
| 304 | -- | 318 | Roozbeh Ebrahimi, Samuel McCauley, Benjamin Moseley. Scheduling Parallel Jobs Online with Convex and Concave Parallelizability |
| 319 | -- | 336 | Katarzyna E. Paluch. Maximum ATSP with Weights Zero and One via Half-Edges |
| 337 | -- | 348 | Bartlomiej Bosek, Dariusz Leniowski, Piotr Sankowski, Anna Zych-Pawlewicz. Shortest Augmenting Paths for Online Matchings on Trees |
| 349 | -- | 365 | Nikhil Bansal, Marek Eliás 0001, Lukasz Jez, Grigorios Koumoutsos, Kirk Pruhs. Tight Bounds for Double Coverage Against Weak Adversaries |
| 366 | -- | 418 | Jan Reineke, Alejandro Salinger. On the Smoothness of Paging Algorithms |
| 419 | -- | 440 | Shay Mozes, Eyal E. Skop. Efficient Vertex-Label Distance Oracles for Planar Graphs |
| 441 | -- | 464 | Kamiel Cornelissen, Ruben Hoeksma, Bodo Manthey, N. S. Narayanaswamy, C. S. Rahul, Marten Waanders. Approximation Algorithms for Connected Graph Factors of Minimum Weight |