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:
Collaborative distances:
Timeline
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
On csauthors.net:
Bibliography
2025
2024
J. Comput. Syst. Sci., March, 2024
Trans. Mach. Learn. Res., 2024
A Simple 4-Approximation Algorithm for Maximum Agreement Forests on Multiple Unrooted Binary Trees.
CoRR, 2024
CoRR, 2024
2023
Algorithms Mol. Biol., December, 2023
Proceedings of the 23rd International Workshop on Algorithms in Bioinformatics, 2023
2022
Inf. Process. Lett., 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
Proceedings of the 22nd International Workshop on Algorithms in Bioinformatics, 2022
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
Adv. Appl. Math., 2020
2019
Discret. Appl. Math., 2019
2018
IEEE ACM Trans. Comput. Biol. Bioinform., 2018
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems.
Algorithmica, 2018
Proceedings of the Algorithms for Computational Biology - 5th International Conference, 2018
2017
CoRR, 2017
Finding the most parsimonious or likely tree in a network with respect to an alignment.
CoRR, 2017
Algorithmica, 2017
2016
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees.
Theor. Comput. Sci., 2016
SIAM J. Discret. Math., 2016
J. Graph Algorithms Appl., 2016
J. Comput. Syst. Sci., 2016
Proceedings of the Approximation and Online Algorithms - 14th International Workshop, 2016
2015
SIAM J. Discret. Math., 2015
J. Comput. Biol., 2015
2014
SIAM J. Discret. Math., 2014
J. Graph Algorithms Appl., 2014
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.
BMC Bioinform., 2014
Proceedings of the Graph-Theoretic Concepts in Computer Science, 2014
Proceedings of the Research in Computational Molecular Biology, 2014
2013
Inf. Process. Lett., 2013
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
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number.
Proceedings of the Algorithms in Bioinformatics - 12th International Workshop, 2012
2011
IEEE ACM Trans. Comput. Biol. Bioinform., 2011
Algorithmica, 2011
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
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
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
Proceedings of the Algorithms in Bioinformatics, 5th International Workshop, 2005