The SCEAS System
Navigation Menu

Search the dblp DataBase


Ola Svensson: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Ola Svensson, Sergei G. Vorobyov
    Linear Programming Polytope and Algorithm for Mean Payoff Games. [Citation Graph (0, 0)][DBLP]
    AAIM, 2006, pp:64-78 [Conf]
  2. Christoph Ambühl, Monaldo Mastrolilli, Ola Svensson
    Approximating Precedence-Constrained Single Machine Scheduling by Coloring. [Citation Graph (0, 0)][DBLP]
    APPROX-RANDOM, 2006, pp:15-26 [Conf]
  3. Ola Svensson, Sergei G. Vorobyov
    Linear Complementarity and P-Matrices for Stochastic Games. [Citation Graph (0, 0)][DBLP]
    Ershov Memorial Conference, 2006, pp:409-423 [Conf]
  4. Christoph Ambühl, Monaldo Mastrolilli, Nikolaus Mutsanas, Ola Svensson
    Scheduling with Precedence Constraints of Low Fractional Dimension. [Citation Graph (0, 0)][DBLP]
    IPCO, 2007, pp:130-144 [Conf]

  5. Approximating Single Machine Scheduling with Scenarios. [Citation Graph (, )][DBLP]

  6. Approximating Linear Threshold Predicates. [Citation Graph (, )][DBLP]

  7. Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling. [Citation Graph (, )][DBLP]

  8. (Acyclic) JobShops are Hard to Approximate. [Citation Graph (, )][DBLP]

  9. Improved Bounds for Flow Shop Scheduling. [Citation Graph (, )][DBLP]

  10. Conditional hardness of precedence constrained scheduling on identical machines. [Citation Graph (, )][DBLP]

Search in 0.086secs, Finished in 0.087secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002