1. Foreword from the Guest Editors

   • Jianer Chen
   • Iyad A. Kanj

   OriginalPaper 04 December 2007 Pages: 113 - 113

2. Algorithm Engineering for Color-Coding with Applications to Signaling Pathway Detection

   • Falk Hüffner
   • Sebastian Wernicke
   • Thomas Zichner

   OriginalPaper 22 September 2007 Pages: 114 - 132

3. Fixed-Parameter Complexity of Minimum Profile Problems

   • Gregory Gutin
   • Stefan Szeider
   • Anders Yeo

   OriginalPaper 14 December 2007 Pages: 133 - 152

4. Solving Connected Dominating Set Faster than 2 ⁿ

   • Fedor V. Fomin
   • Fabrizio Grandoni
   • Dieter Kratsch

   OriginalPaper 08 December 2007 Pages: 153 - 166

5. Faster Fixed-Parameter Tractable Algorithms for Matching and Packing Problems

   • M. R. Fellows
   • C. Knauer
   • S. Whitesides

   OriginalPaper 07 December 2007 Pages: 167 - 176

6. Improved Algorithms and Complexity Results for Power Domination in Graphs

   • Jiong Guo
   • Rolf Niedermeier
   • Daniel Raible

   OriginalPaper 07 December 2007 Pages: 177 - 202

7. Short Cycles Make W-hard Problems Hard: FPT Algorithms for W-hard Problems in Graphs with no Short Cycles

   • Venkatesh Raman
   • Saket Saurabh

   OriginalPaper 03 January 2008 Pages: 203 - 225

8. Exact Algorithms for Exact Satisfiability and Number of Perfect Matchings

   • Andreas Björklund
   • Thore Husfeldt

   OriginalPaper 14 December 2007 Pages: 226 - 249

9. An Improved (and Practical) Parameterized Algorithm for the Individual Haplotyping Problem MFR with Mate-Pairs

   • Minzhu Xie
   • Jianxin Wang

   OriginalPaper 05 December 2007 Pages: 250 - 266

10. On the Parameterized Complexity of Layered Graph Drawing

    • Vida Dujmović
    • Michael R. Fellows
    • David R. Wood

    OriginalPaper 07 December 2007 Pages: 267 - 292

11. On the Minimum Feedback Vertex Set Problem: Exact and Enumeration Algorithms

    • Fedor V. Fomin
    • Serge Gaspers
    • Igor Razgon

    OriginalPaper 08 December 2007 Pages: 293 - 307