Orienting undirected phylogenetic networks

A Practical Fixed-Parameter Algorithm for Constructing Tree-Child Networks from Multiple Binary Trees

Orchard Networks are Trees with Additional Horizontal Arcs

Connectedness of Unit Distance Subgraphs Induced by Closed Convex Sets

Level-2 networks from shortest and longest distances

Rearranging Phylogenetic Networks

A unifying characterization of tree-based networks and orchard networks using cherry covers

On cherry-picking and network containment

Distinguishing level-1 phylogenetic networks on the basis of data generated by Markov processes

Comparing the topology of phylogenetic network generators

Heading in the right direction? Using head moves to traverse phylogenetic network space

Polynomial-Time Algorithms for Phylogenetic Inference Problems Involving Duplication and Reticulation

The burning number of directed graphs: Bounds and computational complexity

Combining Networks Using Cherry Picking Sequences

Linear Time Algorithm for Tree-Child Network Containment

Rearrangement operations on unrooted phylogenetic networks

Reconstructing Tree-Child Networks from Reticulate-Edge-Deleted Subnetworks

Treewidth of display graphs: Bounds, brambles and applications

Exploring the Tiers of Rooted Phylogenetic Network Space Using Tail Moves

Polynomial-Time Algorithms for Phylogenetic Inference Problems