Counting consistent phylogenetic trees is #P-complete. - Magnus Bordewich; Charles Semple; John M. Talbot (Adv. Appl. Math., 2004)

Approximating the Number of Acyclic Orientations for a Class of Sparse Graphs. - Magnus Bordewich (Comb. Probab. Comput., 2004)

Path Coupling Using Stopping Times. - Magnus Bordewich; Martin E. Dyer; Marek Karpinski (FCT, 2005)

Identifying phylogenetic trees. - Magnus Bordewich; Katharina T. Huber; Charles Semple (Discret. Math., 2005)

Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs - Magnus Bordewich; Martin E. Dyer; Marek Karpinski (Electron. Colloquium Comput. Complex., 2005)

Metric Construction, Stopping Times and Path Coupling. - Magnus Bordewich; Martin E. Dyer; Marek Karpinski (Electron. Colloquium Comput. Complex., 2005)

Stopping Times, Metrics and Approximate Counting. - Magnus Bordewich; Martin E. Dyer; Marek Karpinski (ICALP (1), 2006)

Identifying X-Trees with Few Characters. - Magnus Bordewich; Charles Semple; Mike A. Steel (Electron. J. Comb., 2006)

Computing the minimum number of hybridization events for a consistent evolutionary history. - Magnus Bordewich; Charles Semple (Discret. Appl. Math., 2007)

Path coupling without contraction. - Magnus Bordewich; Martin E. Dyer (J. Discrete Algorithms, 2007)

Computing the Hybridization Number of Two Phylogenetic Trees Is Fixed-Parameter Tractable. - Magnus Bordewich; Charles Semple (IEEE ACM Trans. Comput. Biol. Bioinform., 2007)

A 3-approximation algorithm for the subtree distance between phylogenies. - Magnus Bordewich; Catherine McCartin; Charles Semple (J. Discrete Algorithms, 2008)

Path coupling using stopping times and counting independent sets and colorings in hypergraphs. - Magnus Bordewich; Martin E. Dyer; Marek Karpinski (Random Struct. Algorithms, 2008)

Nature Reserve Selection Problem: A Tight Approximation Algorithm. - Magnus Bordewich; Charles Semple (IEEE ACM Trans. Comput. Biol. Bioinform., 2008)

Optimizing phylogenetic diversity across two trees. - Magnus Bordewich; Charles Semple; Andreas Spillner 001 (Appl. Math. Lett., 2009)

Approximate Counting and Quantum Computation - Magnus Bordewich; Michael H. Freedman; László Lovász 001; D. Welsh (CoRR, 2009)

Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. - Magnus Bordewich; Olivier Gascuel; Katharina T. Huber; Vincent Moulton (IEEE ACM Trans. Comput. Biol. Bioinform., 2009)

On the Approximation Complexity Hierarchy. - Magnus Bordewich (WAOA, 2010)

Rapid Mixing of Subset Glauber Dynamics on Graphs of Bounded Tree-Width. - Magnus Bordewich; Ross J. Kang (ICALP (1), 2011)

Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution. - Magnus Bordewich; Radu Mihaescu (IEEE ACM Trans. Comput. Biol. Bioinform., 2013)

Subset Glauber Dynamics on Graphs, Hypergraphs and Matroids of Bounded Tree-Width. - Magnus Bordewich; Ross J. Kang (Electron. J. Comb., 2014)

Defining a Phylogenetic Tree with the Minimum Number of r-State Characters. - Magnus Bordewich; Charles Semple (SIAM J. Discret. Math., 2015)

Reticulation-visible networks. - Magnus Bordewich; Charles Semple (Adv. Appl. Math., 2016)

An algorithm for reconstructing ultrametric tree-child networks from inter-taxa distances. - Magnus Bordewich; Nihan Tokac (Discret. Appl. Math., 2016)

Mixing of the Glauber dynamics for the ferromagnetic Potts model. - Magnus Bordewich; Catherine S. Greenhill; Viresh Patel (Random Struct. Algorithms, 2016)

Recovering tree-child networks from shortest inter-taxa distance information. - Magnus Bordewich; Katharina T. Huber; Vincent Moulton; Charles Semple (CoRR, 2017)

Constructing Tree-Child Networks from Distance Matrices. - Magnus Bordewich; Charles Semple; Nihan Tokac (Algorithmica, 2018)

A universal tree-based network with the minimum number of reticulations. - Magnus Bordewich; Charles Semple (Discret. Appl. Math., 2018)

Region Based Anomaly Detection with Real-Time Training and Analysis. - Philip A. Adey; Oliver K. Hamilton; Magnus Bordewich; Toby P. Breckon (ICMLA, 2019)

Algorithms and Complexity in Phylogenetics (Dagstuhl Seminar 19443). - Magnus Bordewich; Britta Dorn; Simone Linz; Rolf Niedermeier (Dagstuhl Reports, 2019)

Improving Robotic Grasping on Monocular Images Via Multi-Task Learning and Positional Loss. - William Prew; Toby P. Breckon; Magnus Bordewich; Ulrik R. Beierholm (ICPR, 2020)

Autoencoders Without Reconstruction for Textural Anomaly Detection. - Philip A. Adey; Samet Akçay; Magnus Bordewich; Toby P. Breckon (IJCNN, 2021)

Evaluating Gaussian Grasp Maps for Generative Grasping Models. - William Prew; Toby P. Breckon; Magnus Bordewich; Ulrik R. Beierholm (IJCNN, 2022)

On the Maximum Agreement Subtree Conjecture for Balanced Trees. - Magnus Bordewich; Simone Linz; Megan Owen; Katherine St. John; Charles Semple; Kristina Wicke (SIAM J. Discret. Math., 2022)

On the complexity of optimising variants of phylogenetic diversity on phylogenetic networks. - Magnus Bordewich; Charles Semple; Kristina Wicke (Theor. Comput. Sci., 2022)