Leo van Iersel

Available identifiers

zbMath Open van-iersel.leoMaRDI QIDQ295643

List of research outcomes

Publication	Date of Publication	Type
Polynomial invariants for cactuses	2023-06-05	Paper
Making a Network Orchard by Adding Leaves	2023-05-04	Paper
An algorithm for reconstructing level-2 phylogenetic networks from trinets	2022-09-02	Paper
Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances	2020-09-01	Paper
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	2019-07-19	Paper
Deciding the existence of a cherry-picking sequence is hard on two trees	2019-05-03	Paper
Finding a most parsimonious or likely tree in a network with respect to an alignment	2019-03-29	Paper
On unrooted and root-uncertain variants of several well-known phylogenetic network problems	2019-01-11	Paper
A priori TSP in the scenario model	2018-10-26	Paper
Parallel Machine Scheduling with a Single Resource per Job	2018-09-13	Paper
Leaf-Reconstructibility of Phylogenetic Networks	2018-08-10	Paper
A third strike against perfect phylogeny	2018-04-19	Paper
Locating a tree in a phylogenetic network	2017-11-03	Paper
Graph realizations constrained by skeleton graphs	2017-07-13	Paper
Binets: fundamental building blocks for phylogenetic networks	2017-06-27	Paper
A priori TSP in the Scenario Model	2017-04-04	Paper
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets	2017-03-06	Paper
Do branch lengths help to locate a tree in a phylogenetic network?	2016-11-30	Paper
https://portal.mardi4nfdi.de/entity/Q2818588	2016-09-07	Paper
Hybridization Number on Three Rooted Binary Trees is EPT	2016-09-06	Paper
Kernelizations for the hybridization number problem on multiple nonbinary trees	2016-06-13	Paper
Phylogenetic incongruence through the lens of Monadic Second Order logic	2016-03-03	Paper
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees	2015-12-08	Paper
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees	2015-09-09	Paper
On Computing the Maximum Parsimony Score of a Phylogenetic Network	2015-05-20	Paper
When two trees go to war	2015-03-09	Paper
The agreement problem for unrooted phylogenetic trees is FPT	2014-07-30	Paper
Trinets encode tree-child and level-2 phylogenetic networks	2014-07-03	Paper
Approximation Algorithms for Nonbinary Agreement Forests	2014-06-19	Paper
A quadratic kernel for computing the hybridization number of multiple trees	2014-05-26	Paper
A short note on exponential-time algorithms for hybridization number	2013-12-04	Paper
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set	2013-04-09	Paper
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables	2012-05-11	Paper
Constructing the simplest possible phylogenetic network from triplets	2011-05-10	Paper
Quantifying the extent of lateral gene transfer required to avert a `genome of Eden'	2010-12-15	Paper
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables	2010-09-06	Paper
Constructing the Simplest Possible Phylogenetic Network from Triplets	2009-01-29	Paper
Prefix Reversals on Binary and Ternary Strings	2008-08-13	Paper
Prefix Reversals on Binary and Ternary Strings	2007-11-29	Paper
The complexity of the single individual SNP haplotyping problem	2007-11-28	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Leo van Iersel