 | 2009 |
|---|
| 8 |       | Monaldo Mastrolilli,
Ola Svensson:
Improved Bounds for Flow Shop Scheduling.
ICALP (1) 2009: 677-688 |
| 2008 |
|---|
| 7 | | Monaldo Mastrolilli,
Nikolaus Mutsanas,
Ola Svensson:
Approximating Single Machine Scheduling with Scenarios.
APPROX-RANDOM 2008: 153-164 |
| 6 | | Monaldo Mastrolilli,
Ola Svensson:
(Acyclic) JobShops are Hard to Approximate.
FOCS 2008: 583-592 |
| 2007 |
|---|
| 5 | | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling.
FOCS 2007: 329-337 |
| 4 | | Christoph Ambühl,
Monaldo Mastrolilli,
Nikolaus Mutsanas,
Ola Svensson:
Scheduling with Precedence Constraints of Low Fractional Dimension.
IPCO 2007: 130-144 |
| 2006 |
|---|
| 3 | | Ola Svensson,
Sergei G. Vorobyov:
Linear Programming Polytope and Algorithm for Mean Payoff Games.
AAIM 2006: 64-78 |
| 2 | | Christoph Ambühl,
Monaldo Mastrolilli,
Ola Svensson:
Approximating Precedence-Constrained Single Machine Scheduling by Coloring.
APPROX-RANDOM 2006: 15-26 |
| 1 | | Ola Svensson,
Sergei G. Vorobyov:
Linear Complementarity and P-Matrices for Stochastic Games.
Ershov Memorial Conference 2006: 409-423 |
