| 113 | -- | 0 | Jianer Chen, Iyad A. Kanj. Foreword from the Guest Editors |
| 114 | -- | 132 | Falk Hüffner, Sebastian Wernicke, Thomas Zichner. Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection |
| 133 | -- | 152 | Gregory Gutin, Stefan Szeider, Anders Yeo. Fixed-Parameter Complexity of Minimum Profile Problems |
| 153 | -- | 166 | Fedor V. Fomin, Fabrizio Grandoni, Dieter Kratsch. Solving Connected Dominating Set Faster than 2::: ::::n:::: ::: |
| 167 | -- | 176 | Michael R. Fellows, Christian Knauer, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Ulrike Stege, Dimitrios M. Thilikos, Sue Whitesides. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems |
| 177 | -- | 202 | Jiong Guo, Rolf Niedermeier, Daniel Raible. Improved Algorithms and Complexity Results for Power Domination in Graphs |
| 203 | -- | 225 | Venkatesh Raman, Saket Saurabh. Short Cycles Make ::::W:::: -hard Problems Hard: FPT Algorithms for ::::W:::: -hard Problems in Graphs with no Short Cycles |
| 226 | -- | 249 | Andreas Björklund, Thore Husfeldt. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings |
| 250 | -- | 266 | Minzhu Xie, Jianxin Wang. An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs |
| 267 | -- | 292 | Vida Dujmovic, Michael R. Fellows, Matthew Kitching, Giuseppe Liotta, Catherine McCartin, Naomi Nishimura, Prabhakar Ragde, Frances A. Rosamond, Sue Whitesides, David R. Wood. On the Parameterized Complexity of Layered Graph Drawing |
| 293 | -- | 307 | Fedor V. Fomin, Serge Gaspers, Artem V. Pyatkin, Igor Razgon. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms |