k-Regular Matroids. - Charles Semple (DMTCS, 1996)

On Maximum-sized k-Regular Matroids. - Charles Semple (Graphs Comb., 1999)

Tree Reconstruction via a Closure Operation on Partial Splits. - Charles Semple; Mike A. Steel (JOBIM, 2000)

A supertree method for rooted trees. - Charles Semple; Mike A. Steel (Discret. Appl. Math., 2000)

Generalized Delta?-Y Exchange and k-Regular Matroids. - James G. Oxley; Charles Semple; Dirk L. Vertigan (J. Comb. Theory B, 2000)

Tree Reconstruction from Multi-State Characters. - Charles Semple; Mike A. Steel (Adv. Appl. Math., 2002)

Infinite antichains of matroids with characteristic set {p}. - James G. Oxley; Charles Semple; Dirk L. Vertigan; Geoffrey P. Whittle (Discret. Math., 2002)

A characterization for a set of partial partitions to define an X-tree. - Charles Semple; Mike A. Steel (Discret. Math., 2002)

On Matroids of Branch-Width Three. - Rhiannon Hall; James G. Oxley; Charles Semple; Geoffrey P. Whittle (J. Comb. Theory B, 2002)

Reconstructing Minimal Rooted Trees. - Charles Semple (Discret. Appl. Math., 2003)

Counting consistent phylogenetic trees is #P-complete. - Magnus Bordewich; Charles Semple; John M. Talbot (Adv. Appl. Math., 2004)

Fork-decompositions of matroids. - Rhiannon Hall; James G. Oxley; Charles Semple; Geoff Whittle (Adv. Appl. Math., 2004)

Cyclic permutations and evolutionary trees. - Charles Semple; Mike A. Steel (Adv. Appl. Math., 2004)

Supertree algorithms for ancestral divergence dates and nested taxa. - Charles Semple; Philip Daniel; Wim Hordijk; Roderic D. M. Page; Mike A. Steel (Bioinform., 2004)

Replacing cliques by stars in quasi-median graphs. - Katharina T. Huber; Vincent Moulton; Charles Semple (Discret. Appl. Math., 2004)

The structure of the 3-separations of 3-connected matroids. - James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2004)

The structure of equivalent 3-separations in a 3-connected matroid. - Rhiannon Hall; James G. Oxley; Charles Semple (Adv. Appl. Math., 2005)

Recovering a phylogenetic tree using pairwise closure operations. - Katharina T. Huber; Vincent Moulton; Charles Semple; Mike A. Steel (Appl. Math. Lett., 2005)

Identifying phylogenetic trees. - Magnus Bordewich; Katharina T. Huber; Charles Semple (Discret. Math., 2005)

A Class of General Supertree Methods for Nested Taxa. - Philip Daniel; Charles Semple (SIAM J. Discret. Math., 2005)

Identifying X-Trees with Few Characters. - Magnus Bordewich; Charles Semple; Mike A. Steel (Electron. J. Comb., 2006)

Unicyclic Networks: Compatibility and Enumeration. - Charles Semple; Mike A. Steel (IEEE ACM Trans. Comput. Biol. Bioinform., 2006)

Computing the minimum number of hybridization events for a consistent evolutionary history. - Magnus Bordewich; Charles Semple (Discret. Appl. Math., 2007)

The structure of 3-connected matroids of path width three. - Rhiannon Hall; James G. Oxley; Charles Semple (Eur. J. Comb., 2007)

The structure of the 3-separations of 3-connected matroids II. - James G. Oxley; Charles Semple; Geoff Whittle (Eur. J. Comb., 2007)

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. - Magnus Bordewich; Charles Semple (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

Maintaining 3-connectivity relative to a fixed basis. - James G. Oxley; Charles Semple; Geoff Whittle (Adv. Appl. Math., 2008)

Quartet Compatibility and the Quartet Graph. - Stefan Grünewald; Peter J. Humphries; Charles Semple (Electron. J. Comb., 2008)

Negative Correlation in Graphs and Matroids. - Charles Semple; Dominic Welsh (Comb. Probab. Comput., 2008)

Wild triangles in 3-connected matroids. - James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2008)

