Journal: Theory Comput. Syst.

Volume 41, Issue 3

397 -- 0Rod Downey. Foreword
399 -- 410Faisal N. Abu-Khzam. Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems
411 -- 430Faisal N. Abu-Khzam, Michael R. Fellows, Michael A. Langston, W. Henry Suters. Crown Structures for Vertex Cover Kernelization
431 -- 444Hans-Joachim Böckenhauer, Juraj Hromkovic, Joachim Kneis, Joachim Kupke. The Parameterized Approximability of TSP with Deadlines
445 -- 457Jonathan F. Buss, Tarique Islam. Algorithms in the W-Hierarchy
459 -- 477Liming Cai, Michael R. Fellows, David W. Juedes, Frances A. Rosamond. The Complexity of Polynomial-Time Approximation
479 -- 492Frank K. H. A. Dehne, Michael R. Fellows, Michael A. Langston, Frances A. Rosamond, Kim Stevens. An O(2:::O(k):::n:::3:::) FPT Algorithm for the Undirected Feedback Vertex Set Problem
493 -- 500Bernhard Fuchs, Walter Kern, Daniel Mölle, Stefan Richter, Peter Rossmanith, Xinhui Wang. Dynamic Programming for Minimum Steiner Trees
501 -- 520Jiong Guo, Rolf Niedermeier, Sebastian Wernicke. Parameterized Complexity of Vertex Cover Variants
521 -- 538Gregory Gutin, Arash Rafiey, Stefan Szeider, Anders Yeo. The Linear Arrangement Problem Parameterized Above Guaranteed Value
539 -- 550Michael T. Hallett, Catherine McCartin. A Faster FPT Algorithm for the Maximum Agreement Forest Problem
551 -- 562Petr Hlinený. Some Hard Problems on Matroid Spikes
563 -- 587Venkatesh Raman, Saket Saurabh, Somnath Sikdar. Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques