Exploring the tiers of rooted phylogenetic network space using tail moves. - Remie Janssen; Mark Jones 001; Péter L. Erdös; Leo van Iersel; Céline Scornavacca (CoRR, 2017)

Polynomial-Time Algorithms for Phylogenetic Inference Problems. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (AlCoB, 2018)

Rearrangement operations on unrooted phylogenetic networks. - Remie Janssen; Jonathan Klawitter (CoRR, 2019)

Rooting for phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (CoRR, 2019)

Cutting an alignment with Ockham's razor. - Mark Jones 001; Philippe Gambette; Leo van Iersel; Remie Janssen; Steven Kelk; Fabio Pardi; Céline Scornavacca (CoRR, 2019)

Treewidth of display graphs: bounds, brambles and applications. - Remie Janssen; Mark Jones 001; Steven Kelk; Georgios Stamoulis; Taoyang Wu (J. Graph Algorithms Appl., 2019)

Combining Networks Using Cherry Picking Sequences. - Remie Janssen; Mark Jones 001; Yukihiro Murakami (AlCoB, 2020)

Linear Time Algorithm for Tree-Child Network Containment. - Remie Janssen; Yukihiro Murakami (AlCoB, 2020)

The Burning Number of Directed Graphs: Bounds and Computational Complexity. - Remie Janssen (CoRR, 2020)

Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (IEEE ACM Trans. Comput. Biol. Bioinform., 2020)

A unifying characterization of tree-based networks and orchard networks using cherry covers. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Adv. Appl. Math., 2021)

Comparing the topology of phylogenetic network generators. - Remie Janssen; Pengyu Liu 003 (J. Bioinform. Comput. Biol., 2021)

Heading in the right direction? Using head moves to traverse phylogenetic network space. - Remie Janssen (J. Graph Algorithms Appl., 2021)

On cherry-picking and network containment. - Remie Janssen; Yukihiro Murakami (Theor. Comput. Sci., 2021)

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees. - Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (Algorithmica, 2022)

A Near-Linear Kernel for Two-Parsimony Distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yuki Murakami; Norbert Zeh (CoRR, 2022)

Level-2 networks from shortest and longest distances. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami (Discret. Appl. Math., 2022)

A near-linear kernel for bounded-state parsimony distance. - Elise Deen; Leo van Iersel; Remie Janssen; Mark Jones 001; Yukihiro Murakami; Norbert Zeh (J. Comput. Syst. Sci., 2024)

Orienting undirected phylogenetic networks. - Katharina T. Huber; Leo van Iersel; Remie Janssen; Mark Jones 001; Vincent Moulton; Yukihiro Murakami; Charles Semple (J. Comput. Syst. Sci., 2024)

PhyloX: A Python package for complete phylogenetic network workflows. - Remie Janssen (J. Open Source Softw., 2024)