A chain theorem for matroids. - James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2008)

A 3-approximation algorithm for the subtree distance between phylogenies. - Magnus Bordewich; Catherine McCartin; Charles Semple (J. Discrete Algorithms, 2008)

Nature Reserve Selection Problem: A Tight Approximation Algorithm. - Magnus Bordewich; Charles Semple (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Characterizing weak compatibility in terms of weighted quartets. - Stefan Grünewald; Katharina T. Huber; Vincent Moulton; Charles Semple; Andreas Spillner 001 (Adv. Appl. Math., 2009)

Optimizing phylogenetic diversity across two trees. - Magnus Bordewich; Charles Semple; Andreas Spillner 001 (Appl. Math. Lett., 2009)

Note on the hybridization number and subtree distance in phylogenetics. - Peter J. Humphries; Charles Semple (Appl. Math. Lett., 2009)

Hybridization in Nonbinary Trees. - Simone Linz; Charles Semple (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

Locating a tree in a phylogenetic network. - Leo van Iersel; Charles Semple; Mike A. Steel (Inf. Process. Lett., 2010)

Exposing 3-separations in 3-connected matroids. - James G. Oxley; Charles Semple; Geoff Whittle (Adv. Appl. Math., 2011)

Quantifying Hybridization in Realistic Time. - Joshua Collins; Simone Linz; Charles Semple (J. Comput. Biol., 2011)

Bounding the maximum size of a minimal definitive set of quartets. - Max Dietrich; Catherine McCartin; Charles Semple (Inf. Process. Lett., 2012)

An upgraded Wheels-and-Whirls Theorem for 3-connected matroids. - James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2012)

On properties of almost all matroids. - Lisa Lowrance; James G. Oxley; Charles Semple; Dominic Welsh (Adv. Appl. Math., 2013)

Special issue in honor of Geoff Whittle. - Dillon Mayhew; James G. Oxley; Charles Semple (Adv. Appl. Math., 2013)

Constructing a 3-tree for a 3-connected matroid. - James G. Oxley; Charles Semple (Adv. Appl. Math., 2013)

On the complexity of computing the temporal hybridization number for two phylogenies. - Peter J. Humphries; Simone Linz; Charles Semple (Discret. Appl. Math., 2013)

Counting Trees in a Phylogenetic Network Is #P-Complete. - Simone Linz; Katherine St. John; Charles Semple (SIAM J. Comput., 2013)

Optimizing tree and character compatibility across several phylogenetic trees. - Simone Linz; Katherine St. John; Charles Semple (Theor. Comput. Sci., 2013)

Representing Partitions on Trees. - Katharina T. Huber; Vincent Moulton; Charles Semple; Taoyang Wu (SIAM J. Discret. Math., 2014)

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. - Magnus Bordewich; Charles Semple (SIAM J. Discret. Math., 2015)

Reticulation-visible networks. - Magnus Bordewich; Charles Semple (Adv. Appl. Math., 2016)

Determining a Binary Matroid from its Small Circuits. - James G. Oxley; Charles Semple; Geoff Whittle (Electron. J. Comb., 2016)

A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids. - James G. Oxley; Charles Semple; Geoff Whittle (SIAM J. Discret. Math., 2016)

Nonbinary tree-based networks: characterisations, metrics, and support trees. - Joan Carles Pons; Charles Semple; Mike A. Steel (CoRR, 2017)

Quarnet inference rules for level-1 networks. - Katharina T. Huber; Vincent Moulton; Charles Semple; Taoyang Wu (CoRR, 2017)

Recovering tree-child networks from shortest inter-taxa distance information. - Magnus Bordewich; Katharina T. Huber; Vincent Moulton; Charles Semple (CoRR, 2017)

Size of a phylogenetic network. - Charles Semple (Discret. Appl. Math., 2017)

New characterisations of tree-based networks and proximity measures. - Andrew R. Francis; Charles Semple; Mike A. Steel (Adv. Appl. Math., 2018)

Constructing Tree-Child Networks from Distance Matrices. - Magnus Bordewich; Charles Semple; Nihan Tokac (Algorithmica, 2018)

A universal tree-based network with the minimum number of reticulations. - Magnus Bordewich; Charles Semple (Discret. Appl. Math., 2018)

Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. - Simone Linz; Charles Semple (Adv. Appl. Math., 2019)

Matroids with many small circuits and cocircuits. - James G. Oxley; Simon Pfeil; Charles Semple; Geoff Whittle (Adv. Appl. Math., 2019)

A Splitter Theorem for 3-Connected 2-Polymatroids. - James G. Oxley; Charles Semple; Geoff Whittle (Electron. J. Comb., 2019)

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

Matroids with a cyclic arrangement of circuits and cocircuits. - Nick Brettell; Deborah Chun; Tara Fife; Charles Semple (Eur. J. Comb., 2019)

Displaying trees across two phylogenetic networks. - Janosch Döcker; Simone Linz; Charles Semple (Theor. Comput. Sci., 2019)

Caterpillars on three and four leaves are sufficient to reconstruct normal networks. - Simone Linz; Charles Semple (CoRR, 2020)

Excluded minors are almost fragile. - Nick Brettell; Ben Clark; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory, Ser. B, 2020)

