Magnus Bordewich

  • Durham University, UK

According to our database1, Magnus Bordewich authored at least 35 papers between 2004 and 2022.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.



In proceedings 
PhD thesis 


Online presence:



On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks.
Theor. Comput. Sci., 2022

On the Maximum Agreement Subtree Conjecture for Balanced Trees.
SIAM J. Discret. Math., 2022

Evaluating Gaussian Grasp Maps for Generative Grasping Models.
Proceedings of the International Joint Conference on Neural Networks, 2022

Autoencoders Without Reconstruction for Textural Anomaly Detection.
Proceedings of the International Joint Conference on Neural Networks, 2021

Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss.
Proceedings of the 25th International Conference on Pattern Recognition, 2020

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443).
Dagstuhl Reports, 2019

Region Based Anomaly Detection with Real-Time Training and Analysis.
Proceedings of the 18th IEEE International Conference On Machine Learning And Applications, 2019

A universal tree-based network with the minimum number of reticulations.
Discret. Appl. Math., 2018

Constructing Tree-Child Networks from Distance Matrices.
Algorithmica, 2018

Recovering tree-child networks from shortest inter-taxa distance information.
CoRR, 2017

Mixing of the Glauber dynamics for the ferromagnetic Potts model.
Random Struct. Algorithms, 2016

An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances.
Discret. Appl. Math., 2016

Reticulation-visible networks.
Adv. Appl. Math., 2016

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters.
SIAM J. Discret. Math., 2015

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width.
Electron. J. Comb., 2014

Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution.
IEEE ACM Trans. Comput. Biol. Bioinform., 2013

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width.
Proceedings of the Automata, Languages and Programming - 38th International Colloquium, 2011

On the Approximation Complexity Hierarchy.
Proceedings of the Approximation and Online Algorithms - 8th International Workshop, 2010

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference.
IEEE ACM Trans. Comput. Biol. Bioinform., 2009

Approximate Counting and Quantum Computation
CoRR, 2009

Optimizing phylogenetic diversity across two trees.
Appl. Math. Lett., 2009

Nature Reserve Selection Problem: A Tight Approximation Algorithm.
IEEE ACM Trans. Comput. Biol. Bioinform., 2008

Path coupling using stopping times and counting independent sets and colorings in hypergraphs.
Random Struct. Algorithms, 2008

A 3-approximation algorithm for the subtree distance between phylogenies.
J. Discrete Algorithms, 2008

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable.
IEEE ACM Trans. Comput. Biol. Bioinform., 2007

Path coupling without contraction.
J. Discrete Algorithms, 2007

Computing the minimum number of hybridization events for a consistent evolutionary history.
Discret. Appl. Math., 2007

Identifying X-Trees with Few Characters.
Electron. J. Comb., 2006

Stopping Times, Metrics and Approximate Counting.
Proceedings of the Automata, Languages and Programming, 33rd International Colloquium, 2006

Metric Construction, Stopping Times and Path Coupling.
Electron. Colloquium Comput. Complex., 2005

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs
Electron. Colloquium Comput. Complex., 2005

Identifying phylogenetic trees.
Discret. Math., 2005

Path Coupling Using Stopping Times.
Proceedings of the Fundamentals of Computation Theory, 15th International Symposium, 2005

Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs.
Comb. Probab. Comput., 2004

Counting consistent phylogenetic trees is #P-complete.
Adv. Appl. Math., 2004