Leo van Iersel

After studying applied mathematics at the University of Twente, I obtained my PhD at Eindhoven University of Technology. After that, I have worked as a postdoc at the University of Canterbury, as a teacher in primary and secondary schools in Tanzania and Kenya and as a researcher at CWI in Amsterdam. Since 2014, I am an assistant professor at TU Delft (tenured since 2017).

Organized workshops

• Distinguishability in genealogical phylogenetic networks, 13 – 17 August 2018, Lorentz Center, Leiden. Scientific organizers: Leo van Iersel, Steven Kelk, David Morrison and Celine Scornavacca.
• Utilizing Genealogical Phylogenetic Networks in Evolutionary Biology: Touching the Data, 7-11 July 2014, Lorentz Center, Leiden.
• The Future of Phylogenetic Networks, 15-19 October 2012, Lorentz Center, Leiden.

Program Committee memberships

• SOFSEM 2020
• BCB 2017
• AAIM 2016
  
• ESA 2015

Grants

• Vidi grant “Encoding, reconstructing and comparing complex evolutionary scenarios” funded by NWO.
  
• Veni grant “Bringing phylogenetic networks to life” funded by NWO.

New papers and preprints (a full list is here)

• Leo van Iersel, Mark Jones and Steven Kelk. A third strike against perfect phylogeny. Systematic Biology, DOI: 10.1093/sysbio/syz009 (2019). (arXiv)
• Yukihiro Murakami, Leo van Iersel, Remie Janssen, Mark Jones and Vincent Moulton. Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks. arXiv:1811.06777 [math.CO] (2018).
• Teun Janssen, Céline Swennenhuis, Abdoul Bitar, Thomas Bosman, Dion Gijswijt, Leo van Iersel, Stèphane Dauzére-Pérès and Claude Yugma. Parallel Machine Scheduling with a Single Resource per Job. arXiv:1809.05009 [cs.DM] (2018).
• Péter L. Erdős, Leo van Iersel and Mark Jones. Not all phylogenetic networks are leaf-reconstructible. arXiv:1803.03197 [math.CO] (2018).
• Leo van Iersel, Remie Janssen, Mark Jones, Yukihiro Murakami and Norbert Zeh. Polynomial-Time Algorithms for Phylogenetic Inference Problems.  Preliminary version in AlCoB 2018, LNBI 10849: 37–49 (2018). (arXiv)
• Leo van Iersel, Mark Jones and Celine Scornavacca. Improved maximum parsimony models for phylogenetic networks. Systematic Biology, 67(3):518-542 (2018) (free-access link) (preprint).
• Remie Janssen, Mark Jones, Péter L. Erdős, Leo van Iersel, Celine Scornavacca. Exploring the tiers of rooted phylogenetic network space using tail moves. Bulletin of Mathematical Biology, 80 (8): 2177–2208 (2018).
• Steven Kelk, Fabio Pardi, Celine Scornavacca and Leo van Iersel. Finding the most parsimonious or likely tree in a network with respect to an alignment. Journal of Mathematical Biology, doi: s00285-018-1282-2 (2018). (arXiv)
• Leo van Iersel and Vincent Moulton. Leaf-reconstructibility of phylogenetic networks. SIAM Journal on Discrete Mathematics 32(3): 2047–2066 (2018). (arXiv) (PDF)
• Janosch Döcker, Leo van Iersel, Steven Kelk, Simone Linz. Deciding the existence of a cherry-picking sequence is hard on two trees. Discrete Applied Mathematics, DOI: 10.1016/j.dam.2019.01.031 (2019). (arXiv)

In Dutch:

• Leo van Iersel. Hoe zijn ze verwant? Nieuw Archief voor Wiskunde, 5/16 (3): 174-178 (2015).

Advertisements