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