Algorithms and Complexity Group


20212020 2019 2018 2017 2016 2015 2014 2013 2012 2011 2010 2009 2008 2007 2006 2005 2004 2003 2002 2001 2000 1999  1998-1988


Thomas Erlebach, Torben Hagerup, Klaus Jansen, Moritz Minzlaff, and Alexander Wolf 
Trimming of graphs, with application to point labeling
Theory of Computing Systems 47(3), 613-636, 2010

Florian Diedrich, Klaus Jansen, Fanny Pascual, and Denis Trystram
Approximation Algorithms for Scheduling with Reservations
Algorithmica 58(2), 391-404, 2010

Klaus Jansen and Ralf Thöle
Approximation algorithms for scheduling parallel jobs
SIAM Journal on Computing 39(8), 3571-3615, 2010

Klaus Jansen
An EPTAS for scheduling jobs on uniform processors: using an MILP relaxation with a constant number of integral variables
SIAM Journal on Discrete Mathematics 24(2), 457-485, 2010

Gabriella Muratore, Ulrich M. Schwarz, and Gerhard J. Woeginger
Parallel machine scheduling with nested job assignment restrictions
Operations Research Letters 38(1), 47-50, January 2010

Klaus Jansen and Roberto Solis-Oba
Approximation schemes for scheduling jobs with chain precedence constraints
International Journal of Foundations of Computer Science, Vol. 21(1), 27-49, 2010

Klaus Jansen and Roberto Solis-Oba
An OPT + 1 algorithm for the cutting stock problem with constant number of object lengths
14th  Conference on Integer Programming and Combinatorial Optimization (IPCO XIV),
Lausanne, Switzerland, June 9 - 11, 2010

Klaus Jansen, Stefan Kratsch, Dániel Marx, and  Ildikó Schlotter
Bin packing with fixed number of bins revisited
12th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2010),
Bergen, Norway, June 21 - 23, 2010

Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, and Denis Trystram
Approximating the non-contiguous multiple organization packing problem
IFIP International Conference on Theoretical Computer Science (TCS 2010),
Brisbane, Australia, September 20 - 23, 2010

Marin Bougeret, Pierre François Dutot, Klaus Jansen, Christina Otte, and Denis Trystram
A fast 5/2 approximation algorithm for hierarchical scheduling
International European Conference on Parallel and Distributed Computing (EUROPAR 2010),
Ischia, Italy, August 31 - September 3, 2010


Copyright and all rights concerning the documents distributed by this server rest with the authors or other copyright holders. They may not be reposted without the copyright holders' explicit permission. The authors offer these documents here solely to ensure that others working in the same field have ready access to their scholarly or technical work on a noncommercial basis, and on condition that all users copying these documents do so respecting the terms and constraints set by the copyright.