Research/Scholarly/Creative Works

• Drummond G. and Semple C. (2023) A Splitter Theorem for Elastic Elements in 3-Connected Matroids. Electronic Journal of Combinatorics 30(2) http://dx.doi.org/10.37236/11399. (Journal Articles)

• Bordewich M., Linz S., Owen M., John KST., Semple C. and Wicke K. (2022) ON the MAXIMUM AGREEMENT SUBTREE CONJECTURE for BALANCED TREES. SIAM Journal on Discrete Mathematics 36(1): 336-354. http://dx.doi.org/10.1137/20M1379678. (Journal Articles)

• Bordewich M., Semple C. and Wicke K. (2022) On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. Theoretical Computer Science 917: 66-80. http://dx.doi.org/10.1016/j.tcs.2022.03.012. (Journal Articles)

• Linz S. and Semple C. (2022) Non-essential arcs in phylogenetic networks. Journal of Computer and System Sciences 128: 1-17. http://dx.doi.org/10.1016/j.jcss.2022.02.005. (Journal Articles)

• Manson K., Semple C. and Steel M. (2022) Counting and optimising maximum phylogenetic diversity sets. Journal of Mathematical Biology 85(1) http://dx.doi.org/10.1007/s00285-022-01779-3. (Journal Articles)

• Bai A., Erdős PL., Semple C. and Steel M. (2021) Defining phylogenetic networks using ancestral profiles. Mathematical Biosciences 332 http://dx.doi.org/10.1016/j.mbs.2021.108537. (Journal Articles)

• Bordewich M., Semple C. and Wicke K. (2021) On the Complexity of Optimising Variants of Phylogenetic Diversity on Phylogenetic Networks. . (Journal Articles)

• Döcker J., Linz S. and Semple C. (2021) Display sets of normal and tree-child networks. Electronic Journal of Combinatorics 28(1): 1-21. http://dx.doi.org/10.37236/9128. (Journal Articles)

• Drummond G., Jowett S., Gershkoff Z., Semple C. and Singh J. (2021) Elastic elements in 3-connected matroids. Electronic Journal of Combinatorics 28(2) http://dx.doi.org/10.37236/9919. (Journal Articles)

• Semple C. and Toft G. (2021) Trinets encode orchard phylogenetic networks. Journal of Mathematical Biology 83(3) http://dx.doi.org/10.1007/s00285-021-01654-7. (Journal Articles)

• Bordewich M., Linz S., Owen M., John KS., Semple C. and Wicke K. (2020) On the maximum agreement subtree conjecture for balanced trees. . (Journal Articles)

• Brettell N., Clark B., Oxley J., Semple C. and Whittle G. (2020) Excluded minors are almost fragile. Journal of Combinatorial Theory. Series B 140: 263-322. http://dx.doi.org/10.1016/j.jctb.2019.05.008. (Journal Articles)

• Döcker J., Dorn B., Linz S. and Semple C. (2020) Placing quantified variants of 3-SAT and NOT-ALL-EQUAL 3-SAT in the polynomial hierarchy. Theoretical Computer Science 822: 72-91. http://dx.doi.org/10.1016/j.tcs.2020.04.003. (Journal Articles)

• Fife T., Mayhew D., Oxley J. and Semple C. (2020) The unbreakable frame matroids. SIAM Journal on Discrete Mathematics 34(3): 1522-1537. http://dx.doi.org/10.1137/19M126428X. (Journal Articles)

• Linz S. and Semple C. (2020) Caterpillars on three and four leaves are sufficient to reconstruct binary normal networks. Journal of Mathematical Biology 81(4-5): 961-980. http://dx.doi.org/10.1007/s00285-020-01533-7. (Journal Articles)

• Brettell N., Chun D., Fife T. and Semple C. (2019) Matroids with a cyclic arrangement of circuits and cocircuits. European Journal of Combinatorics 81: 195-209. http://dx.doi.org/10.1016/j.ejc.2019.06.002. (Journal Articles)

• Döcker J., Linz S. and Semple C. (2019) Displaying trees across two phylogenetic networks. Theoretical Computer Science 796: 129-146. http://dx.doi.org/10.1016/j.tcs.2019.09.003. (Journal Articles)

• Erdős PL., Semple C. and Steel M. (2019) A class of phylogenetic networks reconstructable from ancestral profiles. Mathematical Biosciences 313: 33-40. http://dx.doi.org/10.1016/j.mbs.2019.04.009. (Journal Articles)

