Ola Svensson received his M.Sc. degree in Computer Science from the University of Uppsala in May 2005. His major was on theoretical aspects of computer science and in particular algorithms. Ola received his PhD from IDSIA affiliated to the University of Lugano in 2009 for which he worked on approximation algorithms and inapproximability results for combinatorial optimization problems.
Research interests include: approximation algorithms, combinatorial optimization, computational complexity and scheduling.