| Publication | Date of Publication | Type |
|---|
| Quantifying the difference between phylogenetic diversity and diversity indices | 2024-03-27 | Paper |
| The excluded minors for the intersection of bicircular and lattice path matroids | 2024-03-26 | Paper |
| Hypercubes and Hamilton cycles of display sets of rooted phylogenetic networks | 2023-10-30 | Paper |
| The excluded minors for 2- and 3-regular matroids | 2023-09-19 | Paper |
| Excluded minors are almost fragile. II: Essential elements | 2023-09-19 | Paper |
| Cyclic Matroids | 2023-06-27 | Paper |
| A splitter theorem for elastic elements in 3-connected matroids | 2023-05-16 | Paper |
| Counting and optimising maximum phylogenetic diversity sets | 2022-08-04 | Paper |
| On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks | 2022-05-31 | Paper |
| Non-essential arcs in phylogenetic networks | 2022-05-16 | Paper |
| On the Maximum Agreement Subtree Conjecture for Balanced Trees | 2022-02-09 | Paper |
| Defining phylogenetic networks using ancestral profiles | 2021-11-08 | Paper |
| Trinets encode orchard phylogenetic networks | 2021-10-04 | Paper |
| Elastic elements in 3-connected matroids | 2021-06-21 | Paper |
| Display sets of normal and tree-child networks | 2021-01-29 | Paper |
| Optimizing phylogenetic diversity under constraints | 2020-11-05 | Paper |
| The Unbreakable Frame Matroids | 2020-10-29 | Paper |
| Caterpillars on three and four leaves are sufficient to binary normal networks | 2020-10-16 | Paper |
| Placing quantified variants of 3-SAT and \textsc{not-all-equal} 3-SAT in the polynomial hierarchy | 2020-05-23 | Paper |
| Excluded minors are almost fragile | 2020-01-15 | Paper |
| Displaying trees across two phylogenetic networks | 2019-11-13 | Paper |
| A class of phylogenetic networks reconstructable from ancestral profiles | 2019-10-10 | Paper |
| Matroids with a cyclic arrangement of circuits and cocircuits | 2019-08-30 | Paper |
| A splitter theorem for 3-connected 2-polymatroids | 2019-06-06 | Paper |
| Matroids with many small circuits and cocircuits | 2019-03-29 | Paper |
| Attaching leaves and picking cherries to characterise the hybridisation number for a set of phylogenies | 2019-03-29 | Paper |
| Tree-based networks: characterisations, metrics, and support trees | 2019-03-15 | Paper |
| On the information content of discrete phylogenetic characters | 2019-03-01 | Paper |
| Recovering normal networks from shortest inter-taxa distance information | 2019-03-01 | Paper |
| A universal tree-based network with the minimum number of reticulations | 2018-10-26 | Paper |
| When is a phylogenetic network simply an amalgamation of two trees? | 2018-10-24 | Paper |
| Quarnet inference rules for level-1 networks | 2018-09-25 | Paper |
| Constructing tree-child networks from distance matrices | 2018-07-25 | Paper |
| Locating a tree in a phylogenetic network | 2017-11-03 | Paper |
| New characterisations of tree-based networks and proximity measures | 2017-10-20 | Paper |
| Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks | 2017-09-12 | Paper |
| On the quirks of maximum parsimony and likelihood on phylogenetic networks | 2017-08-24 | Paper |
| Size of a phylogenetic network | 2017-03-15 | Paper |
| Determining phylogenetic networks from inter-taxa distances | 2016-08-23 | Paper |
| Reticulation-visible networks | 2016-05-11 | Paper |
| A Wheels-and-Whirls Theorem for $3$-Connected $2$-Polymatroids | 2016-04-04 | Paper |
| Phylogenetic networks with every embedded phylogenetic tree a base tree | 2016-03-15 | Paper |
| Determining a binary matroid from its small circuits | 2016-02-11 | Paper |
| Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters | 2015-06-08 | Paper |
| An algorithm for constructing a \(k\)-tree for a \(k\)-connected matroid | 2015-05-05 | Paper |
| Counting phylogenetic networks | 2015-05-05 | Paper |
| Phylogenetic networks that display a tree twice | 2015-01-16 | Paper |
| Representing Partitions on Trees | 2014-12-22 | Paper |
| A splitter theorem relative to a fixed basis | 2014-09-04 | Paper |
| Optimizing tree and character compatibility across several phylogenetic trees | 2014-01-13 | Paper |
| Cherry picking: a characterization of the temporal hybridization number for a set of phylogenies | 2013-11-25 | Paper |
| Counting Trees in a Phylogenetic Network Is \#P-Complete | 2013-11-14 | Paper |
| On the complexity of computing the temporal hybridization number for two phylogenies | 2013-04-25 | Paper |
| On properties of almost all matroids | 2013-01-14 | Paper |
| Constructing a 3-tree for a 3-connected matroid | 2013-01-14 | Paper |
| Bounding the maximum size of a minimal definitive set of quartets | 2012-10-23 | Paper |
| An upgraded Wheels-and-Whirls theorem for 3-connected matroids | 2012-05-11 | Paper |
| Budgeted nature reserve selection with diversity feature loss and arbitrary split systems | 2012-02-24 | Paper |
| Optimizing phylogenetic diversity with ecological constraints | 2012-01-24 | Paper |
| A cluster reduction for computing the subtree distance between phylogenies | 2012-01-24 | Paper |
| Exposing 3-separations in 3-connected matroids | 2011-10-10 | Paper |
| Quantifying the extent of lateral gene transfer required to avert a `genome of Eden' | 2010-12-15 | Paper |
| Analyzing and reconstructing reticulation networks under timing constraints | 2010-11-11 | Paper |
| Optimizing phylogenetic diversity across two trees | 2009-06-09 | Paper |
| Note on the hybridization number and subtree distance in phylogenetics | 2009-06-09 | Paper |
| A 3-approximation algorithm for the subtree distance between phylogenies | 2009-05-13 | Paper |
| Characterizing weak compatibility in terms of weighted quartets | 2009-04-14 | Paper |
| Quartet compatibility and the quartet graph | 2009-04-07 | Paper |
| Negative Correlation in Graphs and Matroids | 2008-12-11 | Paper |
| Encoding phylogenetic trees in terms of weighted quartets | 2008-08-18 | Paper |
| Maintaining 3-connectivity relative to a fixed basis | 2008-06-11 | Paper |
| A chain theorem for matroids | 2008-04-28 | Paper |
| Wild triangles in 3-connected matroids | 2008-03-14 | Paper |
| Computing the minimum number of hybridization events for a consistent evolutionary history | 2007-05-30 | Paper |
| The structure of the 3-separations of 3-connected matroids. II. | 2007-04-10 | Paper |
| The structure of 3-connected matroids of path width three | 2007-03-27 | Paper |
| Identifying \(X\)-trees with few characters | 2007-03-12 | Paper |
| A Class of General Supertree Methods for Nested Taxa | 2006-06-01 | Paper |
| The structure of equivalent 3-separations in a 3-connected matroid | 2005-11-22 | Paper |
| Identifying phylogenetic trees | 2005-10-26 | Paper |
| Bounding the number of hybridisation events for a consistent evolutionary history | 2005-09-13 | Paper |
| Recovering a phylogenetic tree using pairwise closure operations | 2005-08-01 | Paper |
| A framework for representing reticulate evolution | 2005-02-25 | Paper |
| On the computational complexity of the rooted subtree prune and regraft distance | 2005-02-25 | Paper |
| The structure of the 3-separations of 3-connected matroids | 2005-02-16 | Paper |
| Replacing cliques by stars in quasi-median graphs | 2004-11-23 | Paper |
| Counting consistent phylogenetic trees is \#P-complete | 2004-10-12 | Paper |
| Fork-decompositions of matroids | 2004-10-12 | Paper |
| Cyclic permutations and evolutionary trees | 2004-10-12 | Paper |
| Reconstructing minimal rooted trees. | 2003-06-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4792088 | 2003-02-10 | Paper |
| Generalized \(\Delta\text{--}Y\) exchange and \(k\)-regular matroids | 2002-12-10 | Paper |
| On matroids of branch-width three. | 2002-12-10 | Paper |
| Tree reconstruction from multi-state characters | 2002-09-12 | Paper |
| Infinite antichains of matroids with characteristic set \(\{ p\}\) | 2002-08-24 | Paper |
| A characterization for a set of partial partitions to define an \(X\)-tree | 2002-05-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4532074 | 2002-05-28 | Paper |
| A supertree method for rooted trees | 2001-05-21 | Paper |
| Tree representations of non-symmetric group-valued proximities | 2000-09-05 | Paper |
| On maximum-sized \(k\)-regular matroids | 2000-06-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4217609 | 1999-05-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4717857 | 1997-01-07 | Paper |
| Partial fields and matroid representation | 1996-09-01 | Paper |
