| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
|
Hallett, Michael
|
|
2007
|
41 |
3 |
p. 539-550
|
article
|
| 2 |
Algorithms in the W-Hierarchy
|
Buss, Jonathan F.
|
|
2007
|
41 |
3 |
p. 445-457
|
article
|
| 3 |
An O(2O(k)n3) FPT Algorithm for the Undirected Feedback Vertex Set Problem
|
Dehne, Frank
|
|
2007
|
41 |
3 |
p. 479-492
|
article
|
| 4 |
Crown Structures for Vertex Cover Kernelization
|
Abu-Khzam, Faisal N.
|
|
2007
|
41 |
3 |
p. 411-430
|
article
|
| 5 |
Dynamic Programming for Minimum Steiner Trees
|
Fuchs, B.
|
|
2007
|
41 |
3 |
p. 493-500
|
article
|
| 6 |
Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques
|
Raman, Venkatesh
|
|
2007
|
41 |
3 |
p. 563-587
|
article
|
| 7 |
Foreword
|
|
|
2007
|
41 |
3 |
p. 397
|
article
|
| 8 |
Parameterized Complexity of Vertex Cover Variants
|
Guo, Jiong
|
|
2007
|
41 |
3 |
p. 501-520
|
article
|
| 9 |
Pseudo-Kernelization: A Branch-then-Reduce Approach for FPT Problems
|
Abu-Khzam, Faisal N.
|
|
2007
|
41 |
3 |
p. 399-410
|
article
|
| 10 |
Some Hard Problems on Matroid Spikes
|
Hlineny, Petr
|
|
2007
|
41 |
3 |
p. 551-562
|
article
|
| 11 |
The Complexity of Polynomial-Time Approximation
|
Cai, Liming
|
|
2007
|
41 |
3 |
p. 459-477
|
article
|
| 12 |
The Linear Arrangement Problem Parameterized Above Guaranteed Value
|
Gutin, Gregory
|
|
2007
|
41 |
3 |
p. 521-538
|
article
|
| 13 |
The Parameterized Approximability of TSP with Deadlines
|
Bockenhauer, Hans-Joachim
|
|
2007
|
41 |
3 |
p. 431-444
|
article
|
Journal description