A Graph-Neural-Network Approach for Reconstructing Temporal Networks

Orienting undirected phylogenetic networks

Classes of Semi-binary Phylogenetic Networks encoded by μ-representations

Forest-Based Binary Phylogenetic Networks: Finding Optimal Base Forests with Integer Linear Programming

Computing the Scanwidth of Directed Acyclic Graphs

Creating phylogenetic networks from clusters

Treewidth based algorithms for Tree Containment in phylogenetics

Polynomial invariants for cactuses

How Can We Maximize Phylogenetic Diversity? Parameterized Approaches for Networks

Finding Degree-Constrained Acyclic Orientations

A new polynomial for describing Phylogenetic Networks

Encoding undirected and semi-directed binary phylogenetic networks by quarnets

Making phylogenetic networks orchard: Algorithms to determine if a phylogenetic network is orchard and to transform non-orchard to orchard networks

Level-2 networks from shortest and longest distances

Embedding Phylogenetic Trees in Networks of Low Treewidth

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

New FPT Algorithms for Finding the Temporal Hybridization Number for Sets of Phylogenetic Trees

Orchard Networks are Trees with Additional Horizontal Arcs

An algorithm for reconstructing level-2 phylogenetic networks from trinets

On Phylogenetic Encodings and Orchard Networks