Ed. Board
Advertisement
Foreword from the guest editors
The Turing way to parameterized complexity
The k-Feature Set problem is W[2]-complete
Solving large FPT problems on coarse-grained parallel machines
Call control with k rejections
A fixed-parameter algorithm for minimum quartet inconsistency
The parametrized complexity of knot polynomials
On the parameterized complexity of the fixed alphabet shortest common supersequence and longest common subsequence problems
Improving a fixed parameter tractability time bound for the shadow problem
On the existence of subexponential parameterized algorithms
Graph separators: a parameterized view
Constrained minimum vertex cover in bipartite graphs: complexity and parameterized algorithms
Papers to Appear
Volume Author Index
Volume TOC
C3 - Advertisement
C4 - TOC