Magnus Bordewich

From MaRDI portal
Person:281903

Available identifiers

zbMath Open bordewich.magnusDBLP29/3552WikidataQ56636230 ScholiaQ56636230MaRDI QIDQ281903

List of research outcomes





PublicationDate of PublicationType
Quantifying the difference between phylogenetic diversity and diversity indices2024-03-27Paper
Approximating the Tutte polynomial2023-04-28Paper
On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks2022-05-31Paper
On the Maximum Agreement Subtree Conjecture for Balanced Trees2022-02-09Paper
On the Complexity of Optimising Variants of Phylogenetic Diversity on Phylogenetic Networks2021-07-16Paper
On the information content of discrete phylogenetic characters2019-03-01Paper
Recovering normal networks from shortest inter-taxa distance information2019-03-01Paper
A universal tree-based network with the minimum number of reticulations2018-10-26Paper
Constructing tree-child networks from distance matrices2018-07-25Paper
Lost in space? Generalising subtree prune and regraft to spaces of phylogenetic networks2017-09-12Paper
On the fixed parameter tractability of agreement-based phylogenetic distances2017-01-25Paper
An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances2016-09-12Paper
Determining phylogenetic networks from inter-taxa distances2016-08-23Paper
Reticulation-visible networks2016-05-11Paper
Mixing of the Glauber dynamics for the ferromagnetic Potts model2016-02-03Paper
Defining a Phylogenetic Tree with the Minimum Number of $r$-State Characters2015-06-08Paper
Subset Glauber dynamics on graphs, hypergraphs and matroids of bounded tree-width2014-10-23Paper
Budgeted nature reserve selection with diversity feature loss and arbitrary split systems2012-02-24Paper
Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width2011-07-06Paper
On the Approximation Complexity Hierarchy2011-02-15Paper
Optimizing phylogenetic diversity across two trees2009-06-09Paper
A 3-approximation algorithm for the subtree distance between phylogenies2009-05-13Paper
Stopping Times, Metrics and Approximate Counting2009-03-12Paper
Path coupling using stopping times and counting independent sets and colorings in hypergraphs2008-06-05Paper
Path coupling without contraction2007-10-30Paper
Computing the minimum number of hybridization events for a consistent evolutionary history2007-05-30Paper
Identifying \(X\)-trees with few characters2007-03-12Paper
Fundamentals of Computation Theory2006-10-20Paper
Approximate Counting and Quantum Computation2005-11-14Paper
Identifying phylogenetic trees2005-10-26Paper
On the computational complexity of the rooted subtree prune and regraft distance2005-02-25Paper
Counting consistent phylogenetic trees is \#P-complete2004-10-12Paper
Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs2004-09-07Paper

Research outcomes over time

This page was built for person: Magnus Bordewich