We use cookies to ensure that we give you the best experience on our website. You can change your cookie settings at any time. Otherwise, we'll assume you're OK to continue.

School of Engineering and Computing Sciences (ECS)


Dr Magnus Bordewich, MMath DPhil PGCAP

Personal web page

Telephone: +44 (0) 191 33 42329
Room number: E253 (Higginson)

(email at


Personal webpage
I have been a lecturer in Computer Science at Durham University since January 2006. Prior to this I held posts as a post-doctoral fellow at the School of Computing, Leeds University and at the Department of Mathematics and Statistics at the University of Canterbury, New Zealand. My D.Phil. and undergraduate degree (MMath) were conducted at the Department of Mathematics, Oxford University.

Indicators of Esteem

  • 2015: Erskine Fellowship at University of Canterbury:

    From January to April 2015 I held an Erskine Fellowship at the University of Canterbury, Christchurch, New Zealand. During this time I worked chiefly with Prof. Charles Semple on combinatorial problems in phylogenetics.

  • 2010: 'Top cited article' award: I was awarded a “Top Cited Article 2005-2010” award from the journal Discrete Applied Mathematics, awarded by Elsevier in September 2010. Our article "Computing the minimum number of hybridization events for a consistent evolutionary history" is the 3rd most cited article published in the period 2005-2010, from a total of over 1000 (approx 270 per year), having already obtained over 65 citations listed on Google scholar.

Research Interests

  • Discrete mathematics, theoretical computer science and applications in phylogenetics.

Selected Publications

Journal Article

Chapter in book

Conference Paper

  • Bordewich, Magnus & Mihaescu, Radu (2010), Accuracy Guarantees for Phylogeny Reconstruction Algorithms Based on Balanced Minimum Evolution, in Moulton, Vincent & Singh, Mona eds, Lecture Notes in Computer Science 6293: 10th Workshop on Algorithms in Bioinformatics (WABI 2010). Liverpool, Springer, Berlin, 250-261.
  • Bordewich, Magnus (2010), On the approximation complexity hierarchy, in Jansen, Klaus & Solis-Oba, Roberto eds, Lecture Notes in Computer Science 6534: 8th International Workshop on International Workshop on Approximation and Online Algorithms, WAOA 2010. Liverpool, Springer, Berlin.
  • Bordewich, M., Dyer, M. & Karpinski, M. (2005), Path coupling using stopping times, in Liśkiewicz, Maciej & Reischuk, Rüdiger eds, Lecture notes in computer science 3623: 15th International Symposium Fundamentals of Computation Theory FCT 2005. Lübeck, Springer, Berlin, 19-31.

Conference Proceeding

Doctoral Thesis

  • Bordewich, M. (2003). The Complexity of Counting and Randomised Approximation. Department of Mathematics. New College, Oxford University. PhD.

Show all publications