Algorithms and Complexity Group


Ulrich Michale Schwarz
Online scheduling on semi-related machines
Information Processing Letters 108(1), 38-40, September 2008

Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
Approximation algorithms for 3D orthogonal knapsack
Journal of Computer Science and Technology 23(5): 749-762, September 2008

Klaus Jansen and Hu Zhang
Approximation algorithms for general packing problems and their application to the multicast congestion problem
Mathematical Programming, volume 114, issue 1, 183-206, 2008

Aleksei V. Fishkin, Olga Gerber, Klaus Jansen, and Robert Solis-Oba
On packing rectangles with resource augmentation: maximizing the profit
Algorithmic Operations Research, 3, 2008

Aleksei V. Fishkin, Klaus Jansen, and Monaldo Mastrolilli
Grouping techniques for scheduling problems: simpler and faster
Algorithmica 51(2), 183-199, 2008

Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolff
Trimming of graphs, with application to point labeling 
Proceedings of the 25th International Symposium on Theoretical Aspects of Computer Science (STACS 2008),
Bordeaux, France, February 21 - 23, 2008

Florian Diedrich, Britta Kehden, and Frank Neumann 
 Multi-objective problems in terms of relational algebra 
Proceedings of the 10th International Conference on Relational Methods in Computer Science (RelMiCS10),
Frauenwörth, Germany, April 7 - 11, 2008

Klaus Jansen and Roberto Solis-Oba
A polynomial time approximation scheme for the square packing problem 
Proceedings of the 13th Conference on Integer Programming and Combinatorial Optimization (IPCO 2008),
Bertinoro, Italy, May 26 - 28, 2008

Klaus Jansen and Ralf Thöle
Approximation algorithms for scheduling parallel jobs: breaking the approximation ratio of 2
Proceedings of the 35th International Colloquium on Automata, Languages and Programming (ICALP 2008),
Reykjavik, Iceland, July 6 - 13, 2008