Leo van Iersel

From MaRDI portal
Person:295643

Available identifiers

zbMath Open van-iersel.leoMaRDI QIDQ295643

List of research outcomes

PublicationDate of PublicationType
Polynomial invariants for cactuses2023-06-05Paper
An algorithm for reconstructing level-2 phylogenetic networks from trinets2022-09-02Paper
Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances2020-09-01Paper
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees2019-07-19Paper
Deciding the existence of a cherry-picking sequence is hard on two trees2019-05-03Paper
Finding a most parsimonious or likely tree in a network with respect to an alignment2019-03-29Paper
On unrooted and root-uncertain variants of several well-known phylogenetic network problems2019-01-11Paper
A priori TSP in the scenario model2018-10-26Paper
Parallel Machine Scheduling with a Single Resource per Job2018-09-13Paper
Leaf-Reconstructibility of Phylogenetic Networks2018-08-10Paper
A third strike against perfect phylogeny2018-04-19Paper
Locating a tree in a phylogenetic network2017-11-03Paper
Graph realizations constrained by skeleton graphs2017-07-13Paper
Binets: fundamental building blocks for phylogenetic networks2017-06-27Paper
A priori TSP in the Scenario Model2017-04-04Paper
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets2017-03-06Paper
Do branch lengths help to locate a tree in a phylogenetic network?2016-11-30Paper
https://portal.mardi4nfdi.de/entity/Q28185882016-09-07Paper
Hybridization Number on Three Rooted Binary Trees is EPT2016-09-06Paper
Kernelizations for the hybridization number problem on multiple nonbinary trees2016-06-13Paper
Phylogenetic incongruence through the lens of Monadic Second Order logic2016-03-03Paper
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees2015-12-08Paper
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees2015-09-09Paper
On Computing the Maximum Parsimony Score of a Phylogenetic Network2015-05-20Paper
When two trees go to war2015-03-09Paper
The agreement problem for unrooted phylogenetic trees is FPT2014-07-30Paper
Trinets encode tree-child and level-2 phylogenetic networks2014-07-03Paper
Approximation Algorithms for Nonbinary Agreement Forests2014-06-19Paper
A quadratic kernel for computing the hybridization number of multiple trees2014-05-26Paper
A short note on exponential-time algorithms for hybridization number2013-12-04Paper
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set2013-04-09Paper
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables2012-05-11Paper
Constructing the simplest possible phylogenetic network from triplets2011-05-10Paper
Quantifying the extent of lateral gene transfer required to avert a `genome of Eden'2010-12-15Paper
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables2010-09-06Paper
Constructing the Simplest Possible Phylogenetic Network from Triplets2009-01-29Paper
Prefix Reversals on Binary and Ternary Strings2008-08-13Paper
Prefix Reversals on Binary and Ternary Strings2007-11-29Paper
The complexity of the single individual SNP haplotyping problem2007-11-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Leo van Iersel