Leo van Iersel

Orcid: 0000-0001-7142-4706

According to our database1, Leo van Iersel authored at least 73 papers between 2005 and 2025.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2025
Is this network proper forest-based?
Inf. Process. Lett., 2025

2024
Orienting undirected phylogenetic networks.
J. Comput. Syst. Sci., March, 2024

A near-linear kernel for bounded-state parsimony distance.
J. Comput. Syst. Sci., March, 2024

Solving the Tree Containment Problem Using Graph Neural Networks.
Trans. Mach. Learn. Res., 2024

A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees.
CoRR, 2024

Reconstructing semi-directed level-1 networks using few quarnets.
CoRR, 2024

Encoding Semi-Directed Phylogenetic Networks with Quarnets.
CoRR, 2024

A Wild Sheep Chase Through an Orchard.
CoRR, 2024

Maximizing Network Phylogenetic Diversity.
CoRR, 2024

Exact and Heuristic Computation of the Scanwidth of Directed Acyclic Graphs.
CoRR, 2024

2023
Constructing phylogenetic networks via cherry picking and machine learning.
Algorithms Mol. Biol., December, 2023

Polynomial invariants for cactuses.
Inf. Process. Lett., August, 2023

Making a Network Orchard by Adding Leaves.
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023

2022
An algorithm for reconstructing level-2 phylogenetic networks from trinets.
Inf. Process. Lett., 2022

Level-2 networks from shortest and longest distances.
Discret. Appl. Math., 2022

A Near-Linear Kernel for Two-Parsimony Distance.
CoRR, 2022

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees.
Algorithmica, 2022

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees.
Algorithmica, 2022

Reconstructing Phylogenetic Networks via Cherry Picking and Machine Learning.
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022

Embedding Phylogenetic Trees in Networks of Low Treewidth.
Proceedings of the 30th Annual European Symposium on Algorithms, 2022

2021
A unifying characterization of tree-based networks and orchard networks using cherry covers.
Adv. Appl. Math., 2021

2020
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation.
IEEE ACM Trans. Comput. Biol. Bioinform., 2020

Reconstructibility of unrooted level-<i>k</i> phylogenetic networks from distances.
Adv. Appl. Math., 2020

2019
Deciding the existence of a cherry-picking sequence is hard on two trees.
Discret. Appl. Math., 2019

Cutting an alignment with Ockham's razor.
CoRR, 2019

Rooting for phylogenetic networks.
CoRR, 2019

2018
Nonbinary Tree-Based Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2018

Leaf-Reconstructibility of Phylogenetic Networks.
SIAM J. Discret. Math., 2018

<i>A priori</i> TSP in the scenario model.
Discret. Appl. Math., 2018

Parallel Machine Scheduling with a Single Resource per Job.
CoRR, 2018

A third strike against perfect phylogeny.
CoRR, 2018

On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
Algorithmica, 2018

Polynomial-Time Algorithms for Phylogenetic Inference Problems.
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018

2017
Rearrangement moves on rooted phylogenetic networks.
PLoS Comput. Biol., 2017

Exploring the tiers of rooted phylogenetic network space using tail moves.
CoRR, 2017

Finding the most parsimonious or likely tree in a network with respect to an alignment.
CoRR, 2017

Binets: fundamental building blocks for phylogenetic networks.
CoRR, 2017

Graph Realizations Constrained by Skeleton Graphs.
Electron. J. Comb., 2017

Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets.
Algorithmica, 2017

2016
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees.
Theor. Comput. Sci., 2016

Hybridization Number on Three Rooted Binary Trees is EPT.
SIAM J. Discret. Math., 2016

Phylogenetic incongruence through the lens of Monadic Second Order logic.
J. Graph Algorithms Appl., 2016

Kernelizations for the hybridization number problem on multiple nonbinary trees.
J. Comput. Syst. Sci., 2016

Do branch lengths help to locate a tree in a phylogenetic network?
CoRR, 2016

A priori TSP in the Scenario Model.
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016

2015
On Computing the Maximum Parsimony Score of a Phylogenetic Network.
SIAM J. Discret. Math., 2015

WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads.
J. Comput. Biol., 2015

Phylogenetic incongruence through the lens of Monadic Second Order logic.
CoRR, 2015

2014
Approximation Algorithms for Nonbinary Agreement Forests.
SIAM J. Discret. Math., 2014

The agreement problem for unrooted phylogenetic trees is FPT.
J. Graph Algorithms Appl., 2014

Hybridization Number on Three Trees.
CoRR, 2014

A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.
BMC Bioinform., 2014

Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees.
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014

WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads.
Proceedings of the Research in Computational Molecular Biology, 2014

2013
A quadratic kernel for computing the hybridization number of multiple trees.
Inf. Process. Lett., 2013

2012
On the Elusiveness of Clusters.
IEEE ACM Trans. Comput. Biol. Bioinform., 2012

Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set.
SIAM J. Discret. Math., 2012

Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables.
J. Comput. Syst. Sci., 2012

Computing nonbinary agreement forests
CoRR, 2012

A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012

2011
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Constructing the Simplest Possible Phylogenetic Network from Triplets.
Algorithmica, 2011

2010
Locating a tree in a phylogenetic network.
Inf. Process. Lett., 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels
CoRR, 2010

Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.
Bioinform., 2010

All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables.
Proceedings of the Algorithms, 2010

2009
Constructing Level-2 Phylogenetic Networks from Triplets.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks.
J. Bioinform. Comput. Biol., 2009

2008
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

2007
Prefix Reversals on Binary and Ternary Strings.
SIAM J. Discret. Math., 2007

The Complexity of the Single Individual SNP Haplotyping Problem.
Algorithmica, 2007

2006
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 6th International Workshop, 2006

2005
On the Complexity of Several Haplotyping Problems.
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005


  Loading...