Leo van Iersel - Citegraph

Author Info

Name	Affiliation	Papers
LEO VAN IERSEL	University of Canterbury, Department of Mathematics and Statistics, Private Bag 4800, Christchurch, New Zealand	46
Collaborators	Citations	PageRank
56	215	24.58
Referers	Referees	References
343	417	444

Search Limit

100417

Publications (46 rows)

Collaborators (56 rows)

Referers (100 rows)

Referees (100 rows)

Title	Citations	PageRank	Year
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees	0	0.34	2022
New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees	0	0.34	2022
A unifying characterization of tree-based networks and orchard networks using cherry covers	0	0.34	2021
Reconstructibility of unrooted level-$k$ phylogenetic networks from distances	0	0.34	2020
Rooting for phylogenetic networks.	0	0.34	2019
Polynomial-Time Algorithms for Phylogenetic Inference Problems.	0	0.34	2018
Leaf-Reconstructibility of Phylogenetic Networks	0	0.34	2018
A third strike against perfect phylogeny.	0	0.34	2018
A priori TSP in the Scenario Model.	0	0.34	2018
On unrooted and root-uncertain variants of several well-known phylogenetic network problems.	1	0.37	2018
Nonbinary tree-based phylogenetic networks.	5	0.65	2018
Binets: fundamental building blocks for phylogenetic networks.	1	0.38	2017
Exploring the tiers of rooted phylogenetic network space using tail moves.	1	0.39	2017
Finding a most parsimonious or likely tree in a network with respect to an alignment	1	0.36	2017
Rearrangement moves on rooted phylogenetic networks.	1	0.45	2017
Graph realizations constrained by skeleton graphs	2	0.43	2017
Hybridization Number on Three Rooted Binary Trees is EPT.	4	0.46	2016
Phylogenetic incongruence through the lens of Monadic Second Order logic.	3	0.40	2016
Do branch lengths help to locate a tree in a phylogenetic network?	1	0.38	2016
On Computing the Maximum Parsimony Score of a Phylogenetic Network.	2	0.37	2015
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees.	5	0.54	2014
Hybridization Number on Three Trees.	2	0.40	2014
The agreement problem for unrooted phylogenetic trees is FPT.	0	0.34	2014
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets.	5	0.52	2014
Approximation Algorithms for Nonbinary Agreement Forests.	3	0.45	2014
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees.	0	0.34	2014
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees.	8	0.57	2013
A quadratic kernel for computing the hybridization number of multiple trees	5	0.48	2013
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables	7	0.51	2012
Computing nonbinary agreement forests	1	0.36	2012
A practical approximation algorithm for solving massive instances of hybridization number	0	0.34	2012
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set.	8	0.60	2012
Cycle killer... qu'est-ce que	0	0.34	2011
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks	4	0.48	2011
On the Elusiveness of Clusters	9	0.68	2011
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters.	9	0.58	2010
Locating a tree in a phylogenetic network	28	2.10	2010
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels	3	0.40	2010
All ternary permutation constraint satisfaction problems parameterized above average have kernels with quadratic numbers of variables	16	0.94	2010
Computing Rooted and Unrooted Maximum Consistent Supertrees	0	0.34	2009
Constructing the Simplest Possible Phylogenetic Network from Triplets	10	0.64	2008
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems	5	0.43	2008
Prefix Reversals on Binary and Ternary Strings	5	0.57	2007
The Complexity of the Single Individual SNP Haplotyping Problem	21	0.90	2007
Beaches of islands of tractability: algorithms for parsimony and minimum perfect phylogeny haplotyping problems	2	0.37	2006
On the complexity of several haplotyping problems	37	2.69	2005