Magnus Bordewich

Papers

Total Citations

H-Index

About

Magnus Bordewich is a leading researcher in algorithmic graph theory and computational complexity, with a particular focus on the mathematics of evolution and phylogenetic networks. His most influential work centers on the development of efficient algorithms for reconstructing evolutionary trees and networks from biological data, as well as establishing the computational hardness of key problems in phylogenetics. Bordewich has made foundational contributions to understanding the complexity of phylogenetic inference, including proving that many common tree reconstruction problems are NP-hard, while also designing polynomial-time algorithms for restricted cases. His work on Markov chain Monte Carlo methods for phylogenetic trees has been highly cited, with several papers accumulating over 100 citations each. Notably, his research on the "hybridization number" problem—determining the minimum number of reticulate events needed to explain conflicting evolutionary signals—has become a cornerstone in the study of phylogenetic networks. Bordewich's contributions have been recognized through his role as a professor at Durham University, where he continues to shape the field through both theoretical advances and practical algorithmic tools.