| Publication | Date of Publication | Type |
|---|
Quantifying the difference between phylogenetic diversity and diversity indices
Journal of Mathematical Biology | 2024-03-27 | Paper |
Approximating the Tutte polynomial
Handbook of the Tutte Polynomial and Related Topics | 2023-04-28 | Paper |
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks
Theoretical Computer Science | 2022-05-31 | Paper |
On the Maximum Agreement Subtree Conjecture for Balanced Trees
SIAM Journal on Discrete Mathematics | 2022-02-09 | Paper |
On the Complexity of Optimising Variants of Phylogenetic Diversity on Phylogenetic Networks
| 2021-07-16 | Paper |
On the information content of discrete phylogenetic characters
Journal of Mathematical Biology | 2019-03-01 | Paper |
Recovering normal networks from shortest inter-taxa distance information
Journal of Mathematical Biology | 2019-03-01 | Paper |
A universal tree-based network with the minimum number of reticulations
Discrete Applied Mathematics | 2018-10-26 | Paper |
Constructing tree-child networks from distance matrices
Algorithmica | 2018-07-25 | Paper |
Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks
Journal of Theoretical Biology | 2017-09-12 | Paper |
On the fixed parameter tractability of agreement-based phylogenetic distances
Journal of Mathematical Biology | 2017-01-25 | Paper |
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances
Discrete Applied Mathematics | 2016-09-12 | Paper |
Determining phylogenetic networks from inter-taxa distances
Journal of Mathematical Biology | 2016-08-23 | Paper |
Reticulation-visible networks
Advances in Applied Mathematics | 2016-05-11 | Paper |
Mixing of the Glauber dynamics for the ferromagnetic Potts model
Random Structures & Algorithms | 2016-02-03 | Paper |
Defining a phylogenetic tree with the minimum number of \(r\)-state characters
SIAM Journal on Discrete Mathematics | 2015-06-08 | Paper |
Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width
The Electronic Journal of Combinatorics | 2014-10-23 | Paper |
Budgeted nature reserve selection with diversity feature loss and arbitrary split systems
Journal of Mathematical Biology | 2012-02-24 | Paper |
Rapid mixing of subset Glauber dynamics on graphs of bounded tree-width
Automata, Languages and Programming | 2011-07-06 | Paper |
On the approximation complexity hierarchy
Approximation and Online Algorithms | 2011-02-15 | Paper |
Optimizing phylogenetic diversity across two trees
Applied Mathematics Letters | 2009-06-09 | Paper |
A 3-approximation algorithm for the subtree distance between phylogenies
Journal of Discrete Algorithms | 2009-05-13 | Paper |
Stopping Times, Metrics and Approximate Counting
Automata, Languages and Programming | 2009-03-12 | Paper |
Path coupling using stopping times and counting independent sets and colorings in hypergraphs
Random Structures & Algorithms | 2008-06-05 | Paper |
Path coupling without contraction
Journal of Discrete Algorithms | 2007-10-30 | Paper |
Computing the minimum number of hybridization events for a consistent evolutionary history
Discrete Applied Mathematics | 2007-05-30 | Paper |
Identifying \(X\)-trees with few characters
The Electronic Journal of Combinatorics | 2007-03-12 | Paper |
Fundamentals of Computation Theory
Lecture Notes in Computer Science | 2006-10-20 | Paper |
Approximate Counting and Quantum Computation
Combinatorics, Probability and Computing | 2005-11-14 | Paper |
Identifying phylogenetic trees
Discrete Mathematics | 2005-10-26 | Paper |
On the computational complexity of the rooted subtree prune and regraft distance
Annals of Combinatorics | 2005-02-25 | Paper |
Counting consistent phylogenetic trees is \#P-complete
Advances in Applied Mathematics | 2004-10-12 | Paper |
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs
Combinatorics, Probability and Computing | 2004-09-07 | Paper |
