| 2008 | (Un)-Stable Routing in the Internet: A Survey from the Algorithmic Perspective. Luca Cittadini, Giuseppe Di Battista, Massimo Rimondini |
| 2008 | A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs. Paul S. Bonsma, Florian Zickfeld |
| 2008 | A Faster Shortest-Paths Algorithm for Minor-Closed Graph Classes. Siamak Tazari, Matthias Müller-Hannemann |
| 2008 | A Lower Bound on the Area Requirements of Series-Parallel Graphs. Fabrizio Frati |
| 2008 | A Most General Edge Elimination Polynomial. Ilya Averbouch, Benny Godlin, Johann A. Makowsky |
| 2008 | Additive Spanners for Circle Graphs and Polygonal Graphs. Feodor F. Dragan, Derek G. Corneil, Ekkehard Köhler, Yang Xiang |
| 2008 | Algorithmic Meta Theorems. Martin Grohe |
| 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 | Approximating the Metric TSP in Linear Time. Davide Bilò, Luca Forlizzi, Guido Proietti |
| 2008 | Characterizations of Restricted Pairs of Planar Graphs Allowing Simultaneous Embedding with Fixed Edges. J. Joseph Fowler, Michael Jünger, Stephen G. Kobourov, Michael Schulz |
| 2008 | Complexity of the Packing Coloring Problem for Trees. Jirí Fiala, Petr A. Golovach |
| 2008 | Cutwidth of Split Graphs, Threshold Graphs, and Proper Interval Graphs. Pinar Heggernes, Daniel Lokshtanov, Rodica Mihai, Charis Papadopoulos |
| 2008 | Digraph Decompositions and Monotonicity in Digraph Searching. Stephan Kreutzer, Sebastian Ordyniak |
| 2008 | Evaluations of Graph Polynomials. Benny Godlin, Tomer Kotek, Johann A. Makowsky |
| 2008 | Fast Robber in Planar Graphs. Nicolas Nisse, Karol Suchan |
| 2008 | Faster Exact Bandwidth. Marek Cygan, Marcin Pilipczuk |
| 2008 | From a Circular-Arc Model to a Proper Circular-Arc Model. Yahav Nussbaum |
| 2008 | Graph-Theoretic Concepts in Computer Science, 34th International Workshop, WG 2008, Durham, UK, June 30 - July 2, 2008. Revised Papers Hajo Broersma, Thomas Erlebach, Tom Friedetzky, Daniël Paulusma |
| 2008 | Improved Upper Bounds for Partial Vertex Cover. Joachim Kneis, Alexander Langer, Peter Rossmanith |
| 2008 | Local Construction and Coloring of Spanners of Location Aware Unit Disk Graphs. Andreas Wiese, Evangelos Kranakis |
| 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 | Memory Efficient Anonymous Graph Exploration. Leszek Gasieniec, Tomasz Radzik |
| 2008 | On Independent Sets and Bicliques in Graphs. Serge Gaspers, Dieter Kratsch, Mathieu Liedloff |
| 2008 | On the Expressive Power of CNF Formulas of Bounded Tree- and Clique-Width. Pascal Koiran, Klaus Meer |
| 2008 | On the Pseudo-achromatic Number Problem. Jianer Chen, Iyad A. Kanj, Jie Meng, Ge Xia, Fenghui Zhang |
| 2008 | Parameterized Complexity for Domination Problems on Degenerate Graphs. Petr A. Golovach, Yngve Villanger |
| 2008 | Parameterized Graph Cleaning Problems. Dániel Marx, Ildikó Schlotter |
| 2008 | Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms. Athanassios Koutsonas, Dimitrios M. Thilikos |
| 2008 | Searching for a Visible, Lazy Fugitive. David Richerby, Dimitrios M. Thilikos |
| 2008 | The Rank-Width of the Square Grid. Vít Jelínek |
| 2008 | The Valve Location Problem in Simple Network Topologies. Hans L. Bodlaender, Alexander Grigoriev, Nadejda V. Grigorieva, Albert Hendriks |
| 2008 | Traffic Grooming in Unidirectional WDM Rings with Bounded Degree Request Graph. Xavier Muñoz, Ignasi Sau |
| 2008 | Upward Straight-Line Embeddings of Directed Graphs into Point Sets. Alejandro Estrella-Balderrama, Fabrizio Frati, Stephen G. Kobourov |
| 2008 | What Is between Chordal and Weakly Chordal Graphs?. Elad Cohen, Martin Charles Golumbic, Marina Lipshteyn, Michal Stern |