Charles Semple

,

Gerry Toft

J. Comb. Theory B, 2026

Bounding the SNPR Distance Between Two Tree-Child Networks Using Generalised Agreement Forests.

[BibT_eX]

[DOI]

Steven Kelk

,

,

Electron. J. Comb., 2025

What is a $4$-Connected Matroid?

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2025

Orienting undirected phylogenetic networks.

[BibT_eX]

[DOI]

,

,

,

,

,

,

J. Comput. Syst. Sci., March, 2024

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., January, 2024

The excluded minors for the intersection of bicircular and lattice path matroids.

[BibT_eX]

[DOI]

Emma Hogan

,

Eur. J. Comb., 2024

Phylogenetic Trees Defined by at Most Three Characters.

[BibT_eX]

[DOI]

,

,

,

Electron. J. Comb., 2024

Excluded minors are almost fragile II: Essential elements.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, November, 2023

The excluded minors for 2- and 3-regular matroids.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, November, 2023

Cyclic Matroids.

[BibT_eX]

[DOI]

Nick Brettell

,

,

Gerry Toft

SIAM J. Discret. Math., June, 2023

A Splitter Theorem for Elastic Elements in 3-Connected Matroids.

[BibT_eX]

[DOI]

George Drummond

,

Electron. J. Comb., 2023

On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks.

[BibT_eX]

[DOI]

,

,

Kristina Wicke

Theor. Comput. Sci., 2022

On the Maximum Agreement Subtree Conjecture for Balanced Trees.

[BibT_eX]

[DOI]

,

,

,

,

,

SIAM J. Discret. Math., 2022

Non-essential arcs in phylogenetic networks.

[BibT_eX]

[DOI]

,

J. Comput. Syst. Sci., 2022

Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks.

[BibT_eX]

[DOI]

,

,

CoRR, 2022

Elastic Elements in 3-Connected Matroids.

[BibT_eX]

[DOI]

,

,

,

,

Electron. J. Comb., 2021

Display Sets of Normal and Tree-Child Networks.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2021

The excluded minors for the class of spike minors.

[BibT_eX]

[DOI]

,

,

,

,

,

,

Adv. Appl. Math., June, 2020

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.

[BibT_eX]

[DOI]

,

,

,

Theor. Comput. Sci., 2020

The Unbreakable Frame Matroids.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2020

Excluded minors are almost fragile.

[BibT_eX]

[DOI]

,

,

,

,

J. Comb. Theory, Ser. B, 2020

Caterpillars on three and four leaves are sufficient to reconstruct normal networks.

[BibT_eX]

[DOI]

,

CoRR, 2020

Displaying trees across two phylogenetic networks.

[BibT_eX]

[DOI]

,

,

Theor. Comput. Sci., 2019

Matroids with a cyclic arrangement of circuits and cocircuits.

[BibT_eX]

[DOI]

,

,

,

Eur. J. Comb., 2019

Rooting for phylogenetic networks.

[BibT_eX]

[DOI]

,

,

,

,

,

,

CoRR, 2019

A Splitter Theorem for 3-Connected 2-Polymatroids.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2019

Matroids with many small circuits and cocircuits.

[BibT_eX]

[DOI]

,

,

,

Adv. Appl. Math., 2019

Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2019

A universal tree-based network with the minimum number of reticulations.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2018

Constructing Tree-Child Networks from Distance Matrices.

[BibT_eX]

[DOI]

,

,

Nihan Tokac

Algorithmica, 2018

New characterisations of tree-based networks and proximity measures.

[BibT_eX]

[DOI]

Andrew R. Francis

,

,

Adv. Appl. Math., 2018

Size of a phylogenetic network.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

Recovering tree-child networks from shortest inter-taxa distance information.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2017

Quarnet inference rules for level-1 networks.

[BibT_eX]

[DOI]

,

,

,

CoRR, 2017

Nonbinary tree-based networks: characterisations, metrics, and support trees.

[BibT_eX]

[DOI]

Joan Carles Pons

,

,

CoRR, 2017

A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids.

[BibT_eX]

[DOI]

,

,

SIAM J. Discret. Math., 2016

Determining a Binary Matroid from its Small Circuits.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2016

Reticulation-visible networks.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2016

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., 2015

Representing Partitions on Trees.

[BibT_eX]

[DOI]

,

,

,

SIAM J. Discret. Math., 2014

Optimizing tree and character compatibility across several phylogenetic trees.

[BibT_eX]

[DOI]

,

Katherine St. John

,

Theor. Comput. Sci., 2013

Counting Trees in a Phylogenetic Network Is \#P-Complete.

[BibT_eX]

[DOI]

,

Katherine St. John

,

SIAM J. Comput., 2013

On the complexity of computing the temporal hybridization number for two phylogenies.

[BibT_eX]

[DOI]

Peter J. Humphries

,

,

Discret. Appl. Math., 2013

Constructing a 3-tree for a 3-connected matroid.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2013

Special issue in honor of Geoff Whittle.

[BibT_eX]

[DOI]

Dillon Mayhew

,

,

Adv. Appl. Math., 2013

On properties of almost all matroids.

[BibT_eX]

[DOI]

,

,

,

Adv. Appl. Math., 2013

