Steven Kelk

Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Celine Scornavacca, Leen Stougie: Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. SIAM J. Discrete Math. 26(4): 1635-1656 (2012)

Steven Kelk, Celine Scornavacca, Leo van Iersel: On the Elusiveness of Clusters. IEEE/ACM Trans. Comput. Biology Bioinform. 9(2): 517-534 (2012)

Leo van Iersel, Steven Kelk, Nela Lekic, Celine Scornavacca: A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. WABI 2012: 430-440

Steven Kelk, Celine Scornavacca: Towards the fixed parameter tractability of constructing minimal phylogenetic networks from arbitrary sets of nonbinary trees. CoRR abs/1207.7034 (2012)

Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie: Computing nonbinary agreement forests. CoRR abs/1210.3211 (2012)

Leo van Iersel, Steven Kelk: Constructing the Simplest Possible Phylogenetic Network from Triplets. Algorithmica 60(2): 207-235 (2011)

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)

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)

Steven Kelk, Celine Scornavacca, Leo van Iersel: On the elusiveness of clusters. CoRR abs/1103.1834 (2011)

Steven Kelk, Celine Scornavacca: Constructing minimal phylogenetic networks from softwired clusters is fixed parameter tractable. CoRR abs/1108.3653 (2011)

Steven Kelk: A note on efficient computation of hybridization number via softwired clusters. CoRR abs/1108.4642 (2011)

Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Celine Scornavacca, Leen Stougie: Cycle killer... qu'est-ce que . CoRR abs/1112.5359 (2011)

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)

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)

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)

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)

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)

Leo van Iersel, Steven Kelk: Constructing the Simplest Possible Phylogenetic Network from Triplets. ISAAC 2008: 472-483

Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout: Constructing Level-2 Phylogenetic Networks from Triplets. RECOMB 2008: 450-462

Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp: The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica 49(1): 13-36 (2007)

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)

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

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

Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp: On the Complexity of Several Haplotyping Problems. WABI 2005: 128-139

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)

Leslie Ann Goldberg, Steven Kelk, Mike Paterson: The complexity of choosing an H-colouring (nearly) uniformly at random. STOC 2002: 53-62