Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDLeo van Iersel
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j32]Leo van Iersel, Vincent Moulton
, Yukihiro Murakami:
Reconstructibility of unrooted level-k phylogenetic networks from distances. Adv. Appl. Math. 120: 102075 (2020)- [j31]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. IEEE ACM Trans. Comput. Biol. Bioinform. 17(1): 14-26 (2020) - [i23]Sander Borst, Leo van Iersel, Mark Jones, Steven Kelk:
New FPT algorithms for finding the temporal hybridization number for sets of phylogenetic trees. CoRR abs/2007.13615 (2020)
2010 – 2019
- 2019
- [j30]Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. Discret. Appl. Math. 260: 131-143 (2019) - [i22]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Rooting for phylogenetic networks. CoRR abs/1906.07430 (2019) - [i21]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. CoRR abs/1907.08474 (2019) - [i20]Mark Jones, Philippe Gambette, Leo van Iersel, Remie Janssen, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Cutting an alignment with Ockham's razor. CoRR abs/1910.11041 (2019) - 2018
- [j29]Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes:
On Unrooted and Root-Uncertain Variants of Several Well-Known Phylogenetic Network Problems. Algorithmica 80(11): 2993-3022 (2018) - [j28]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the scenario model. Discret. Appl. Math. 250: 331-341 (2018) - [j27]Leo van Iersel, Vincent Moulton:
Leaf-Reconstructibility of Phylogenetic Networks. SIAM J. Discret. Math. 32(3): 2047-2066 (2018) - [j26]Laura Jetten, Leo van Iersel:
Nonbinary Tree-Based Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 15(1): 205-217 (2018) - [c11]Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami, Norbert Zeh:
Polynomial-Time Algorithms for Phylogenetic Inference Problems. AlCoB 2018: 37-49 - [i19]Leo van Iersel, Mark Jones, Steven Kelk:
A third strike against perfect phylogeny. CoRR abs/1804.07232 (2018) - [i18]Teun Janssen, Céline M. F. Swennenhuis, Abdoul Bitar, Thomas Bosman, Dion Gijswijt, Leo van Iersel, Stéphane Dauzère-Pérès, Claude Yugma:
Parallel Machine Scheduling with a Single Resource per Job. CoRR abs/1809.05009 (2018) - 2017
- [j25]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing Phylogenetic Level-1 Networks from Nondense Binet and Trinet Sets. Algorithmica 77(1): 173-200 (2017) - [j24]Péter L. Erdös, Stephen G. Hartke, Leo van Iersel, István Miklós:
Graph Realizations Constrained by Skeleton Graphs. Electron. J. Comb. 24(2): P2.47 (2017) - [j23]Philippe Gambette, Leo van Iersel, Mark Jones, Manuel Lafond, Fabio Pardi, Céline Scornavacca:
Rearrangement moves on rooted phylogenetic networks. PLoS Comput. Biol. 13(8) (2017) - [i17]Leo van Iersel, Vincent Moulton, Eveline de Swart, Taoyang Wu:
Binets: fundamental building blocks for phylogenetic networks. CoRR abs/1701.08995 (2017) - [i16]Steven Kelk, Fabio Pardi, Céline Scornavacca, Leo van Iersel:
Finding the most parsimonious or likely tree in a network with respect to an alignment. CoRR abs/1707.03648 (2017) - [i15]Remie Janssen, Mark Jones, Péter L. Erdös, Leo van Iersel, Céline Scornavacca:
Exploring the tiers of rooted phylogenetic network space using tail moves. CoRR abs/1708.07656 (2017) - [i14]Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz:
Deciding the existence of a cherry-picking sequence is hard on two trees. CoRR abs/1712.02965 (2017) - 2016
- [j22]Leo van Iersel, Steven Kelk, Céline Scornavacca:
Kernelizations for the hybridization number problem on multiple nonbinary trees. J. Comput. Syst. Sci. 82(6): 1075-1089 (2016) - [j21]Steven Kelk, Leo van Iersel, Céline Scornavacca, Mathias Weller:
Phylogenetic incongruence through the lens of Monadic Second Order logic. J. Graph Algorithms Appl. 20(2): 189-215 (2016) - [j20]Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh:
Hybridization Number on Three Rooted Binary Trees is EPT. SIAM J. Discret. Math. 30(3): 1607-1631 (2016) - [j19]Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz:
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. Theor. Comput. Sci. 609: 1-21 (2016) - [c10]Martijn van Ee, Leo van Iersel, Teun Janssen, René Sitters:
A priori TSP in the Scenario Model. WAOA 2016: 183-196 - [i13]Laura Jetten, Leo van Iersel:
Nonbinary tree-based phylogenetic networks. CoRR abs/1601.04974 (2016) - [i12]Philippe Gambette, Leo van Iersel, Steven Kelk, Fabio Pardi, Céline Scornavacca:
Do branch lengths help to locate a tree in a phylogenetic network? CoRR abs/1607.06285 (2016) - [i11]Leo van Iersel, Steven Kelk, Georgios Stamoulis, Leen Stougie, Olivier Boes:
On unrooted and root-uncertain variants of several well-known phylogenetic network problems. CoRR abs/1609.00544 (2016) - 2015
- [j18]Murray Patterson, Tobias Marschall, Nadia Pisanti, Leo van Iersel, Leen Stougie, Gunnar W. Klau, Alexander Schönhuth:
WhatsHap: Weighted Haplotype Assembly for Future-Generation Sequencing Reads. J. Comput. Biol. 22(6): 498-509 (2015) - [j17]Mareike Fischer, Leo van Iersel, Steven Kelk, Céline Scornavacca:
On Computing the Maximum Parsimony Score of a Phylogenetic Network. SIAM J. Discret. Math. 29(1): 559-585 (2015) - [i10]Steven Kelk, Leo van Iersel, Céline Scornavacca:
Phylogenetic incongruence through the lens of Monadic Second Order logic. CoRR abs/1503.00368 (2015) - 2014
- [j16]Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca:
A practical approximation algorithm for solving massive instances of hybridization number for binary and nonbinary trees. BMC Bioinform. 15: 127 (2014) - [j15]Céline Scornavacca, Leo van Iersel, Steven Kelk, David Bryant:
The agreement problem for unrooted phylogenetic trees is FPT. J. Graph Algorithms Appl. 18(3): 385-392 (2014) - [j14]Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie:
Approximation Algorithms for Nonbinary Agreement Forests. SIAM J. Discret. Math. 28(1): 49-66 (2014) - [c9]Murray Patterson, Tobias Marschall, Nadia Pisanti, Leo van Iersel, Leen Stougie, Gunnar W. Klau, Alexander Schönhuth:
WhatsHap: Haplotype Assembly for Future-Generation Sequencing Reads. RECOMB 2014: 237-249 - [c8]Leo van Iersel, Steven Kelk:
Kernelizations for the Hybridization Number Problem on Multiple Nonbinary Trees. WG 2014: 299-311 - [i9]Leo van Iersel, Steven Kelk, Nela Lekic, Chris Whidden, Norbert Zeh:
Hybridization Number on Three Trees. CoRR abs/1402.2136 (2014) - [i8]Leo van Iersel, Steven Kelk, Nela Lekic, Simone Linz:
Satisfying ternary permutation constraints by multiple linear orders or phylogenetic trees. CoRR abs/1410.2371 (2014) - [i7]Katharina T. Huber, Leo van Iersel, Vincent Moulton, Céline Scornavacca, Taoyang Wu:
Reconstructing phylogenetic level-1 networks from nondense binet and trinet sets. CoRR abs/1411.6804 (2014) - 2013
- [j13]Leo van Iersel, Simone Linz:
A quadratic kernel for computing the hybridization number of multiple trees. Inf. Process. Lett. 113(9): 318-323 (2013) - [i6]Leo van Iersel, Steven Kelk:
Kernelizations for the hybridization number problem on multiple nonbinary trees. CoRR abs/1311.4045 (2013) - 2012
- [j12]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables. J. Comput. Syst. Sci. 78(1): 151-163 (2012) - [j11]Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie:
Cycle Killer...Qu'est-ce que c'est? On the Comparative Approximability of Hybridization Number and Directed Feedback Vertex Set. SIAM J. Discret. Math. 26(4): 1635-1656 (2012) - [j10]Steven Kelk, Céline Scornavacca, Leo van Iersel:
On the Elusiveness of Clusters. IEEE ACM Trans. Comput. Biol. Bioinform. 9(2): 517-534 (2012) - [c7]Leo van Iersel, Steven Kelk, Nela Lekic, Céline Scornavacca:
A Practical Approximation Algorithm for Solving Massive Instances of Hybridization Number. WABI 2012: 430-440 - [i5]Leo van Iersel, Steven Kelk, Nela Lekic, Leen Stougie:
Computing nonbinary agreement forests. CoRR abs/1210.3211 (2012) - 2011
- [j9]Leo van Iersel, Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets. Algorithmica 60(2): 207-235 (2011) - [j8]Katharina T. Huber, Leo van Iersel, Steven Kelk, Radoslaw Suchecki:
A Practical Algorithm for Reconstructing Level-1 Phylogenetic Networks. IEEE ACM Trans. Comput. Biol. Bioinform. 8(3): 635-649 (2011) - [i4]Steven Kelk, Céline Scornavacca, Leo van Iersel:
On the elusiveness of clusters. CoRR abs/1103.1834 (2011) - [i3]Steven Kelk, Leo van Iersel, Nela Lekic, Simone Linz, Céline Scornavacca, Leen Stougie:
Cycle killer... qu'est-ce que c'est? On the comparative approximability of hybridization number and directed feedback vertex set. CoRR abs/1112.5359 (2011) - 2010
- [j7]Leo van Iersel, Steven Kelk, Regula Rupp, Daniel H. Huson:
Phylogenetic networks do not need to be complex: using fewer reticulations to represent conflicting clusters. Bioinform. 26(12): 124-131 (2010) - [j6]Leo van Iersel, Charles Semple, Mike A. Steel:
Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23): 1037-1043 (2010) - [c6]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables. ESA (1) 2010: 326-337 - [i2]Gregory Z. Gutin, Leo van Iersel, Matthias Mnich, Anders Yeo:
All Ternary Permutation Constraint Satisfaction Problems Parameterized Above Average Have Polynomial Kernels. CoRR abs/1004.1956 (2010) - [i1]Leo van Iersel, Charles Semple, Mike A. Steel:
Locating a tree in a phylogenetic network. CoRR abs/1006.3122 (2010)
2000 – 2009
- 2009
- [j5]Leo van Iersel, Steven Kelk, Matthias Mnich:
Uniqueness, Intractability and Exact Algorithms: Reflections on Level-k Phylogenetic Networks. J. Bioinform. Comput. Biol. 7(4): 597-623 (2009) - [j4]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets. IEEE ACM Trans. Comput. Biol. Bioinform. 6(4): 667-681 (2009) - 2008
- [j3]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie:
Shorelines of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 301-312 (2008) - [c5]Leo van Iersel, Steven Kelk:
Constructing the Simplest Possible Phylogenetic Network from Triplets. ISAAC 2008: 472-483 - [c4]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, Ferry Hagen, Teun Boekhout:
Constructing Level-2 Phylogenetic Networks from Triplets. RECOMB 2008: 450-462 - 2007
- [j2]Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp:
The Complexity of the Single Individual SNP Haplotyping Problem. Algorithmica 49(1): 13-36 (2007) - [j1]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. SIAM J. Discret. Math. 21(3): 592-611 (2007) - [c3]Cor A. J. Hurkens, Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie, John Tromp:
Prefix Reversals on Binary and Ternary Strings. AB 2007: 292-306 - 2006
- [c2]Leo van Iersel, Judith Keijsper, Steven Kelk, Leen Stougie:
Beaches of Islands of Tractability: Algorithms for Parsimony and Minimum Perfect Phylogeny Haplotyping Problems. WABI 2006: 80-91 - 2005
- [c1]Rudi Cilibrasi, Leo van Iersel, Steven Kelk, John Tromp:
On the Complexity of Several Haplotyping Problems. WABI 2005: 128-139
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
load content from web.archive.org
Privacy notice: By enabling the option above, your browser will contact the API of web.archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
Tweets on dblp homepage
Show tweets from 
on the dblp homepage.
Privacy notice: By enabling the option above, your browser will contact twitter.com and twimg.com to load tweets curated by our Twitter account. At the same time, Twitter will persistently store several cookies with your web browser. While we did signal Twitter to not track our users by setting the "dnt" flag, we do not have any control over how Twitter uses your data. So please proceed with care and consider checking the Twitter privacy policy.
last updated on 2021-02-18 23:31 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
