Cookies

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.

Durham University

Email and Telephone Directory

Staff Profile

Professor Magnus Bordewich, MMath DPhil PGCAP

Personal web page

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

(email at m.j.r.bordewich@durham.ac.uk)

Biography

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.

Research Groups

Department of Computer Science

  • Algorithms and Complexity

Research Interests

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

Selected Publications

Chapter in book

Journal Article

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

Supervises