• Linz S. and Semple C. (2019) Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies. Advances in Applied Mathematics 105: 102-129. http://dx.doi.org/10.1016/j.aam.2019.01.004. (Journal Articles)

• Oxley J., Pfeil S., Semple C. and Whittle G. (2019) Matroids with many small circuits and cocircuits. Advances in Applied Mathematics 105: 1-24. http://dx.doi.org/10.1016/j.aam.2018.12.005. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2019) A splitter theorem for 3-connected 2-polymatroids. Electronic Journal of Combinatorics 26(2): 1-95. http://dx.doi.org/10.37236/7308. (Journal Articles)

• Pons JC., Semple C. and Steel M. (2019) Tree-based networks: characterisations, metrics, and support trees. Journal of Mathematical Biology 78(4): 899-918. http://dx.doi.org/10.1007/s00285-018-1296-9. (Journal Articles)

• Bordewich M. and Semple C. (2018) A universal tree-based network with the minimum number of reticulations. Discrete Applied Mathematics 250: 357-362. http://dx.doi.org/10.1016/j.dam.2018.05.010. (Journal Articles)

• Bordewich M., Deutschmann IM., Fischer M., Kasbohm E., Semple C. and Steel M. (2018) On the information content of discrete phylogenetic characters. Journal of Mathematical Biology 77(3): 527-544. http://dx.doi.org/10.1007/s00285-017-1198-2. (Journal Articles)

• Bordewich M., Huber KT., Moulton V. and Semple C. (2018) Recovering normal networks from shortest inter-taxa distance information. Journal of Mathematical Biology 77(3): 571-594. http://dx.doi.org/10.1007/s00285-018-1218-x. (Journal Articles)

• Bordewich M., Semple C. and Tokac N. (2018) Constructing Tree-Child Networks from Distance Matrices. Algorithmica 80(8): 2240-2259. http://dx.doi.org/10.1007/s00453-017-0320-6. (Journal Articles)

• Francis A., Semple C. and Steel M. (2018) New characterisations of tree-based networks and proximity measures. Advances in Applied Mathematics 93: 93-107. http://dx.doi.org/10.1016/j.aam.2017.08.003. (Journal Articles)

• Huber KT., Moulton V., Semple C. and Wu T. (2018) Quarnet Inference Rules for Level-1 Networks. Bulletin of Mathematical Biology 80(8): 2137-2153. http://dx.doi.org/10.1007/s11538-018-0450-2. (Journal Articles)

• Semple C. and Simpson J. (2018) When is a Phylogenetic Network Simply an Amalgamation of Two Trees? Bulletin of Mathematical Biology 80(9): 2338-2348. http://dx.doi.org/10.1007/s11538-018-0463-x. (Journal Articles)

• Bordewich M., Linz S. and Semple C. (2017) Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks. Journal of Theoretical Biology 423: 1-12. http://dx.doi.org/10.1016/j.jtbi.2017.03.032. (Journal Articles)

• Bryant C., Fischer M., Linz S. and Semple C. (2017) On the quirks of maximum parsimony and likelihood on phylogenetic networks. Journal of Theoretical Biology 417: 100-108. http://dx.doi.org/10.1016/j.jtbi.2017.01.013. (Journal Articles)

• Semple C. (2017) Size of a phylogenetic network. Discrete Applied Mathematics 217: 362-367. http://dx.doi.org/10.1016/j.dam.2016.09.004. (Journal Articles)

• Bordewich M. and Semple C. (2016) Determining phylogenetic networks from inter-taxa distances. Journal of Mathematical Biology 73(2): 283-303. http://dx.doi.org/10.1007/s00285-015-0950-8. (Journal Articles)

• Bordewich M. and Semple C. (2016) Reticulation-visible networks. Advances in Applied Mathematics 78: 114-141. http://dx.doi.org/10.1016/j.aam.2016.04.004. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2016) A wheels-and-whirls theorem for 3-connected 2-polymatroids. SIAM Journal on Discrete Mathematics 30(1): 493-524. http://dx.doi.org/10.1137/140996549. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2016) Determining a binary matroid from its small circuits. Electronic Journal of Combinatorics 23(1). (Journal Articles)

• Semple C. (2016) Phylogenetic Networks with Every Embedded Phylogenetic Tree a Base Tree. Bulletin of Mathematical Biology 78(1): 132-137. http://dx.doi.org/10.1007/s11538-015-0132-2. (Journal Articles)

