| 2008 | On the Complexity of Reconfiguration Problems. | Takehiro Ito, Erik D. Demaine, Nicholas J. A. Harvey, Christos H. Papadimitriou, Martha Sideri, Ryuhei Uehara, Yushi Uno |
| 2008 | Constructing the Simplest Possible Phylogenetic Network from Triplets. | Leo van Iersel, Steven Kelk |
| 2008 | The Balanced Edge Cover Problem. | Yuta Harada, Hirotaka Ono, Kunihiko Sadakane, Masafumi Yamashita |
| 2008 | Greedy Construction of 2-Approximation Minimum Manhattan Network. | Zeyu Guo, He Sun, Hong Zhu |
| 2008 | Multiobjective Disk Cover Admits a PTAS. | Christian Glaer, Christian Reitwiener, Heinz Schmitz |
| 2008 | Space-Efficient Informational Redundancy. | Christian Glaer |
| 2008 | Computing Frequency Dominators and Related Problems. | Loukas Georgiadis |
| 2008 | Minimizing Total Flow-Time: The Unrelated Case. | Naveen Garg, Amit Kumar, V. N. Muralidhara |
| 2008 | Data Stream Algorithms via Expander Graphs. | Sumit Ganguly |
| 2008 | Finding Long Paths, Cycles and Circuits. | Harold N. Gabow, Shuxin Nie |
| 2008 | Average Update Times for Fully-Dynamic All-Pairs Shortest Paths. | Tobias Friedrich, Nils Hebbinghaus |
| 2008 | Super-Exponential Size Advantage of Quantum Finite Automata with Mixed States. | Rusins Freivalds |
| 2008 | How to Guard a Graph?. | Fedor V. Fomin, Petr A. Golovach, Alexander Hall, Mats Mihalk, Elias Vicari, Peter Widmayer |
| 2008 | Tree Decontamination with Temporary Immunity. | Paola Flocchini, Bernard Mans, Nicola Santoro |
| 2008 | Leaf Powers and Their Properties: Using the Trees. | Michael R. Fellows, Daniel Meister, Frances A. Rosamond, R. Sritharan, Jan Arne Telle |
| 2008 | Graph Layout Problems Parameterized by Vertex Cover. | Michael R. Fellows, Daniel Lokshtanov, Neeldhara Misra, Frances A. Rosamond, Saket Saurabh |
| 2008 | Comparing First-Fit and Next-Fit for Online Edge Coloring. | Martin R. Ehmsen, Lene M. Favrholdt, Jens S. Kohrt, Rodica Mihai |
| 2008 | Some Constrained Notions of Planarity. | Peter Eades |
| 2008 | Navigating in a Graph by Aid of Its Spanning Tree. | Feodor F. Dragan, Martn Matamala |
| 2008 | Efficient Output-Sensitive Construction of Reeb Graphs. | Harish Doraiswamy, Vijay Natarajan |
| 2008 | Succinct and I/O Efficient Data Structures for Traversal in Trees. | Craig Dillabaugh, Meng He, Anil Maheshwari |
| 2008 | Squaring the Circle with Weak Mobile Robots. | Yoann Dieudonn, Franck Petit |
| 2008 | Bidirectional Core-Based Routing in Dynamic Time-Dependent Road Networks. | Daniel Delling, Giacomo Nannicini |
| 2008 | Computing Best Swaps in Optimal Tree Spanners. | Shantanu Das, Beat Gfeller, Peter Widmayer |
| 2008 | 3-Message NP Arguments in the BPK Model with Optimal Soundness and Zero-Knowledge. | Giovanni Di Crescenzo, Helger Lipmaa |