An upgraded Wheels-and-Whirls Theorem for 3-connected matroids.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2012

Bounding the maximum size of a minimal definitive set of quartets.

[BibT_eX]

[DOI]

Max Dietrich

,

Catherine McCartin

,

Inf. Process. Lett., 2012

Quantifying Hybridization in Realistic Time.

[BibT_eX]

[DOI]

Joshua Collins

,

,

J. Comput. Biol., 2011

Exposing 3-separations in 3-connected matroids.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., 2011

Locating a tree in a phylogenetic network.

[BibT_eX]

[DOI]

Leo van Iersel

,

,

Inf. Process. Lett., 2010

Hybridization in Nonbinary Trees.

[BibT_eX]

[DOI]

,

IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Note on the hybridization number and subtree distance in phylogenetics.

[BibT_eX]

[DOI]

Peter J. Humphries

,

Appl. Math. Lett., 2009

Optimizing phylogenetic diversity across two trees.

[BibT_eX]

[DOI]

,

,

Andreas Spillner

Appl. Math. Lett., 2009

Characterizing weak compatibility in terms of weighted quartets.

[BibT_eX]

[DOI]

,

,

,

,

Adv. Appl. Math., 2009

Nature Reserve Selection Problem: A Tight Approximation Algorithm.

[BibT_eX]

[DOI]

,

IEEE ACM Trans. Comput. Biol. Bioinform., 2008

A 3-approximation algorithm for the subtree distance between phylogenies.

[BibT_eX]

[DOI]

,

Catherine McCartin

,

J. Discrete Algorithms, 2008

A chain theorem for matroids.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2008

Wild triangles in 3-connected matroids.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2008

Negative Correlation in Graphs and Matroids.

[BibT_eX]

[DOI]

,

Dominic Welsh

Comb. Probab. Comput., 2008

Quartet Compatibility and the Quartet Graph.

[BibT_eX]

[DOI]

Stefan Grünewald

,

Peter J. Humphries

,

Electron. J. Comb., 2008

Maintaining 3-connectivity relative to a fixed basis.

[BibT_eX]

[DOI]

,

,

Adv. Appl. Math., 2008

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

,

IEEE ACM Trans. Comput. Biol. Bioinform., 2007

The structure of the 3-separations of 3-connected matroids II.

[BibT_eX]

[DOI]

,

,

Eur. J. Comb., 2007

The structure of 3-connected matroids of path width three.

[BibT_eX]

[DOI]

Rhiannon Hall

,

,

Eur. J. Comb., 2007

Computing the minimum number of hybridization events for a consistent evolutionary history.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2007

Unicyclic Networks: Compatibility and Enumeration.

[BibT_eX]

[DOI]

,

IEEE ACM Trans. Comput. Biol. Bioinform., 2006

Identifying X-Trees with Few Characters.

[BibT_eX]

[DOI]

,

,

Electron. J. Comb., 2006

A Class of General Supertree Methods for Nested Taxa.

[BibT_eX]

[DOI]

Philip Daniel

,

SIAM J. Discret. Math., 2005

Identifying phylogenetic trees.

[BibT_eX]

[DOI]

,

Katharina T. Huber

,

Discret. Math., 2005

Recovering a phylogenetic tree using pairwise closure operations.

[BibT_eX]

[DOI]

,

,

,

Appl. Math. Lett., 2005

The structure of equivalent 3-separations in a 3-connected matroid.

[BibT_eX]

[DOI]

Rhiannon Hall

,

,

Adv. Appl. Math., 2005

The structure of the 3-separations of 3-connected matroids.

[BibT_eX]

[DOI]

,

,

J. Comb. Theory B, 2004

Replacing cliques by stars in quasi-median graphs.

[BibT_eX]

[DOI]

Katharina T. Huber

,

Vincent Moulton

,

Discret. Appl. Math., 2004

Supertree algorithms for ancestral divergence dates and nested taxa.

[BibT_eX]

[DOI]

,

,

,

,

Bioinform., 2004

Cyclic permutations and evolutionary trees.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2004

Fork-decompositions of matroids.

[BibT_eX]

[DOI]

,

,

,

Adv. Appl. Math., 2004

Counting consistent phylogenetic trees is #P-complete.

[BibT_eX]

[DOI]

,

,

John M. Talbot

Adv. Appl. Math., 2004

Reconstructing Minimal Rooted Trees.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2003

On Matroids of Branch-Width Three.

[BibT_eX]

[DOI]

,

,

,

J. Comb. Theory B, 2002

A characterization for a set of partial partitions to define an X-tree.

[BibT_eX]

[DOI]

,

Discret. Math., 2002

Infinite antichains of matroids with characteristic set {p}.

[BibT_eX]

[DOI]

,

,

,

Discret. Math., 2002

Tree Reconstruction from Multi-State Characters.

[BibT_eX]

[DOI]

,

Adv. Appl. Math., 2002

Generalized Delta?-Y Exchange and k-Regular Matroids.

[BibT_eX]

[DOI]

,

,

Dirk L. Vertigan

J. Comb. Theory B, 2000

A supertree method for rooted trees.

[BibT_eX]

[DOI]

,

Discret. Appl. Math., 2000

On Maximum-sized k-Regular Matroids.

[BibT_eX]

[DOI]