Algorithms and Complexity Group


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


Rolf Harren, Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, and Rob van Stee
Two for One: Tight approximation of 2D Bin Packing 
International Journal of Foundations of Computer Science

Klaus Jansen, Stefan Kratsch, Dániel Marx, and Ildikó Schlotter
Bin packing with fixed number of bins revisited 
Journal of Computer and System Sciences 79(1), 39-49,  February 2013

Klaus Jansen and Lars Prädel
New approximability results for two-dimensional bin packing
SIAM-ACM Symposium on Discrete Algorithms (SODA 2013), 
New Orleans, USA, January 6 - 8, 2013

Klaus Jansen and Stefan Kraft
An improved knapsack solver for column  generation 
Computer Science Symposium in Russia (CSR 2013),
Ekaterinburg, Russia, June 25 - 29, 2013, Springer LNCS 7913, 12-23

Klaus Jansen and Kim-Manuel Klein
A robust AFPTAS for online bin packing with polynomial migration
40th International Colloquium on Automata, Languages and Programming (ICALP),
Riga, Latvia,  July 8 - 12, 2013, Springer LNCS 7965, 589-600

Klaus Jansen, Felix Land, and Kati Land 
Bounding the running time of algorithms for scheduling and packing problems
Workshop on Algorithms and Data Structures Symposium (WADS 2013),
London, Canada, August 12 - 14, 2013, Springer LNCS 8037, 439-450

Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, and Denis Trystram
A (2+epsilon) - approximation for scheduling parallel jobs in platforms
The International European Conference on Parallel and Distributed Computing (Euro-Par 2013),
Aachen, Germany, August 26 - 30, 2013, Springer LNCS 8097, 78-89

Thorsten Ehlers and Klaus Jansen
Online-scheduling on identical machines with bounded migration
15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC 2013),
Timisoara, Romania, September 23 - 26, 2013


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.