According to our database
1,
Charles Semple
authored at least 82 papers
between 1996 and 2024.
Collaborative distances:
2024
Orienting undirected phylogenetic networks.
J. Comput. Syst. Sci., March, 2024
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks.
Adv. Appl. Math., January, 2024
2023
Excluded minors are almost fragile II: Essential elements.
J. Comb. Theory, Ser. B, November, 2023
The excluded minors for 2- and 3-regular matroids.
J. Comb. Theory, Ser. B, November, 2023
SIAM J. Discret. Math., June, 2023
A Splitter Theorem for Elastic Elements in 3-Connected Matroids.
Electron. J. Comb., 2023
2022
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks.
Theor. Comput. Sci., 2022
On the Maximum Agreement Subtree Conjecture for Balanced Trees.
SIAM J. Discret. Math., 2022
Non-essential arcs in phylogenetic networks.
J. Comput. Syst. Sci., 2022
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks.
CoRR, 2022
2021
Elastic Elements in 3-Connected Matroids.
Electron. J. Comb., 2021
Display Sets of Normal and Tree-Child Networks.
Electron. J. Comb., 2021
2020
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy.
Theor. Comput. Sci., 2020
The Unbreakable Frame Matroids.
SIAM J. Discret. Math., 2020
Excluded minors are almost fragile.
J. Comb. Theory, Ser. B, 2020
Caterpillars on three and four leaves are sufficient to reconstruct normal networks.
CoRR, 2020
2019
Displaying trees across two phylogenetic networks.
Theor. Comput. Sci., 2019
Matroids with a cyclic arrangement of circuits and cocircuits.
Eur. J. Comb., 2019
Rooting for phylogenetic networks.
CoRR, 2019
A Splitter Theorem for 3-Connected 2-Polymatroids.
Electron. J. Comb., 2019
Matroids with many small circuits and cocircuits.
Adv. Appl. Math., 2019
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies.
Adv. Appl. Math., 2019
2018
A universal tree-based network with the minimum number of reticulations.
Discret. Appl. Math., 2018
Constructing Tree-Child Networks from Distance Matrices.
Algorithmica, 2018
New characterisations of tree-based networks and proximity measures.
Adv. Appl. Math., 2018
2017
Size of a phylogenetic network.
Discret. Appl. Math., 2017
Recovering tree-child networks from shortest inter-taxa distance information.
CoRR, 2017
Quarnet inference rules for level-1 networks.
CoRR, 2017
Nonbinary tree-based networks: characterisations, metrics, and support trees.
CoRR, 2017
2016
A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids.
SIAM J. Discret. Math., 2016
Determining a Binary Matroid from its Small Circuits.
Electron. J. Comb., 2016
Reticulation-visible networks.
Adv. Appl. Math., 2016
2015
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters.
SIAM J. Discret. Math., 2015
2014
Representing Partitions on Trees.
SIAM J. Discret. Math., 2014
2013
Optimizing tree and character compatibility across several phylogenetic trees.
Theor. Comput. Sci., 2013
Counting Trees in a Phylogenetic Network Is \#P-Complete.
SIAM J. Comput., 2013
On the complexity of computing the temporal hybridization number for two phylogenies.
Discret. Appl. Math., 2013
Constructing a 3-tree for a 3-connected matroid.
Adv. Appl. Math., 2013
Special issue in honor of Geoff Whittle.
Adv. Appl. Math., 2013
On properties of almost all matroids.
Adv. Appl. Math., 2013
2012
An upgraded Wheels-and-Whirls Theorem for 3-connected matroids.
J. Comb. Theory, Ser. B, 2012
Bounding the maximum size of a minimal definitive set of quartets.
Inf. Process. Lett., 2012
2011
Quantifying Hybridization in Realistic Time.
J. Comput. Biol., 2011
Exposing 3-separations in 3-connected matroids.
Adv. Appl. Math., 2011
2010
Locating a tree in a phylogenetic network.
Inf. Process. Lett., 2010
2009
Hybridization in Nonbinary Trees.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009
Note on the hybridization number and subtree distance in phylogenetics.
Appl. Math. Lett., 2009
Optimizing phylogenetic diversity across two trees.
Appl. Math. Lett., 2009
Characterizing weak compatibility in terms of weighted quartets.
Adv. Appl. Math., 2009
2008
Nature Reserve Selection Problem: A Tight Approximation Algorithm.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008
A 3-approximation algorithm for the subtree distance between phylogenies.
J. Discrete Algorithms, 2008
A chain theorem for matroids.
J. Comb. Theory, Ser. B, 2008
Wild triangles in 3-connected matroids.
J. Comb. Theory, Ser. B, 2008
Negative Correlation in Graphs and Matroids.
Comb. Probab. Comput., 2008
Quartet Compatibility and the Quartet Graph.
Electron. J. Comb., 2008
Maintaining 3-connectivity relative to a fixed basis.
Adv. Appl. Math., 2008
2007
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007
The structure of the 3-separations of 3-connected matroids II.
Eur. J. Comb., 2007
The structure of 3-connected matroids of path width three.
Eur. J. Comb., 2007
Computing the minimum number of hybridization events for a consistent evolutionary history.
Discret. Appl. Math., 2007
2006
Unicyclic Networks: Compatibility and Enumeration.
IEEE ACM Trans. Comput. Biol. Bioinform., 2006
Identifying X-Trees with Few Characters.
Electron. J. Comb., 2006
2005
A Class of General Supertree Methods for Nested Taxa.
SIAM J. Discret. Math., 2005
Identifying phylogenetic trees.
Discret. Math., 2005
Recovering a phylogenetic tree using pairwise closure operations.
Appl. Math. Lett., 2005
The structure of equivalent 3-separations in a 3-connected matroid.
Adv. Appl. Math., 2005
2004
The structure of the 3-separations of 3-connected matroids.
J. Comb. Theory, Ser. B, 2004
Replacing cliques by stars in quasi-median graphs.
Discret. Appl. Math., 2004
Supertree algorithms for ancestral divergence dates and nested taxa.
Bioinform., 2004
Cyclic permutations and evolutionary trees.
Adv. Appl. Math., 2004
Fork-decompositions of matroids.
Adv. Appl. Math., 2004
Counting consistent phylogenetic trees is #P-complete.
Adv. Appl. Math., 2004
2003
Reconstructing Minimal Rooted Trees.
Discret. Appl. Math., 2003
2002
On Matroids of Branch-Width Three.
J. Comb. Theory, Ser. B, 2002
A characterization for a set of partial partitions to define an <i>X</i>-tree.
Discret. Math., 2002
Infinite antichains of matroids with characteristic set {<i>p</i>}.
Discret. Math., 2002
Tree Reconstruction from Multi-State Characters.
Adv. Appl. Math., 2002
2000
Generalized Delta?-Y Exchange and <i>k</i>-Regular Matroids.
J. Comb. Theory, Ser. B, 2000
A supertree method for rooted trees.
Discret. Appl. Math., 2000
Tree Reconstruction via a Closure Operation on Partial Splits.
Proceedings of the Computational Biology, 2000
1999
On Maximum-sized k-Regular Matroids.
Graphs Comb., 1999
1996
Proceedings of the First Conference of the Centre for Discrete Mathematics and Theoretical Computer Science, 1996
