Ola Svensson is a faculty member at the School of Computer and Communication Sciences at EPFL. He is interested in fundamental questions in combinatorial optimization related to the approximability of basic optimization problems, such as clustering, scheduling, and network design problems. His work on the traveling salesman problem received the best paper award at FOCS'11.
- Bridging Continuous and Discrete Optimization, Fall 2017. Visiting Scientist.