Skip to main content
Overview
Affiliations
AffiliationRoom numberTelephone
Professor in the Department of Computer ScienceMCS 2007+44 (0) 191 33 42329
Member of the Centre for Communications Systems  

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 interests

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

Research groups

  • Algorithms and Complexity

Awarded Grants

  • 2010: Approximation and mixing times in the ferromagneti(£250380.00 from Epsrc)
  • 2006: RANDOMISED ALGORITHMS AND APPROXIMATION(£222248.00 from Epsrc)

Esteem Indicators

  • 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.

Publications

Chapter in book

Conference Paper

Conference Proceeding

Doctoral Thesis

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

Journal Article

Supervision students