The Unbreakable Frame Matroids. - Tara Fife; Dillon Mayhew; James G. Oxley; Charles Semple (SIAM J. Discret. Math., 2020)

Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. - Janosch Döcker; Britta Dorn; Simone Linz; Charles Semple (Theor. Comput. Sci., 2020)

Display Sets of Normal and Tree-Child Networks. - Janosch Döcker; Simone Linz; Charles Semple (Electron. J. Comb., 2021)

Elastic Elements in 3-Connected Matroids. - George Drummond; Zach Gershkoff; Susan Jowett; Charles Semple; Jagdeep Singh (Electron. J. Comb., 2021)

Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. - Janosch Döcker; Simone Linz; Charles Semple (CoRR, 2022)

Non-essential arcs in phylogenetic networks. - Simone Linz; Charles Semple (J. Comput. Syst. Sci., 2022)

On the Maximum Agreement Subtree Conjecture for Balanced Trees. - Magnus Bordewich; Simone Linz; Megan Owen; Katherine St. John; Charles Semple; Kristina Wicke (SIAM J. Discret. Math., 2022)

On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. - Magnus Bordewich; Charles Semple; Kristina Wicke (Theor. Comput. Sci., 2022)

A Splitter Theorem for Elastic Elements in 3-Connected Matroids. - George Drummond; Charles Semple (Electron. J. Comb., 2023)

Cyclic Matroids. - Nick Brettell; Charles Semple; Gerry Toft (SIAM J. Discret. Math., 2023)

The excluded minors for 2- and 3-regular matroids. - Nick Brettell; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2023)

Excluded minors are almost fragile II: Essential elements. - Nick Brettell; James G. Oxley; Charles Semple; Geoff Whittle (J. Comb. Theory B, 2023)

Phylogenetic Trees Defined by at Most Three Characters. - Katharina T. Huber; Simone Linz; Vincent Moulton; Charles Semple (Electron. J. Comb., 2024)

The excluded minors for the intersection of bicircular and lattice path matroids. - Emma Hogan; Charles Semple (Eur. J. Comb., 2024)

Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. - Janosch Döcker; Simone Linz; Charles Semple (Adv. Appl. Math., 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)

What is a $4$-Connected Matroid? - Nick Brettell; Susan Jowett; James G. Oxley; Charles Semple; Geoff Whittle (Electron. J. Comb., 2025)