• Bordewich M. and Semple C. (2015) Defining a phylogenetic tree with the minimum number of r-state characters. SIAM Journal on Discrete Mathematics 29(2): 835-853. http://dx.doi.org/10.1137/130924469. (Journal Articles)

• Brettell N. and Semple C. (2015) An algorithm for constructing a k-tree for a k-connected matroid. Annals of Combinatorics 19(1): 29-78. http://dx.doi.org/10.1007/s00026-015-0258-9. (Journal Articles)

• McDiarmid C., Semple C. and Welsh D. (2015) Counting phylogenetic networks. Annals of Combinatorics 19(1): 205-224. http://dx.doi.org/10.1007/s00026-015-0260-2. (Journal Articles)

• Semple C., Welsh D. and Whittle G. (2015) Special issue in honour of James Oxley. Annals of Combinatorics 19(1): 1-5. http://dx.doi.org/10.1007/s00026-015-0262-0. [Editorial]. (Other)

• Brettell N. and Semple C. (2014) A splitter theorem relative to a fixed basis. Annals of Combinatorics 18: 1-20. http://dx.doi.org/10.1007/s00026-013-0208-3. (Journal Articles)

• Cordue P., Linz S. and Semple C. (2014) Phylogenetic networks that display a tree twice. Bulletin of Mathematical Biology 76(10): 2664-2679. http://dx.doi.org/10.1007/s11538-014-0032-x. (Journal Articles)

• Huber KT., Moulton V., Semple C. and Wu T. (2014) Representing partitions on trees. SIAM Journal on Discrete Mathematics 28(3): 1152-1172. http://dx.doi.org/10.1137/130906192. (Journal Articles)

• Berry V., Bininda-Emonds ORP. and Semple C. (2013) Amalgamating source trees with different taxonomic levels. Systematic Biology 62(2): 231-249. http://dx.doi.org/10.1093/sysbio/sys090. (Journal Articles)

• Humphries PJ., Linz S. and Semple C. (2013) Cherry picking: A characterization of the temporal hybridization number for a set of phylogenies. Bulletin of Mathematical Biology 75: 1879-1890. http://dx.doi.org/10.1007/s11538-013-9874-x. (Journal Articles)

• Humphries PJ., Linz S. and Semple C. (2013) On the complexity of computing the temporal hybridization number for two phylogenies. Discrete Applied Mathematics 161(7-8): 871-880. http://dx.doi.org/10.1016/j.dam.2012.11.022. (Journal Articles)

• Linz S., St John K. and Semple C. (2013) Counting trees in a phylogenetic network is #P-complete. SIAM Journal on Computing 42(4): 1768-1776. http://dx.doi.org/10.1137/12089394X. (Journal Articles)

• Linz S., St John K. and Semple C. (2013) Optimizing tree and character compatibility across several phylogenetic trees. Theoretical Computer Science 513: 129-136. http://dx.doi.org/10.1016/j.tcs.2013.10.015. (Journal Articles)

• Lowrance L., Oxley J., Semple C. and Welsh D. (2013) On properties of almost all matroids. Advances in Applied Mathematics 50(1): 115-124. http://dx.doi.org/10.1016/j.aam.2011.07.005. (Journal Articles)

• Mayhew D., Oxley J. and Semple C. (2013) Special issue in honour of Geoff Whittle. Advances in Applied Mathematics 50: 1-5. http://dx.doi.org/10.1016/j.aam.2012.08.006. (Journal Articles)

• Oxley J. and Semple C. (2013) Constructing a 3-tree for a 3-connected matroid. Advances in Applied Mathematics 50(1): 176-200. http://dx.doi.org/10.1016/j.aam.2011.09.007. (Journal Articles)

• Bordewich M. and Semple C. (2012) Budgeted Nature Reserve Selection with diversity feature loss and arbitrary split systems. Journal of Mathematical Biology 64: 69-85. http://dx.doi.org/10.1007/s00285-011-0405-9. (Journal Articles)

• Dietrich M., McCartin C. and Semple C. (2012) Bounding the maximum size of a minimal definitive set of quartets. Information Processing Letters 112(16): 651-655. http://dx.doi.org/10.1016/j.ipl.2012.06.001. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2012) An upgraded Wheels-and-Whirls Theorem for 3-connected matroids. Journal of Combinatorial Theory, Series B 102(3): 610-637. http://dx.doi.org/10.1016/j.jctb.2011.09.005. (Journal Articles)

• Collins J., Linz S. and Semple C. (2011) Quantifying hybridization in realistic time. Journal of Computational Biology 18(10): 1305-1318. http://dx.doi.org/10.1089/cmb.2009.0166. (Journal Articles)

