View Staff Profile

Dr Magnus Bordewich, MMath, DPhil.

Personal web pages

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

Biography

I joined the Department of Computer Science at Durham University in January 2006. Prior to this I have been a post-doctoral fellow at Leeds University and the University of Canterbury, New Zealand.

My D.Phil. and undergraduate degrees were conducted at the Department of Mathematics, Oxford University, where I was in New College.

Research Groups

• Algorithms and Complexity

Research Interests

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

Publications

Conference proceedings

• Bordewich, M., Dyer, M. & Karpinski, M. (2006). Stopping times, metrics and approximate counting. 33rd International Colloquium of Automata, Languages and Programming (ICALP 2006), Venice, Italy, Springer. (Additional information) (View publication online)
• Bordewich, M., Dyer, M. & Karpinski, M. (2005). Path coupling using stopping times. 15th International Symposium Fundamentals of Computation Theory FCT 2005, Lubeck, Germany, Springer. (Additional information) (View publication online)

Journal papers: academic

• Bordewich, M., Gascuel, O., Huber, K. T. & Moulton, V. 2009. Consistency of Topological Moves Based on the Balanced Minimum Evolution Principle of Phylogenetic Inference. Transactions on Computational Biology and Bioinformatics 6(1): 110-117. (Additional information)
• Bordewich, M., Semple, C. & Spillner, A. 2009. Optimizing phylogenetic diversity across two trees. Applied Mathematics Letters 22(5): 638-641. (Additional information) (View publication online)
• Bordewich, M., McCartin, C. & Semple, C. 2008. A 3-approximation algorithm for the subtree distance between phylogenies. Journal of Discrete Algorithms 6(3): 458-471. (Additional information)
• Bordewich, M. & Semple, C. 2008. Nature Reserve Selection Problem: A Tight Approximation Algorithm. Transactions on Computational Biology and Bioinformatics 5(2): 275-280. (Additional information)
• Bordewich, M., Karpinski, M. & Dyer, M. 2008. Path Coupling Using Stopping Times and Counting Independent Sets and Colourings in Hypergraphs. Random Structures and Algorithms 32(3): 375-399. (Additional information)
• Bordewich, M., Rodrigo, A. G. & Semple, C. 2008. Selecting Taxa to Save or Sequence: Desirable Criteria and a Greedy Solution. Systematic Biology 57(6): 825-834. (Additional information) (View publication online)
• Bordewich, M., Linz, S., St. John, K. & Semple, C. 2007. A Reduction Algorithm for Computing the Hybridization Number of Two Trees. Evolutionary Bioinformatics 3: 86-98. (Additional information) (View publication online)
• Bordewich, M. & Semple, C. 2007. Computing the hybridisation number of two phylogenetic trees is fixed parameter tractable. Transactions on Computational Biology and Bioinformatics 4(3): 458-466. (Additional information)
• Bordewich, M. & Semple, C. 2007. Computing the minimum number of hybridisation events for a consistent evolutionary history. Discrete Applied Mathematics 155(8): 914-928. (Additional information)
• Bordewich, M. & Dyer, M. 2007. Path Coupling without contraction. Journal of Discrete Algorithms 5(2): 280-292. (Additional information)
• Bordewich, M., Semple, C. & Steel, M. A. 2006. Identifying X-Trees with Few Characters. Electronic Journal of Combinatorics 13(1): R83. (Additional information) (View publication online)
• Bordewich, M., Freedman, M., Lovasz, L. & Welsh, D. 2005. Approximate counting and quantum computation. Combinatorics, probability and computing 14(5-6): 737-754. (Additional information) (View publication online)
• Bordewich, M., Huber, K. & Semple, C. 2005. Identifying phylogenetic trees. Discrete Mathematics 300(1-3): 30-43. (Additional information) (View publication online)
• Bordewich, M. & Semple, C. 2005. On the computational complexity of the rooted subtree prune and regraft distance. Annals of combinatorics 8(4): 409-423. (Additional information) (View publication online)
• Bordewich, M. 2004. Approximating the number of acyclic orientations for a class of sparse graphs. Combinatorics, probability and computing 13(1): 1-16. (Additional information) (View publication online)
• Bordewich, M., Semple, C. & Talbot, J. 2004. Counting Consistent Phylogenetic Trees is #P-complete. Advances in Applied Mathematics 33(2): 416-430. (Additional information) (View publication online)

Theses: PhD

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