| 541 | -- | 542 | Benjamin Doerr, Frank Neumann. In Memoriam: Ingo Wegener |
| 543 | -- | 565 | Sergio Cabello, Herman J. Haverkort, Marc J. van Kreveld, Bettina Speckmann. Algorithmic Aspects of Proportional Symbol Maps |
| 566 | -- | 590 | Elena Grigorieva, P. Jean-Jacques Herings, Rudolf Müller, Dries Vermeulen. On the Fastest Vickrey Algorithm |
| 591 | -- | 609 | Leena Salmela, Jorma Tarhio, Petri Kalsi. Approximate Boyer-Moore String Matching for Small Alphabets |
| 610 | -- | 636 | Gilad Goraly, Refael Hassin. Multi-Color Pebble Motion on Graphs |
| 637 | -- | 678 | Louis Ibarra. A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs |
| 679 | -- | 710 | Katerina Asdre, Stavros D. Nikolopoulos. The 1-Fixed-Endpoint Path Cover Problem is Polynomial on Interval Graphs |
| 711 | -- | 729 | Prosenjit Bose, Paz Carmi, Mohammad Farshi, Anil Maheshwari, Michiel H. M. Smid. Computing the Greedy Spanner in Near-Quadratic Time |
| 730 | -- | 769 | James Allen Fill, Takéhiko Nakama. Analysis of the Expected Number of Bit Comparisons Required by Quickselect |
| 770 | -- | 789 | Lukasz Kowalik. Fast 3-coloring Triangle-Free Planar Graphs |
| 790 | -- | 810 | Frederic Dorn, Eelko Penninkx, Hans L. Bodlaender, Fedor V. Fomin. Efficient Exact Algorithms on Planar Graphs: Exploiting Sphere Cut Decompositions |