• Faller B., Semple C. and Welsh D. (2011) Optimizing phylogenetic diversity with ecological constraints. Annals of Combinatorics 15(2): 255-266. http://dx.doi.org/10.1007/s00026-011-0093-6. (Journal Articles)

• Linz S. and Semple C. (2011) A cluster reduction for computing the subtree distance between phylogenies. Annals of Combinatorics 15(3): 465-484. http://dx.doi.org/10.1007/s00026-011-0108-3. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2011) Exposing 3-separations in 3-connected matroids. Advances in Applied Mathematics 47(3): 463-508. http://dx.doi.org/10.1016/j.aam.2010.10.009. (Journal Articles)

• Linz S., Semple C. and Stadler T. (2010) Analyzing and reconstructing reticulation networks under timing constraints. Journal of Mathematical Biology 61(5): 715-737. http://dx.doi.org/10.1007/s00285-009-0319-y. (Journal Articles)

• van Iersel L., Semple C. and Steel M. (2010) Locating a tree in a phylogenetic network. Information Processing Letters 110(23): 1037-1043. http://dx.doi.org/10.1016/j.ipl.2010.07.027. (Journal Articles)

• van Iersel L., Semple C. and Steel M. (2010) Quantifying the Extent of Lateral Gene Transfer Required to Avert a 'Genome of Eden'. Bulletin of Mathematical Biology 72(7): 1783-1798. http://dx.doi.org/10.1007/s11538-010-9506-7. (Journal Articles)

• Bordewich M., Semple C. and Spillner A. (2009) Optimizing phylogenetic diversity across two trees. Applied Mathematics Letters 22(5): 638-641. http://dx.doi.org/10.1016/j.aml.2008.05.004. (Journal Articles)

• Grunewald S., Huber KT., Moulton V., Semple C. and Spillner A. (2009) Characterizing weak compatibility in terms of weighted quartets. Advances in Applied Mathematics 42(3): 329-341. http://dx.doi.org/10.1016/j.aam.2008.07.002. (Journal Articles)

• Humphries PJ. and Semple C. (2009) Note on the hybridization number and subtree distance in phylogenetics. Applied Mathematics Letters 22(4): 611-615. http://dx.doi.org/10.1016/j.aml.2008.08.018. (Journal Articles)

• Linz L. and Semple C. (2009) Hybridization in Nonbinary Trees. IEEE/ACM Transactions on Computational Biology and Bioinformatics 6(1): 30-45. http://dx.doi.org/10.1109/TCBB.2008.86. (Journal Articles)

• Semple C. and Steel M. (2009) Mathematical Aspects of the 'Tree of Life'. Math Horizons 16(3): 5-9. (Journal Articles)

• Bordewich M. and Semple C. (2008) Nature reserve selection problem: a tight approximation algorithm. IEEE/ACM Transactions on Computational Biology and Bioinformatics 5(2): 275-280. http://dx.doi.org/10.1109/TCBB.2007.70252. (Journal Articles)

• Bordewich M., McCartin C. and Semple C. (2008) A 3-approximation algorithm for the subtree distance between phylogenies. Journal of Discrete Algorithms 6(3): 458-471. http://dx.doi.org/10.1016/j.jda.2007.10.002. (Journal Articles)

• Bordewich M., Rodrigo AG. and Semple C. (2008) Selecting taxa to save or sequence: desirable criteria and a greedy solution. Systematic Biology 57(6): 825-834. http://dx.doi.org/10.1080/10635150802552831. (Journal Articles)

• Grunewald S., Huber KT., Moulton V. and Semple C. (2008) Encoding phylogenetic trees in terms of weighted quartets. Journal of Mathematical Biology 56(4): 465-477. http://dx.doi.org/10.1007/s00285-007-0125-3. (Journal Articles)

• Grunewald S., Humphries PJ. and Semple C. (2008) Quartet compatibility and the quartet graph. Electronic Journal of Combinatorics 15(1) R103. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2008) A chain theorem for matroids. Journal of Combinatorial Theory Series B 98(3): 447-483. http://dx.doi.org/10.1016/j.jctb.2007.08.005. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2008) Maintaining 3-connectivity relative to a fixed basis. Advances in Applied Mathematics 41(1): 1-9. http://dx.doi.org/10.1016/j.aam.2007.05.001. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2008) Wild triangles in 3-connected matroids. Journal of Combinatorial Theory Series B 98(2): 291-323. http://dx.doi.org/10.1016/j.jctb.2007.06.004. (Journal Articles)

