On the Complexity of Several Haplotyping Problems. - Rudi Cilibrasi; Leo van Iersel; Steven Kelk; John Tromp (WABI, 2005)

Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie (WABI, 2006)

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

Prefix Reversals on Binary and Ternary Strings. - Cor A. J. Hurkens; Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie; John Tromp (SIAM J. Discret. Math., 2007)

Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. - Leo van Iersel; Steven Kelk; Matthias Mnich (J. Bioinform. Comput. Biol., 2009)

Constructing Level-2 Phylogenetic Networks from Triplets. - Leo van Iersel; Judith Keijsper; Steven Kelk; Leen Stougie; Ferry Hagen; Teun Boekhout (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. - Gregory Z. Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo (ESA (1), 2010)

Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. - Leo van Iersel; Steven Kelk; Regula Rupp; Daniel H. Huson (Bioinform., 2010)

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels - Gregory Z. Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo (CoRR, 2010)

Locating a tree in a phylogenetic network. - Leo van Iersel; Charles Semple; Mike A. Steel (Inf. Process. Lett., 2010)

Constructing the Simplest Possible Phylogenetic Network from Triplets. - Leo van Iersel; Steven Kelk (Algorithmica, 2011)

A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. - Katharina T. Huber; Leo van Iersel; Steven Kelk; Radoslaw Suchecki (IEEE ACM Trans. Comput. Biol. Bioinform., 2011)

A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. - Leo van Iersel; Steven Kelk; Nela Lekic; Céline Scornavacca (WABI, 2012)

Computing nonbinary agreement forests - Leo van Iersel; Steven Kelk; Nela Lekic; Leen Stougie (CoRR, 2012)

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. - Gregory Z. Gutin; Leo van Iersel; Matthias Mnich; Anders Yeo (J. Comput. Syst. Sci., 2012)

Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. - Steven Kelk; Leo van Iersel; Nela Lekic; Simone Linz; Céline Scornavacca; Leen Stougie (SIAM J. Discret. Math., 2012)

On the Elusiveness of Clusters. - Steven Kelk; Céline Scornavacca; Leo van Iersel (IEEE ACM Trans. Comput. Biol. Bioinform., 2012)

A quadratic kernel for computing the hybridization number of multiple trees. - Leo van Iersel; Simone Linz (Inf. Process. Lett., 2013)

WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads. - Murray Patterson; Tobias Marschall; Nadia Pisanti; Leo van Iersel; Leen Stougie; Gunnar W. Klau; Alexander Schönhuth (RECOMB, 2014)

Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees. - Leo van Iersel; Steven Kelk (WG, 2014)

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. - Leo van Iersel; Steven Kelk; Nela Lekic; Céline Scornavacca (BMC Bioinform., 2014)

Hybridization Number on Three Trees. - Leo van Iersel; Steven Kelk; Nela Lekic; Chris Whidden; Norbert Zeh (CoRR, 2014)

The agreement problem for unrooted phylogenetic trees is FPT. - Céline Scornavacca; Leo van Iersel; Steven Kelk; David Bryant (J. Graph Algorithms Appl., 2014)

Approximation Algorithms for Nonbinary Agreement Forests. - Leo van Iersel; Steven Kelk; Nela Lekic; Leen Stougie (SIAM J. Discret. Math., 2014)

Phylogenetic incongruence through the lens of Monadic Second Order logic. - Steven Kelk; Leo van Iersel; Céline Scornavacca (CoRR, 2015)

WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads. - Murray Patterson; Tobias Marschall; Nadia Pisanti; Leo van Iersel; Leen Stougie; Gunnar W. Klau; Alexander Schönhuth (J. Comput. Biol., 2015)

On Computing the Maximum Parsimony Score of a Phylogenetic Network. - Mareike Fischer 001; Leo van Iersel; Steven Kelk; Céline Scornavacca (SIAM J. Discret. Math., 2015)

A priori TSP in the Scenario Model. - Martijn van Ee; Leo van Iersel; Teun Janssen; René Sitters (WAOA, 2016)

Do branch lengths help to locate a tree in a phylogenetic network? - Philippe Gambette; Leo van Iersel; Steven Kelk; Fabio Pardi; Céline Scornavacca (CoRR, 2016)

Kernelizations for the hybridization number problem on multiple nonbinary trees. - Leo van Iersel; Steven Kelk; Céline Scornavacca (J. Comput. Syst. Sci., 2016)

Phylogenetic incongruence through the lens of Monadic Second Order logic. - Steven Kelk; Leo van Iersel; Céline Scornavacca; Mathias Weller (J. Graph Algorithms Appl., 2016)

Hybridization Number on Three Rooted Binary Trees is EPT. - Leo van Iersel; Steven Kelk; Nela Lekic; Chris Whidden; Norbert Zeh (SIAM J. Discret. Math., 2016)

Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. - Leo van Iersel; Steven Kelk; Nela Lekic; Simone Linz (Theor. Comput. Sci., 2016)

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. - Katharina T. Huber; Leo van Iersel; Vincent Moulton; Céline Scornavacca; Taoyang Wu (Algorithmica, 2017)

Graph Realizations Constrained by Skeleton Graphs. - Péter L. Erdös; Stephen G. Hartke; Leo van Iersel; István Miklós (Electron. J. Comb., 2017)

Binets: fundamental building blocks for phylogenetic networks. - Leo van Iersel; Vincent Moulton; Eveline de Swart; Taoyang Wu (CoRR, 2017)

Finding the most parsimonious or likely tree in a network with respect to an alignment. - Steven Kelk; Fabio Pardi; Céline Scornavacca; Leo van Iersel (CoRR, 2017)

Exploring the tiers of rooted phylogenetic network space using tail moves. - Remie Janssen; Mark Jones 001; Péter L. Erdös; Leo van Iersel; Céline Scornavacca (CoRR, 2017)

Rearrangement moves on rooted phylogenetic networks. - Philippe Gambette; Leo van Iersel; Mark Jones 001; Manuel Lafond; Fabio Pardi; Céline Scornavacca (PLoS Comput. Biol., 2017)

Polynomial-Time Algorithms for Phylogenetic Inference Problems. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (AlCoB, 2018)

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. - Leo van Iersel; Steven Kelk; Georgios Stamoulis; Leen Stougie; Olivier Boes (Algorithmica, 2018)

A third strike against perfect phylogeny. - Leo van Iersel; Mark Jones 001; Steven Kelk (CoRR, 2018)

Parallel Machine Scheduling with a Single Resource per Job. - Teun Janssen; Céline M. F. Swennenhuis; Abdoul Bitar; Thomas Bosman; Dion Gijswijt; Leo van Iersel; Stéphane Dauzère-Pérès; Claude Yugma (CoRR, 2018)

A priori TSP in the scenario model. - Martijn van Ee; Leo van Iersel; Teun Janssen; René Sitters (Discret. Appl. Math., 2018)

Leaf-Reconstructibility of Phylogenetic Networks. - Leo van Iersel; Vincent Moulton (SIAM J. Discret. Math., 2018)

Nonbinary Tree-Based Phylogenetic Networks. - Laura Jetten; Leo van Iersel (IEEE ACM Trans. Comput. Biol. Bioinform., 2018)

Rooting for phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (CoRR, 2019)

Cutting an alignment with Ockham's razor. - Mark Jones 001; Philippe Gambette; Leo van Iersel; Remie Janssen; Steven Kelk; Fabio Pardi; Céline Scornavacca (CoRR, 2019)

Deciding the existence of a cherry-picking sequence is hard on two trees. - Janosch Döcker; Leo van Iersel; Steven Kelk; Simone Linz (Discret. Appl. Math., 2019)

Reconstructibility of unrooted level-k phylogenetic networks from distances. - Leo van Iersel; Vincent Moulton; Yukihiro Murakami (Adv. Appl. Math., 2020)

Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

A unifying characterization of tree-based networks and orchard networks using cherry covers. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Adv. Appl. Math., 2021)

Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning. - Giulia Bernardini 001; Leo van Iersel; Esther Julien; Leen Stougie (WABI, 2022)

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees. - Sander Borst; Leo van Iersel; Mark Jones 001; Steven Kelk (Algorithmica, 2022)

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Algorithmica, 2022)

