| 287 | -- | 311 | Glencora Borradaile, Erik D. Demaine, Siamak Tazari. Polynomial-Time Approximation Schemes for Subset-Connectivity Problems in Bounded-Genus Graphs |
| 312 | -- | 336 | Frank Kammer, Torsten Tholey. Approximation Algorithms for Intersection Graphs |
| 337 | -- | 357 | Davide Bilò, Luciano Gualà, Guido Proietti. Finding Best Swap Edges Minimizing the Routing Cost of a Spanning Tree |
| 358 | -- | 389 | George Karakostas, Euripides Markou. Emergency Connectivity in Ad-hoc Networks with Selfish Nodes |
| 390 | -- | 403 | Nikhil Bansal, Niv Buchbinder, Anupam Gupta, Joseph Naor. A Randomized O(log2 k)-Competitive Algorithm for Metric Bipartite Matching |
| 404 | -- | 425 | Susanne Albers, Fabian Müller, Swen Schmelzer. Speed Scaling on Parallel Processors |
| 426 | -- | 447 | Marcin Bienkowski. An Optimal Lower Bound for Buffer Management in Multi-Queue Switches |
| 448 | -- | 482 | Mashhood Ishaque, Csaba D. Tóth. Relative Convex Hulls in Semi-Dynamic Arrangements |
| 483 | -- | 503 | Andrew R. A. McGrae, Michele Zito. The Complexity of the Empire Colouring Problem |
| 504 | -- | 530 | Neeldhara Misra, Geevarghese Philip, Venkatesh Raman, Saket Saurabh. The Kernelization Complexity of Connected Domination in Graphs with (no) Small Cycles |
| 531 | -- | 544 | Xin He, Huaming Zhang. On Succinct Greedy Drawings of Plane Triangulations and 3-Connected Plane Graphs |