About me
Name: Ola Svensson
Address:IDSIA,Galleria 2
         6928 Manno-Lugano
Email: ola@idsia.ch
PhD candidate at IDSIA/USI under the supervision of Monaldo Mastrolilli and Luca Maria Gambardella. 
For more info see my CV.

Favorite quote: Lorem ipsum dolor sit amet consectetuer adipiscing.mailto:ola@idsia.chhttp://www.idsia.ch/~monaldo/http://www.idsia.ch/~luca/http://www.idsia.ch/~luca/About_Me_files/os-cvLong.pdfshapeimage_2_link_0shapeimage_2_link_1shapeimage_2_link_2shapeimage_2_link_3shapeimage_2_link_4
Selected Publications
(Acyclic) Job Shops are Hard to Approximate (FOCS’08)
Approximating Scheduling with Precedence Constraints of Low Fractional Dimension (IPCO’07) 
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence-Constrained Scheduling (FOCS’07) 
Monaldo Mastrolilli
Nikolaus Mutsanas
Ola Svensson


After finishing my master in computer science at Uppsala University in Sweden, I moved to Lugano in Switzerland where I hope to finish my PhD in 2009. 

So far, my main goal has been been to investigate the approximability of some classical scheduling problems (and related graph problems). We have improved our understanding for some of the classical problems mentioned in “Polynomial time approximation algorithms for machine scheduling: Ten open problems”, but many  questions remain to be answered. Two of my favorite ones are to understand the approximability of preemptive job shops and the approximability of scheduling on unrelated machines to minimize the makespan.


Trying to do a PhD since 2006...