Posted on 13/05/2013
Dr Magnus Wahlström
Dr. Magnus Wahlström began a lectureship at RHUL in April 2013. He obtained a PhD in Computer Science in 2007 from Linköping University, Sweden, and held a position as post-doctoral researcher at the Max Planck Institute for Computer Science, Saarbrücken, Germany from 2007 to 2013.
Magnus works in various areas of theoretical computer science, primarily in approaches to dealing with (NP-)hard problems, including parameterized complexity and combinatorial optimization. He regularly publishes in leading conferences in the field, and has recently been exploring connections of graph theory to algebraic methods and matroid theory.
On the more applied side, he has also done algorithm engineering work on optimisation problems, and worked on problems related to low-discrepancy pointsets (which occur in numerical integration), in particular on software packages for discrepancy estimation.