MPI-INF Logo

MPI-INF D1 Publications

Search the publication database
.
Return

Your search returned the following 11 documents:

  1. A (5/3 + ε)-Approximation for Strip Packing
    Rolf Harren, Klaus Jansen, Lars Prädel, and Rob van Stee
    In: Algorithms and Data Structures : 12th International Symposium, WADS 2011, New York, NY, 2011, 475-487
    [PDF: Download: strip53.pdf]
  2. Bin Packing with Fixed Number of Bins Revisited
    Klaus Jansen, Stefan Kratsch, Dániel Marx, and Ildikó Schlotter
    In: Algorithm Theory - SWAT 2010 : 12th Scandinavian Symposium and Workshops on Algorithm Theory, Bergen, Norway, 2010, 260-272
  3. Approximation Algorithms for 3D Orthogonal Knapsack
    Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
    Journal of Science and Technology 23 (5): 749-762, 2008
    [PDF: Download: Diedrich,Harren,Jansen,Thoele,Thomas-JCST2008.pdf]
  4. Approximation Algorithms for 3D Orthogonal Knapsack
    Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
    In: Theory and Applications of Models of Computation, Shanghai, China, 2007, 34-45
    [PDF: Download: Approximation Algorithms for 3D Orthogonal Knapsack (TAMC07).pdf]
  5. Linear-Time Approximation Schemes for Scheduling Malleable Parallel Tasks
    Klaus Jansen and Lorant Porkolab
    Algorithmica 32 (3): 507-520, 2002
  6. Linear time approximation schemes for shop scheduling problems
    Klaus Jansen, Roberto Solis-Oba, and Maxim Sviridenko
    In: Approximation and complexity in numerical optimization, 2000, 338-346
  7. A linear time approximation scheme for the job shop scheduling problem
    Roberto Solis-Oba, Klaus Jansen, and Maxim Sviridenko
    In: Proceedings of the 3rd International Workshop on Randomization and Approximation Techniques in Computer Science, and 2nd International Workshop on Approximation Algorithms for Combinatorial Optimization Problems (RANDOM-APPROX-99), Berkeley, U.S.A., August,8 - August, 11, 1999, 1999, 177-188
  8. Makespan minimization in job shops: a polynomial time approximation scheme
    Roberto Solis-Oba, Klaus Jansen, and Maxim Sviridenko
    In: Proceedings of the 31st Annual ACM Symposium on Theory of Computing (STOC-99), Atlanta, USA, May, 1 - May 4, 1999, 394-399
  9. A New Characterization for Parity Graphs and a Coloring Problem with Costs
    Klaus Jansen
    In: Proceedings of the 3rd Latin American Symposium on Theoretical Informatics (Latin-98), Campinas, Brazil, April 20-24, 1998, 1998, 249-260
  10. Ranking of Graphs
    Hans L. Bodlaender, Jitender S. Deogun, Klaus Jansen, Ton Kloks, Dieter Kratsch, Haiko Müller, and Zsolt Tuza
    SIAM Journal on Discrete Mathematics 11 (1): 168-181, 1998
  11. The Mutual Exclusion Scheduling Problem for Permutation and Comparability Graphs
    Klaus Jansen
    In: Proceedings of the 15th Annual Symposium on Theoretical Aspects of Computer Science (STACS-98), Paris, France, February, 25-27, 1998, 1998, 287-297