All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. [Citation Graph (, )][DBLP]

Constructing the Simplest Possible Phylogenetic Network from Triplets. [Citation Graph (, )][DBLP]

Constructing Level-2 Phylogenetic Networks from Triplets. [Citation Graph (, )][DBLP]

The Complexity of the Single Individual SNP Haplotyping Problem. [Citation Graph (, )][DBLP]

Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. [Citation Graph (, )][DBLP]

Computing Rooted and Unrooted Maximum Consistent Supertrees [Citation Graph (, )][DBLP]

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels [Citation Graph (, )][DBLP]