A Near-Linear Kernel for Two-Parsimony Distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yuki Murakami; Norbert Zeh (CoRR, 2022)

Level-2 networks from shortest and longest distances. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami (Discret. Appl. Math., 2022)

An algorithm for reconstructing level-2 phylogenetic networks from trinets. - Leo van Iersel; Sjors Kole; Vincent Moulton; Leonie Nipius (Inf. Process. Lett., 2022)

Making a Network Orchard by Adding Leaves. - Leo van Iersel; Mark Jones 001; Esther Julien; Yukihiro Murakami (WABI, 2023)

Embedding phylogenetic trees in networks of low treewidth. - Leo van Iersel; Mark Jones 001; Mathias Weller (Discret. Math. Theor. Comput. Sci., 2023)

Polynomial invariants for cactuses. - Leo van Iersel; Vincent Moulton; Yukihiro Murakami (Inf. Process. Lett., 2023)

Constructing phylogenetic networks via cherry picking and machine learning. - Giulia Bernardini 001; Leo van Iersel; Esther Julien; Leen Stougie (Algorithms Mol. Biol., 2023)

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs. - Niels Holtgrefe; Leo van Iersel; Mark Jones 001 (CoRR, 2024)

Maximizing Network Phylogenetic Diversity. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (CoRR, 2024)

A Wild Sheep Chase Through an Orchard. - Jordan Dempsey; Leo van Iersel; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (CoRR, 2024)

Encoding Semi-Directed Phylogenetic Networks with Quarnets. - Katharina T. Huber; Leo van Iersel; Mark Jones 001; Vincent Moulton; Leonie Veenema-Nipius (CoRR, 2024)

Solving the Tree Containment Problem Using Graph Neural Networks. - Arkadiy Dushatskiy; Esther Julien; Leen Stougie; Leo van Iersel (Trans. Mach. Learn. Res., 2024)

A near-linear kernel for bounded-state parsimony distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (J. Comput. Syst. Sci., 2024)

Orienting undirected phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (J. Comput. Syst. Sci., 2024)

Phylogenetic Network Diversity Parameterized by Reticulation Number and Beyond. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (RECOMB-CG, 2025)

Average-Tree Phylogenetic Diversity of Networks. - Leo van Iersel; Mark Jones 001; Jannik Schestag; Céline Scornavacca; Mathias Weller (WABI, 2025)

A simple 4-approximation algorithm for maximum agreement forests on multiple unrooted binary trees. - Jordan Dempsey; Leo van Iersel; Mark Jones 001; Norbert Zeh (Inf. Process. Lett., 2025)

Is this network proper forest-based? - Katharina T. Huber; Leo van Iersel; Vincent Moulton; Guillaume E. Scholz (Inf. Process. Lett., 2025)

Reconstructing semi-directed level-1 networks using few quarnets. - Martin Frohn; Niels Holtgrefe; Leo van Iersel; Mark Jones 001; Steven Kelk (J. Comput. Syst. Sci., 2025)

Metrics for classes of semi-binary phylogenetic networks using μ-representations. - Christopher Reichling; Leo van Iersel; Yukihiro Murakami (Adv. Appl. Math., 2026)