• Semple C. and Welsh D. (2008) Negative correlation in graphs and matroids. Combinatorics Probability and Computing 17(3): 423-435. http://dx.doi.org/10.1017/S0963548307008978. (Journal Articles)

• Bordewich M. and Semple C. (2007) Computing the Hybridization Number of Two Phylogenetic Trees is Fixed-Parameter Tractable. IEEE/ACM Transactions on Computational Biology and Bioinformatics 4(3): 458-466. http://dx.doi.org/10.1109/tcbb.2007.1019. (Journal Articles)

• Bordewich M. and Semple C. (2007) Computing the minimum number of hybridization events for a consistent evolutionary history. Discrete Applied Mathematics 155(8): 914-928. http://dx.doi.org/10.1016/j.dam.2006.08.008. (Journal Articles)

• Bordewich., M., Linz., S., John S., K., Semple. and C. (2007) A Reduction Algorithm for Computing the Hybridization Number of Two Trees. Evolutionary Bioinformatics 3: 86-98. (Journal Articles)

• Hall R., Oxley J. and Semple C. (2007) The structure of 3-connected matroids of path-width three. European Journal of Combinatorics 28(3): 964-989. http://dx.doi.org/10.1016/j.ejc.2005.10.005. (Journal Articles)

• Moulton V., Semple C. and Steel M. (2007) Optimizing phylogenetic diversity under constraints. Journal of Theoretical Biology 246(1): 186-194. http://dx.doi.org/10.1016/j.jtbi.2006.12.021. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2007) The structure of the 3-separations of 3-connected matroids II. European Journal of Combinatorics 28(4): 1239-1261. http://dx.doi.org/10.1016/j.ejc.2006.01.007. (Journal Articles)

• Semple C. (2007) Hybridization networks. In Gascuel O; Steel M (Ed.), Reconstructing Evolution: New Mathematical and Computational Advances: 277-314. Oxford: Oxford University Press. (Chapters)

• Baroni M., Semple C. and Steel M. (2006) Hybrids in real time. SYSTEMATIC BIOLOGY 55(1): 46-56. http://dx.doi.org/10.1080/106351500500431197. (Journal Articles)

• Baroni M., Semple C. and Steel M. (2006) Hybrids in Real Time. Systematic Biology 55(1): 46-56. http://dx.doi.org/10.1080/10635150500431197. (Journal Articles)

• Berry V. and Semple C. (2006) Fast Computation of Supertrees for Compatible Phylogenies with Nested Taxa. Systematic Biology 55(2): 270-288. http://dx.doi.org/10.1080/10635150500541649. (Journal Articles)

• Bordewich M., Evans G. and Semple C. (2006) Extending the limits of supertree methods. Annals of Combinatorics 10(1): 31-51. http://dx.doi.org/10.1007/s00026-006-0272-z. (Journal Articles)

• Bordewich M., Semple C. and Steel M. (2006) Identifying X-trees with few characters. The Electronic Journal of Combinatorics 13 R83. (Journal Articles)

• Semple C. and Steel M. (2006) Unicyclic Networks: Compatibility and Enumeration. IEEE/ACM Transactions on Computational Biology and Bioinformatics 3(1): 84-91. http://dx.doi.org/10.1109/TCBB.2006.14. (Journal Articles)

• Baroni M., Grünewald S., Moulton V. and Semple C. (2005) Bounding the Number of Hybridisation Events for a Consistent Evolutionary History. Journal of Mathematical Biology 51(2): 171-182. (Journal Articles)

• Baroni M., Semple C. and Steel M. (2005) A Framework for Representing Reticulate Evolution. Annals of Combinatorics 8(4): 391-408. (Journal Articles)

• Bordewich M., Huber KT. and Semple C. (2005) Identifying phylogenetic trees. Discrete Mathematics 300: 30-43. (Journal Articles)

• Daniel P. and Semple C. (2005) A Class of General Supertree Methods for Nested Taxa. SIAM Journal on Discrete Mathematics 19(2): 463-480. http://dx.doi.org/10.1137/S0895480104441462. (Journal Articles)

• Hall R., Oxley J. and Semple C. (2005) The structure of equivalent 3-separations in a 3-connected matroid. Advances in Applied Mathematics 35: 123-181. (Journal Articles)

