| 653 | -- | 0 | Jianer Chen, Michael R. Fellows. Foreword from the guest editors |
| 654 | -- | 685 | Marco Cesati. The Turing way to parameterized complexity |
| 686 | -- | 690 | Carlos Cotta, Pablo Moscato. The ::::k::::-F::EATURE:: S::ET:: problem is ::::W::::[2]-complete |
| 691 | -- | 706 | James Cheetham, Frank K. H. A. Dehne, Andrew Rau-Chaplin, Ulrike Stege, Peter J. Taillon. Solving large FPT problems on coarse-grained parallel machines |
| 707 | -- | 722 | R. Sai Anand, Thomas Erlebach, Alexander Hall, Stamatis Stefanakos. Call control with ::::k:::: rejections |
| 723 | -- | 741 | Jens Gramm, Rolf Niedermeier. A fixed-parameter algorithm for minimum quartet inconsistency |
| 742 | -- | 756 | Johann A. Makowsky, Julian Mariño. The parametrized complexity of knot polynomials |
| 757 | -- | 771 | Krzysztof Pietrzak. On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems |
| 772 | -- | 788 | Peter Heusch, Stefan Porschen, Ewald Speckenmeyer. Improving a fixed parameter tractability time bound for the shadow problem |
| 789 | -- | 807 | Liming Cai, David W. Juedes. On the existence of subexponential parameterized algorithms |
| 808 | -- | 832 | Jochen Alber, Henning Fernau, Rolf Niedermeier. Graph separators: a parameterized view |
| 833 | -- | 847 | Jianer Chen, Iyad A. Kanj. Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms |