 | 2012 |
| 22 |  | Steven Kelk,
Celine Scornavacca,
Leo van Iersel:
On the Elusiveness of Clusters.
IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 517-534 (2012) |
| 2011 |
| 21 |  | Leo van Iersel,
Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets.
Algorithmica 60(2): 207-235 (2011) |
| 20 |  | Steven Kelk,
Celine Scornavacca,
Leo van Iersel:
On the elusiveness of clusters
CoRR abs/1103.1834: (2011) |
| 19 |  | Steven Kelk,
Celine Scornavacca:
Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable
CoRR abs/1108.3653: (2011) |
| 18 |  | Steven Kelk:
A note on efficient computation of hybridization number via softwired clusters
CoRR abs/1108.4642: (2011) |
| 17 |  | Steven Kelk,
Leo van Iersel,
Nela Lekic,
Simone Linz,
Celine Scornavacca,
Leen Stougie:
Cycle killer... qu'est-ce que
CoRR abs/1112.5359: (2011) |
| 16 |  | Katharina T. Huber,
Leo van Iersel,
Steven Kelk,
Radoslaw Suchecki:
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks.
IEEE/ACM Trans. Comput. Biology Bioinform. 8(3): 635-649 (2011) |
| 15 |  | Harry Buhrman,
Peter T. S. van der Gulik,
Steven Kelk,
Wouter M. Koolen,
Leen Stougie:
Some Mathematical Refinements Concerning Error Minimization in the Genetic Code.
IEEE/ACM Trans. Comput. Biology Bioinform. 8(5): 1358-1372 (2011) |
| 2010 |
| 14 |  | Leo van Iersel,
Steven Kelk,
Regula Rupp,
Daniel H. Huson:
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.
Bioinformatics [ISMB] 26(12): 124-131 (2010) |
| 13 |  | Jaroslaw Byrka,
Pawel Gawrychowski,
Katharina T. Huber,
Steven Kelk:
Worst-case optimal approximation algorithms for maximizing triplet consistency within phylogenetic networks.
J. Discrete Algorithms 8(1): 65-75 (2010) |
| 2009 |
| 12 |  | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
Ferry Hagen,
Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets.
IEEE/ACM Trans. Comput. Biology Bioinform. 6(4): 667-681 (2009) |
| 11 |  | Leo van Iersel,
Steven Kelk,
Matthias Mnich:
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.
J. Bioinformatics and Computational Biology 7(4): 597-623 (2009) |
| 2008 |
| 10 |  | Leo van Iersel,
Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets.
ISAAC 2008: 472-483 |
| 9 |  | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
Ferry Hagen,
Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets.
RECOMB 2008: 450-462 |
| 8 |  | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie:
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
IEEE/ACM Trans. Comput. Biology Bioinform. 5(2): 301-312 (2008) |
| 2007 |
| 7 |  | Cor A. J. Hurkens,
Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
John Tromp:
Prefix Reversals on Binary and Ternary Strings.
AB 2007: 292-306 |
| 6 |  | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica 49(1): 13-36 (2007) |
| 5 |  | Cor A. J. Hurkens,
Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
John Tromp:
Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discrete Math. 21(3): 592-611 (2007) |
| 2006 |
| 4 |  | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie:
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
WABI 2006: 80-91 |
| 2005 |
| 3 |  | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
On the Complexity of Several Haplotyping Problems.
WABI 2005: 128-139 |
| 2004 |
| 2 |  | Leslie Ann Goldberg,
Steven Kelk,
Mike Paterson:
The Complexity of Choosing an H-Coloring (Nearly) Uniformly at Random.
SIAM J. Comput. 33(2): 416-432 (2004) |
| 2002 |
| 1 |  | Leslie Ann Goldberg,
Steven Kelk,
Mike Paterson:
The complexity of choosing an H-colouring (nearly) uniformly at random.
STOC 2002: 53-62 |