• Huber KT., Moulton V., Semple C. and Steel M. (2005) Recovering a phylogenetic tree using pairwise closure operations. Applied Mathematics Letters 18: 361-366. (Journal Articles)

• Bordewich M. and Semple C. (2004) On the Computational Complexity of the Rooted Subtree Prune and Regraft Distance. Annals of Combinatorics 8(4): 409-423. (Journal Articles)

• Bordewich M., Semple C. and Talbot J. (2004) Counting consistent phylogenetic trees is #P-complete. Advances in Applied Mathematics 33: 416-430. (Journal Articles)

• Bryant D., Semple C. and Steel M. (2004) Supertree methods for ancestral divergence dates and other applications. In Bininda-Emonds ORP (Ed.), Computational Biology, Vol. 4: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life: 129-150. Dordrecht: Kluwer. (Chapters)

• Daniel P. and Semple C. (2004) Supertree algorithms for nested taxa. In Bininda-Emonds ORP (Ed.), Computational Biology, Vol. 4: Phylogenetic Supertrees: Combining Information to Reveal the Tree of Life: 151-171. Dordrecht: Kluwer. (Chapters)

• Hall R., Oxley J., Semple C. and Whittle G. (2004) Fork-decompositions of matroids. Advances in Applied Mathematics 32: 523-575. (Journal Articles)

• Huber KT., Moulton V. and Semple C. (2004) Replacing cliques by stars in quasi-median graphs. Discrete Applied Mathematics 143(1-3): 194-203. (Journal Articles)

• Oxley J., Semple C. and Whittle G. (2004) The structure of the 3-separations of 3-connected matroids. Journal of Combinatorial Theory, Series B 92(2): 257-293. (Journal Articles)

• Semple C. and Steel M. (2004) Cyclic permutations and evolutionary trees. Advances in Applied Mathematics 32: 669-680. (Journal Articles)

• Semple C., Daniel P., Hordijk W., Page RDM. and Steel M. (2004) Supertree algorithms for ancestral divergence dates and nested taxa. Bioinformatics 20(15): 2355-2360. (Journal Articles)

• Semple C. (2003) Reconstructing minimal rooted trees. Discrete Applied Mathematics 127(3): 489-503. (Journal Articles)

• Semple C. and Steel M. (2003) Phylogenetics. Oxford: Oxford University Press. 256pp. (Authored Books)

• Hall R., Oxley J., Semple C. and Whittle G. (2002) On matroids of branch-width three. Journal of Combinatorial Theory, Series B 86: 148-171. (Journal Articles)

• Oxley J., Semple C., Vertigan D. and Whittle G. (2002) Infinite anitchains of matroids with characteristics set {p}. Discrete Mathematics 242: 175-185. (Journal Articles)

• Semple C. and Steel M. (2002) A characterization for a set of partial partitions to define an X-tree. Discrete Mathematics 247: 169-186. (Journal Articles)

• Semple C. and Steel M. (2002) Tree reconstruction from multi-state characters. Advances in Applied Mathematics 28: 169-184. (Journal Articles)

• Semple C. and Steel M. (2001) Tree reconstruction via a closure operation on partial splits. In Computational Biology: Selected papers of the First International Conference on Biology, Informatics, and Mathematics: 126-134. (Conference Contributions - Published)

• Oxley J., Semple C. and Vertigan D. (2000) Generalized Δ-Y Exchange and k-Regular Matroids. Journal of Combinatorial Theory, Series B 79: 1-65. (Journal Articles)

• Semple C. and Steel M. (2000) A supertree method for rooted trees. Discrete Applied Mathematics 105: 147-158. (Journal Articles)

• Semple C. (1999) On maximum-sized k-regular matroids. Graphs and Combinatorics 15: 441-462. (Journal Articles)

• Semple C. and Steel M. (1999) Tree representations of non-symmetric, group-valued proximities. Advances in Applied Mathematics 23: 300-321. (Journal Articles)

• Semple C. (1998) k-Regular Matroids. Wellington, New Zealand. Victoria University of Wellington. (Theses / Dissertations)

• Semple C. (1997) k-regular matroids. In : 376-386. (Conference Contributions - Published)

• Semple C. and Whittle G. (1996) Partial fields and matroid representation. Advances in Applied Mathematics 17: 184-208. (Journal Articles)

• Semple C. and Whittle G. (1996) On representable matroids having neither U(2,5)- nor U(3,5)-minors. In Bonin JE; Oxley JG; Servatius B (Ed.), Matroid Theory: 377-386. Providence: American Mathematical Society. (Chapters)