| 2008 | Parameterized Graph Cleaning Problems. | Dniel Marx, Ildik Schlotter |
| 2008 | Digraph Decompositions and Monotonicity in Digraph Searching. | Stephan Kreutzer, Sebastian Ordyniak |
| 2008 | Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. | Athanassios Koutsonas, Dimitrios M. Thilikos |
| 2008 | On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. | Pascal Koiran, Klaus Meer |
| 2008 | Improved Upper Bounds for Partial Vertex Cover. | Joachim Kneis, Alexander Langer, Peter Rossmanith |
| 2008 | The Rank-Width of the Square Grid. | Vt Jelnek |
| 2008 | Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. | Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
| 2008 | An Algorithm for Finding Input-Output Constrained Convex Sets in an Acyclic Digraph. | Gregory Z. Gutin, Adrian Johnstone, Joseph Reddington, Elizabeth Scott, Anders Yeo |
| 2008 | Algorithmic Meta Theorems. | Martin Grohe |
| 2008 | Parameterized Complexity for Domination Problems on Degenerate Graphs. | Petr A. Golovach, Yngve Villanger |
| 2008 | Evaluations of Graph Polynomials. | Benny Godlin, Tomer Kotek, Johann A. Makowsky |
| 2008 | On Independent Sets and Bicliques in Graphs. | Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
| 2008 | Memory Efficient Anonymous Graph Exploration. | Leszek Gasieniec, Tomasz Radzik |
| 2008 | A Lower Bound on the Area Requirements of Series-Parallel Graphs. | Fabrizio Frati |
| 2008 | Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. | J. Joseph Fowler, Michael Jnger, Stephen G. Kobourov, Michael Schulz |
| 2008 | Complexity of the Packing Coloring Problem for Trees. | Jir Fiala, Petr A. Golovach |
| 2008 | Upward Straight-Line Embeddings of Directed Graphs into Point Sets. | Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov |
| 2008 | Additive Spanners for Circle Graphs and Polygonal Graphs. | Feodor F. Dragan, Derek G. Corneil, Ekkehard Khler, Yang Xiang |
| 2008 | Faster Exact Bandwidth. | Marek Cygan, Marcin Pilipczuk |
| 2008 | Making Role Assignment Feasible: A Polynomial-Time Algorithm for Computing Ecological Colorings. | Pilu Crescenzi, Miriam Di Ianni, Federico Greco, Gianluca Rossi, Paola Vocca |
| 2008 | What Is between Chordal and Weakly Chordal Graphs?. | Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |
| 2008 | (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. | Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini |
| 2008 | On the Pseudo-achromatic Number Problem. | Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
| 2008 | A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. | Paul S. Bonsma, Florian Zickfeld |
| 2008 | The Valve Location Problem in Simple Network Topologies. | Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |