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.