| no |
title |
author |
magazine |
year |
volume |
issue |
page(s) |
type |
| 1 |
Charge and reduce: A fixed-parameter algorithm for String-to-String Correction
|
Abu-Khzam, Faisal N.
|
|
2011
|
8 |
1 |
p. 41-49
9 p.
|
article
|
| 2 |
Editorial Board
|
|
|
2011
|
8 |
1 |
p. IFC-
1 p.
|
article
|
| 3 |
FPT algorithms for path-transversal and cycle-transversal problems
|
Guillemot, Sylvain
|
|
2011
|
8 |
1 |
p. 61-71
11 p.
|
article
|
| 4 |
Graph-based data clustering with overlaps
|
Fellows, Michael R.
|
|
2011
|
8 |
1 |
p. 2-17
16 p.
|
article
|
| 5 |
Lower bounds on kernelization
|
Misra, Neeldhara
|
|
2011
|
8 |
1 |
p. 110-128
19 p.
|
article
|
| 6 |
On the algorithmic effectiveness of digraph decompositions and complexity measures
|
Lampis, Michael
|
|
2011
|
8 |
1 |
p. 129-138
10 p.
|
article
|
| 7 |
On the directed Full Degree Spanning Tree problem
|
Lokshtanov, Daniel
|
|
2011
|
8 |
1 |
p. 97-109
13 p.
|
article
|
| 8 |
Parameterized algorithms for double hypergraph dualization with rank limitation and maximum minimal vertex cover
|
Damaschke, Peter
|
|
2011
|
8 |
1 |
p. 18-24
7 p.
|
article
|
| 9 |
Parameterized complexity and approximability of the Longest Compatible Sequence problem
|
Guillemot, S.
|
|
2011
|
8 |
1 |
p. 50-60
11 p.
|
article
|
| 10 |
Paths of bounded length and their cuts: Parameterized complexity and algorithms
|
Golovach, Petr A.
|
|
2011
|
8 |
1 |
p. 72-86
15 p.
|
article
|
| 11 |
Special Issue on Parameterized Complexity of Discrete Optimization
|
Fellows, Michael R.
|
|
2011
|
8 |
1 |
p. 1-
1 p.
|
article
|
| 12 |
Stable assignment with couples: Parameterized complexity and local search
|
Marx, Dániel
|
|
2011
|
8 |
1 |
p. 25-40
16 p.
|
article
|
| 13 |
The parameterized complexity of k -flip local search for SAT and MAX SAT
|
Szeider, Stefan
|
|
2011
|
8 |
1 |
p. 139-145
7 p.
|
article
|
| 14 |
Treewidth governs the complexity of target set selection
|
Ben-Zwi, Oren
|
|
2011
|
8 |
1 |
p. 87-96
10 p.
|
article
|
Journal description