default search action
Charles Semple
Person information
- affiliation: University of Canterbury, Christchurch, New Zealand
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j76]Janosch Döcker, Simone Linz
, Charles Semple
Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks. Adv. Appl. Math. 152: 102595 (2024) - [j75]Katharina T. Huber, Simone Linz, Vincent Moulton, Charles Semple:
Phylogenetic Trees Defined by at Most Three Characters. Electron. J. Comb. 31(4) (2024) - [j74]Emma Hogan, Charles Semple:
The excluded minors for the intersection of bicircular and lattice path matroids. Eur. J. Comb. 118: 103923 (2024) - [j73]Katharina T. Huber, Leo van Iersel, Remie Janssen
Orienting undirected phylogenetic networks. J. Comput. Syst. Sci. 140: 103480 (2024) - 2023
- [j72]George Drummond
A Splitter Theorem for Elastic Elements in 3-Connected Matroids. Electron. J. Comb. 30(2) (2023) - [j71]Nick Brettell
The excluded minors for 2- and 3-regular matroids. J. Comb. Theory B 163: 133-218 (2023) - [j70]Nick Brettell
Excluded minors are almost fragile II: Essential elements. J. Comb. Theory B 163: 272-307 (2023) - [j69]Nick Brettell
Cyclic Matroids. SIAM J. Discret. Math. 37(2): 1212-1236 (2023) - 2022
- [j68]Simone Linz
Non-essential arcs in phylogenetic networks. J. Comput. Syst. Sci. 128: 1-17 (2022) - [j67]Magnus Bordewich
On the Maximum Agreement Subtree Conjecture for Balanced Trees. SIAM J. Discret. Math. 36(1): 336-354 (2022) - [j66]Magnus Bordewich
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. Theor. Comput. Sci. 917: 66-80 (2022) - [i10]Janosch Döcker, Simone Linz, Charles Semple
Hypercubes and Hamiltonian Cycles of Display Sets of Rooted Phylogenetic Networks. CoRR abs/2211.06549 (2022) - 2021
- [j65]Janosch Döcker, Simone Linz
Display Sets of Normal and Tree-Child Networks. Electron. J. Comb. 28(1): 1 (2021) - [j64]George Drummond
Elastic Elements in 3-Connected Matroids. Electron. J. Comb. 28(2): 2 (2021) - 2020
- [j63]Nick Brettell
Excluded minors are almost fragile. J. Comb. Theory, Ser. B 140: 263-322 (2020) - [j62]Tara Fife, Dillon Mayhew
The Unbreakable Frame Matroids. SIAM J. Discret. Math. 34(3): 1522-1537 (2020) - [j61]Janosch Döcker, Britta Dorn, Simone Linz
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. Theor. Comput. Sci. 822: 72-91 (2020) - [i9]Simone Linz, Charles Semple:
Caterpillars on three and four leaves are sufficient to reconstruct normal networks. CoRR abs/2002.00483 (2020)
2010 – 2019
- 2019
- [j60]James G. Oxley, Simon Pfeil, Charles Semple
Matroids with many small circuits and cocircuits. Adv. Appl. Math. 105: 1-24 (2019) - [j59]Simone Linz
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Adv. Appl. Math. 105: 102-129 (2019) - [j58]James G. Oxley, Charles Semple
A Splitter Theorem for 3-Connected 2-Polymatroids. Electron. J. Comb. 26(2): 2 (2019) - [j57]Nick Brettell
Matroids with a cyclic arrangement of circuits and cocircuits. Eur. J. Comb. 81: 195-209 (2019) - [j56]Janosch Döcker, Simone Linz
Displaying trees across two phylogenetic networks. Theor. Comput. Sci. 796: 129-146 (2019) - [i8]Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple:
Rooting for phylogenetic networks. CoRR abs/1906.07430 (2019) - [i7]Janosch Döcker, Britta Dorn, Simone Linz, Charles Semple:
Placing quantified variants of 3-SAT and Not-All-Equal 3-SAT in the polynomial hierarchy. CoRR abs/1908.05361 (2019) - 2018
- [j55]Andrew R. Francis
New characterisations of tree-based networks and proximity measures. Adv. Appl. Math. 93: 93-107 (2018) - [j54]Magnus Bordewich
Constructing Tree-Child Networks from Distance Matrices. Algorithmica 80(8): 2240-2259 (2018) - [j53]Magnus Bordewich
A universal tree-based network with the minimum number of reticulations. Discret. Appl. Math. 250: 357-362 (2018) - 2017
- [j52]Charles Semple
Size of a phylogenetic network. Discret. Appl. Math. 217: 362-367 (2017) - [i6]Joan Carles Pons, Charles Semple, Mike A. Steel:
Nonbinary tree-based networks: characterisations, metrics, and support trees. CoRR abs/1710.07836 (2017) - [i5]Katharina T. Huber, Vincent Moulton, Charles Semple, Taoyang Wu:
Quarnet inference rules for level-1 networks. CoRR abs/1711.06720 (2017) - [i4]Magnus Bordewich, Katharina T. Huber, Vincent Moulton, Charles Semple:
Recovering tree-child networks from shortest inter-taxa distance information. CoRR abs/1711.08866 (2017) - [i3]Simone Linz, Charles Semple:
Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. CoRR abs/1712.04131 (2017) - 2016
- [j51]Magnus Bordewich
Reticulation-visible networks. Adv. Appl. Math. 78: 114-141 (2016) - [j50]James G. Oxley, Charles Semple, Geoff Whittle:
Determining a Binary Matroid from its Small Circuits. Electron. J. Comb. 23(1): 1 (2016) - [j49]James G. Oxley, Charles Semple
A Wheels-and-Whirls Theorem for 3-Connected 2-Polymatroids. SIAM J. Discret. Math. 30(1): 493-524 (2016) - 2015
- [j48]Magnus Bordewich
Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. SIAM J. Discret. Math. 29(2): 835-853 (2015) - [i2]Magnus Bordewich, Charles Semple:
Reticulation-Visible Networks. CoRR abs/1508.05424 (2015) - 2014
- [j47]Katharina T. Huber, Vincent Moulton
Representing Partitions on Trees. SIAM J. Discret. Math. 28(3): 1152-1172 (2014) - 2013
- [j46]Dillon Mayhew
Special issue in honor of Geoff Whittle. Adv. Appl. Math. 50(1): 1-5 (2013) - [j45]Lisa Lowrance, James G. Oxley, Charles Semple
On properties of almost all matroids. Adv. Appl. Math. 50(1): 115-124 (2013) - [j44]James G. Oxley, Charles Semple
Constructing a 3-tree for a 3-connected matroid. Adv. Appl. Math. 50(1): 176-200 (2013) - [j43]Peter J. Humphries, Simone Linz
On the complexity of computing the temporal hybridization number for two phylogenies. Discret. Appl. Math. 161(7-8): 871-880 (2013) - [j42]Simone Linz
Counting Trees in a Phylogenetic Network Is \#P-Complete. SIAM J. Comput. 42(4): 1768-1776 (2013) - [j41]Simone Linz
Optimizing tree and character compatibility across several phylogenetic trees. Theor. Comput. Sci. 513: 129-136 (2013) - 2012
- [j40]Max Dietrich, Catherine McCartin, Charles Semple
Bounding the maximum size of a minimal definitive set of quartets. Inf. Process. Lett. 112(16): 651-655 (2012) - [j39]James G. Oxley, Charles Semple
An upgraded Wheels-and-Whirls Theorem for 3-connected matroids. J. Comb. Theory B 102(3): 610-637 (2012) - 2011
- [j38]James G. Oxley, Charles Semple
Exposing 3-separations in 3-connected matroids. Adv. Appl. Math. 47(3): 463-508 (2011) - [j37]Joshua Collins, Simone Linz
Quantifying Hybridization in Realistic Time. J. Comput. Biol. 18(10): 1305-1318 (2011) - 2010
- [j36]Leo van Iersel, Charles Semple
Locating a tree in a phylogenetic network. Inf. Process. Lett. 110(23): 1037-1043 (2010) - [i1]Leo van Iersel, Charles Semple, Mike A. Steel:
Locating a tree in a phylogenetic network. CoRR abs/1006.3122 (2010)
2000 – 2009
- 2009
- [j35]Stefan Grünewald, Katharina T. Huber, Vincent Moulton
Characterizing weak compatibility in terms of weighted quartets. Adv. Appl. Math. 42(3): 329-341 (2009) - [j34]Peter J. Humphries, Charles Semple
Note on the hybridization number and subtree distance in phylogenetics. Appl. Math. Lett. 22(4): 611-615 (2009) - [j33]Magnus Bordewich
Optimizing phylogenetic diversity across two trees. Appl. Math. Lett. 22(5): 638-641 (2009) - [j32]Simone Linz
Hybridization in Nonbinary Trees. IEEE ACM Trans. Comput. Biol. Bioinform. 6(1): 30-45 (2009) - 2008
- [j31]James G. Oxley, Charles Semple
Maintaining 3-connectivity relative to a fixed basis. Adv. Appl. Math. 41(1): 1-9 (2008) - [j30]Stefan Grünewald, Peter J. Humphries, Charles Semple:
Quartet Compatibility and the Quartet Graph. Electron. J. Comb. 15(1) (2008) - [j29]Charles Semple
Negative Correlation in Graphs and Matroids. Comb. Probab. Comput. 17(3): 423-435 (2008) - [j28]James G. Oxley, Charles Semple
Wild triangles in 3-connected matroids. J. Comb. Theory B 98(2): 291-323 (2008) - [j27]James G. Oxley, Charles Semple
A chain theorem for matroids. J. Comb. Theory B 98(3): 447-483 (2008) - [j26]Magnus Bordewich
A 3-approximation algorithm for the subtree distance between phylogenies. J. Discrete Algorithms 6(3): 458-471 (2008) - [j25]Magnus Bordewich
Nature Reserve Selection Problem: A Tight Approximation Algorithm. IEEE ACM Trans. Comput. Biol. Bioinform. 5(2): 275-280 (2008) - 2007
- [j24]Magnus Bordewich
Computing the minimum number of hybridization events for a consistent evolutionary history. Discret. Appl. Math. 155(8): 914-928 (2007) - [j23]Rhiannon Hall, James G. Oxley, Charles Semple
The structure of 3-connected matroids of path width three. Eur. J. Comb. 28(3): 964-989 (2007) - [j22]James G. Oxley, Charles Semple
The structure of the 3-separations of 3-connected matroids II. Eur. J. Comb. 28(4): 1239-1261 (2007) - [j21]Magnus Bordewich
Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. IEEE ACM Trans. Comput. Biol. Bioinform. 4(3): 458-466 (2007) - 2006
- [j20]Magnus Bordewich, Charles Semple, Mike A. Steel:
Identifying X-Trees with Few Characters. Electron. J. Comb. 13(1) (2006) - [j19]Charles Semple
Unicyclic Networks: Compatibility and Enumeration. IEEE ACM Trans. Comput. Biol. Bioinform. 3(1): 84-91 (2006) - 2005
- [j18]Rhiannon Hall, James G. Oxley, Charles Semple
The structure of equivalent 3-separations in a 3-connected matroid. Adv. Appl. Math. 35(2): 123-181 (2005) - [j17]Katharina T. Huber, Vincent Moulton
Recovering a phylogenetic tree using pairwise closure operations. Appl. Math. Lett. 18(3): 361-366 (2005) - [j16]Magnus Bordewich
Identifying phylogenetic trees. Discret. Math. 300(1-3): 30-43 (2005) - [j15]Philip Daniel, Charles Semple
A Class of General Supertree Methods for Nested Taxa. SIAM J. Discret. Math. 19(2): 463-480 (2005) - 2004
- [j14]Rhiannon Hall, James G. Oxley, Charles Semple
Fork-decompositions of matroids. Adv. Appl. Math. 32(3): 523-575 (2004) - [j13]Charles Semple
Cyclic permutations and evolutionary trees. Adv. Appl. Math. 32(4): 669-680 (2004) - [j12]Magnus Bordewich
Counting consistent phylogenetic trees is #P-complete. Adv. Appl. Math. 33(2): 416-430 (2004) - [j11]Charles Semple
Supertree algorithms for ancestral divergence dates and nested taxa. Bioinform. 20(15): 2355-2360 (2004) - [j10]Katharina T. Huber, Vincent Moulton
Replacing cliques by stars in quasi-median graphs. Discret. Appl. Math. 143(1-3): 194-203 (2004) - [j9]James G. Oxley, Charles Semple
The structure of the 3-separations of 3-connected matroids. J. Comb. Theory B 92(2): 257-293 (2004) - 2003
- [j8]Charles Semple
Reconstructing Minimal Rooted Trees. Discret. Appl. Math. 127(3): 489-503 (2003) - 2002
- [j7]Charles Semple
Tree Reconstruction from Multi-State Characters. Adv. Appl. Math. 28(2): 169-184 (2002) - [j6]James G. Oxley, Charles Semple
Infinite antichains of matroids with characteristic set {p}. Discret. Math. 242(1-3): 175-185 (2002) - [j5]Charles Semple
A characterization for a set of partial partitions to define an X-tree. Discret. Math. 247(1-3): 169-186 (2002) - [j4]Rhiannon Hall, James G. Oxley, Charles Semple
On Matroids of Branch-Width Three. J. Comb. Theory B 86(1): 148-171 (2002) - 2000
- [j3]Charles Semple
A supertree method for rooted trees. Discret. Appl. Math. 105(1-3): 147-158 (2000) - [j2]James G. Oxley, Charles Semple
Generalized Delta?-Y Exchange and k-Regular Matroids. J. Comb. Theory B 79(1): 1-65 (2000) - [c2]Charles Semple
Tree Reconstruction via a Closure Operation on Partial Splits. JOBIM 2000: 126-134
1990 – 1999
- 1999
- [j1]Charles Semple
On Maximum-sized k-Regular Matroids. Graphs Comb. 15(4): 441-462 (1999) - 1996
- [c1]Charles Semple:
k-Regular Matroids. DMTCS 1996: 376-386
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-12-11 21:41 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: