 | 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) |
| 21 |  | Gregory Gutin,
Leo van Iersel,
Matthias Mnich,
Anders Yeo:
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.
J. Comput. Syst. Sci. 78(1): 151-163 (2012) |
| 2011 |
| 20 |  | Leo van Iersel,
Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets.
Algorithmica 60(2): 207-235 (2011) |
| 19 |  | Steven Kelk,
Celine Scornavacca,
Leo van Iersel:
On the elusiveness of clusters
CoRR abs/1103.1834: (2011) |
| 18 |  | Steven Kelk,
Leo van Iersel,
Nela Lekic,
Simone Linz,
Celine Scornavacca,
Leen Stougie:
Cycle killer... qu'est-ce que
CoRR abs/1112.5359: (2011) |
| 17 |  | 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) |
| 2010 |
| 16 |  | Gregory Gutin,
Leo van Iersel,
Matthias Mnich,
Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.
ESA (1) 2010: 326-337 |
| 15 |  | 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) |
| 14 |  | Gregory Gutin,
Leo van Iersel,
Matthias Mnich,
Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels
CoRR abs/1004.1956: (2010) |
| 13 |  | Leo van Iersel,
Charles Semple,
Mike A. Steel:
Locating a tree in a phylogenetic network
CoRR abs/1006.3122: (2010) |
| 12 |  | Leo van Iersel,
Charles Semple,
Mike A. Steel:
Locating a tree in a phylogenetic network.
Inf. Process. Lett. 110(23): 1037-1043 (2010) |
| 2009 |
| 11 |  | Leo van Iersel,
Matthias Mnich:
Computing Rooted and Unrooted Maximum Consistent Supertrees
CoRR abs/0901.3299: (2009) |
| 10 |  | 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) |
| 9 |  | 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 |
| 8 |  | Leo van Iersel,
Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets.
ISAAC 2008: 472-483 |
| 7 |  | Leo van Iersel,
Judith Keijsper,
Steven Kelk,
Leen Stougie,
Ferry Hagen,
Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets.
RECOMB 2008: 450-462 |
| 6 |  | 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 |
| 5 |  | 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 |
| 4 |  | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica 49(1): 13-36 (2007) |
| 3 |  | 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 |
| 2 |  | 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 |
| 1 |  | Rudi Cilibrasi,
Leo van Iersel,
Steven Kelk,
John Tromp:
On the Complexity of Several Haplotyping Problems.
WABI 2005: 128-139 |