A Purely Democratic Characterization of W[1]

Approximating the 2-interval pattern problem

Constraint satisfaction problems: Convexity makes AllDifferent constraints tractable

Haplotype Inference Constrained by Plausible Haplotype Data

article by Michael R. Fellows et al published 2009 in Lecture Notes in Computer Science

Haplotype inference constrained by plausible haplotype data

artículo científico publicado en 2011

Locality and gaps in RNA comparison.

artículo científico publicado en 2007

On Problems without Polynomial Kernels (Extended Abstract)

On problems without polynomial kernels

On the parameterized complexity of multiple-interval graph problems

Tractable Parameterizations for the Minimum Linear Arrangement Problem

Upper and lower bounds for finding connected motifs in vertex-colored graphs

W-Hierarchies Defined by Symmetric Gates

Well Quasi Orders in Subclasses of Bounded Treewidth Graphs and Their Algorithmic Applications

Well-Quasi-Orders in Subclasses of Bounded Treewidth Graphs