1. Foreword

   • Rod Downey, Guest Editor

   EditorialNotes Pages: 397 - 397

2. Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems

   • Faisal N. Abu-Khzam

   OriginalPaper Pages: 399 - 410

3. Crown Structures for Vertex Cover Kernelization

   • Faisal N. Abu-Khzam
   • Michael R. Fellows
   • W. Henry Suters

   OriginalPaper Pages: 411 - 430

4. The Parameterized Approximability of TSP with Deadlines

   • Hans-Joachim Bockenhauer
   • Juraj Hromkovic
   • Joachim Kupke

   OriginalPaper Pages: 431 - 444

5. Algorithms in the W-Hierarchy

   • Jonathan F. Buss
   • Tarique Islam

   OriginalPaper Pages: 445 - 457

6. The Complexity of Polynomial-Time Approximation

   • Liming Cai
   • Michael Fellows
   • Frances Rosamond

   OriginalPaper Pages: 459 - 477

7. An O(2^O(k)n³) FPT Algorithm for the Undirected Feedback Vertex Set Problem

   • Frank Dehne
   • Michael Fellows
   • Kim Stevens

   OriginalPaper Pages: 479 - 492

8. Dynamic Programming for Minimum Steiner Trees

   • B. Fuchs
   • W. Kern
   • X. Wang

   OriginalPaper Pages: 493 - 500

9. Parameterized Complexity of Vertex Cover Variants

   • Jiong Guo
   • Rolf Niedermeier
   • Sebastian Wernicke

   OriginalPaper Pages: 501 - 520

10. The Linear Arrangement Problem Parameterized Above Guaranteed Value

    • Gregory Gutin
    • Arash Rafiey
    • Anders Yeo

    OriginalPaper Pages: 521 - 538

11. A Faster FPT Algorithm for the Maximum Agreement Forest Problem

    • Michael Hallett
    • Catherine McCartin

    OriginalPaper Pages: 539 - 550

12. Some Hard Problems on Matroid Spikes

    • Petr Hlineny

    OriginalPaper Pages: 551 - 562

13. Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques

    • Venkatesh Raman
    • Saket Saurabh
    • Somnath Sikdar

    OriginalPaper Pages: 563 - 587