The following pages link to Leo van Iersel (Q295643):
Displayed 41 items.
- Kernelizations for the hybridization number problem on multiple nonbinary trees (Q295644) (← links)
- Do branch lengths help to locate a tree in a phylogenetic network? (Q347040) (← links)
- (Q414862) (redirect page) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets (Q513300) (← links)
- Constructing the simplest possible phylogenetic network from triplets (Q534764) (← links)
- Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' (Q611943) (← links)
- Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees (Q897856) (← links)
- Locating a tree in a phylogenetic network (Q1675818) (← links)
- Finding a most parsimonious or likely tree in a network with respect to an alignment (Q1738036) (← links)
- Deciding the existence of a cherry-picking sequence is hard on two trees (Q1741507) (← links)
- On unrooted and root-uncertain variants of several well-known phylogenetic network problems (Q1755726) (← links)
- A priori TSP in the scenario model (Q1801079) (← links)
- An algorithm for reconstructing level-2 phylogenetic networks from trinets (Q2169439) (← links)
- Reconstructibility of unrooted level-\(k\) phylogenetic networks from distances (Q2197914) (← links)
- Trinets encode tree-child and level-2 phylogenetic networks (Q2249670) (← links)
- When two trees go to war (Q2261656) (← links)
- Binets: fundamental building blocks for phylogenetic networks (Q2359132) (← links)
- Graph realizations constrained by skeleton graphs (Q2363110) (← links)
- A quadratic kernel for computing the hybridization number of multiple trees (Q2450929) (← links)
- The complexity of the single individual SNP haplotyping problem (Q2461636) (← links)
- Phylogenetic incongruence through the lens of Monadic Second Order logic (Q2790162) (← links)
- Hybridization Number on Three Rooted Binary Trees is EPT (Q2818206) (← links)
- (Q2818588) (← links)
- Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees (Q2945199) (← links)
- A priori TSP in the Scenario Model (Q2971168) (← links)
- Prefix Reversals on Binary and Ternary Strings (Q3519196) (← links)
- All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables (Q3586474) (← links)
- Constructing the Simplest Possible Phylogenetic Network from Triplets (Q3596742) (← links)
- Leaf-Reconstructibility of Phylogenetic Networks (Q4579954) (← links)
- Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set (Q4915192) (← links)
- Approximation Algorithms for Nonbinary Agreement Forests (Q4979822) (← links)
- On Computing the Maximum Parsimony Score of a Phylogenetic Network (Q5251626) (← links)
- Prefix Reversals on Binary and Ternary Strings (Q5429373) (← links)
- The agreement problem for unrooted phylogenetic trees is FPT (Q5494863) (← links)
- Polynomial invariants for cactuses (Q6161455) (← links)
- A short note on exponential-time algorithms for hybridization number (Q6247011) (← links)
- A third strike against perfect phylogeny (Q6300558) (← links)
- Parallel Machine Scheduling with a Single Resource per Job (Q6306685) (← links)
- A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees (Q6322366) (← links)
- Making a Network Orchard by Adding Leaves (Q6435401) (← links)