| 227 | -- | 251 | Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych. Reoptimization of the Shortest Common Superstring Problem |
| 252 | -- | 273 | Fedor V. Fomin, Petr A. Golovach, Jan Kratochvíl, Dieter Kratsch, Mathieu Liedloff. Branch and Recharge: Exact Algorithms for Generalized Domination |
| 274 | -- | 297 | Vittorio Bilò, Angelo Fanelli, Michele Flammini, Luca Moscardelli. Graphical Congestion Games |
| 298 | -- | 319 | René Beier, Stefan Funke, Domagoj Matijevic, Peter Sanders. Energy-Efficient Paths in Radio Networks |
| 320 | -- | 341 | Kyriaki Ioannidou, George B. Mertzios, Stavros D. Nikolopoulos. The Longest Path Problem has a Polynomial Solution on Interval Graphs |
| 342 | -- | 361 | Ernst Althaus, Stefan Canzar, Khaled M. Elbassioni, Andreas Karrenbauer, Julián Mestre. Approximation Algorithms for the Interval Constrained Coloring Problem |
| 362 | -- | 388 | Hans L. Bodlaender, Michael R. Fellows, Michael A. Langston, Mark A. Ragan, Frances A. Rosamond, Mark Weyer. Quadratic Kernelization for Convex Recoloring of Trees |
| 389 | -- | 401 | Liam Roditty, Uri Zwick. On Dynamic Shortest Paths Problems |
| 402 | -- | 418 | Kuo-Hua Kao, Jou-Ming Chang, Yue-Li Wang, Justie Su-tzu Juan. A Quadratic Algorithm for Finding Next-to-Shortest Paths in Graphs |
| 419 | -- | 446 | Thomas Moscibroda, Stefan Schmid, Roger Wattenhofer. Topological Implications of Selfish Neighbor Selection in Unstructured Peer-to-Peer Networks |
| 447 | -- | 462 | Xi Chen, Xiaotie Deng, Becky Jie Liu. On Incentive Compatible Competitive Selection Protocols |
| 463 | -- | 505 | Michael A. Bender, Gerth Stølting Brodal, Rolf Fagerberg, Dongdong Ge, Simai He, Haodong Hu, John Iacono, Alejandro López-Ortiz. The Cost of Cache-Oblivious Searching |