| 611 | -- | 612 | Susanne Albers, Pascal Weil. STACS 2008 Foreword |
| 613 | -- | 636 | Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, Alexander Wolff. Trimming of Graphs, with Application to Point Labeling |
| 637 | -- | 654 | Andreas Björklund, Thore Husfeldt, Petteri Kaski, Mikko Koivisto. Trimmed Moebius Inversion and Graphs of Bounded Degree |
| 655 | -- | 673 | Thomas Thierauf, Fabian Wagner. The Isomorphism Problem for Planar 3-Connected Graphs Is in Unambiguous Logspace |
| 674 | -- | 695 | Mirela Damian, Robin Y. Flatland, Joseph O Rourke, Suneeta Ramaswami. Connecting Polygonizations via Stretches and Twangs |
| 696 | -- | 719 | Diana Fischer, Erich Grädel, Lukasz Kaiser. Model Checking Games for the Quantitative ::::µ::::-Calculus |
| 720 | -- | 736 | Laurent Bienvenu, Andrej Muchnik, Alexander Shen, Nikolai K. Vereshchagin. Limit Complexities Revisited |
| 737 | -- | 757 | Samir Datta, Raghav Kulkarni, Sambuddha Roy. Deterministically Isolating a Perfect Matching in Bipartite Planar Graphs |
| 758 | -- | 785 | Jacques Sakarovitch, Rodrigo de Souza. Lexicographic Decomposition of ::::k::::-Valued Transducers |