Ola Svensson

Approximation Algorithms and Hardness (Work during my PHD)
Improved Bounds for Flow Shop Scheduling (pdf) Monaldo Mastrolilli, Ola Svensson Submitted, 2009.
(Acyclic) Job Shops are Hard to Approximate (pdf) Monaldo Mastrolilli, Ola Svensson To appear in IEEE Symposium on Foundations of Computer Science (FOCS), 2008.
Approximating Single Machine Scheduling with Scenarios (pdf) Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson. To appear in proceedings of Approximation Algorithms for Combinatorial Optimization Problems (APPROX), 2008.
Approximating Scheduling with Precedence Constraints of Low Fractional Dimension (pdf) Christoph Ambuhl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson In proceedings of Integer Programming and Combinatorial Optimization (IPCO), pages 130-144, 2007.
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence-Constrained Scheduling (pdf) Christoph Ambuhl, Monaldo Mastrolilli, Ola Svensson. In proceedings of IEEE Symposium on Foundations of Computer Science (FOCS), pages 329-337, 2007.
Approximating Precedence-Constrained Scheduling by Coloring (pdf) Christoph Ambuhl, Monaldo Mastrolilli, Ola Svensson. In proceedings of Approximation Algorithms for Combinatorial Optimization Problems (APPROX), pages 15-26, 2006.

Algorithms for Games (Work during my MasteR)
Mean Payoff Games and Linear Complementarity(*) Ola Svensson In proceedings of ESSLI, 2005. Rewarded best poster award.
Linear Complementarity and P-matrices for Stochastic Games(*) Ola Svensson, Sergei Vorobyov In proceedings of PSI, LNCS 4378, pages 408-421, 2006.
Linear Programming Polytope and Algorithm for Mean Payoff Games(*) Ola Svensson, Sergei Vorobyov In proceedings of AAIM, LNCS 4041, pages 64-78, 2006.
(*) These papers miss references to
The thesis “Discrete and Lexicographic Helly Theorems and Their Relations to LP-type problems” by Nir Halman, where he obtains strongly randomized subexponential time algorithms for parity games, mean payoff games, and simple stochastic games.
The paper “Simple Stochastic Games and P-matrix Generalized Linear Complementarity Problems” by Bernd Gartner and Leo Ruest. In this paper they independently (and by using a different reduction than us) proved that simple stochastic games reduces to P-matrix GLCP.