Algorithms and Complexity Group

Publications

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

2012

Florian Diedrich, Klaus Jansen, Ulrich Schwarz, Ola Svensson, and Lars Prädel
Tight approximation algorithms for scheduling with fixed jobs and non-availability
ACM Transactions on Algorithms 8(3), Article Nr. 27, 2012

Klaus Jansen and Roberto Solis-Oba
Packing squares with profits
SIAM Journal on Discrete Mathematics 26(1), 263-279, February 2012

Klaus Jansen and Hu Zhang
Scheduling malleable tasks with precedence constraints
Journal of Computer and System Sciences78(1), 245-259, January 2012

Klaus Jansen 
A fast approximation algorithm for the multiple knapsack problem
38th International Conference on Current Trends in Theory and Practice of Computer Science (SOFSEM 2012),
Špindlerův Mlýn, Tschechien, January 21 - 27, 2012, Springer LNCS 7147, 313-324

Marin Bougeret, Pierre-Francois Dutot, Klaus Jansen, Christina Robenek, and Denis Trystram
Tight approximation for scheduling parallel jobs on identical clusters
14th Workshop on Advances on Parallel and Distributed Processing Symposium (APDCM 2012),
Shanghai, China, May 21, 2012

Klaus Jansen
A (3/2+\epsilon) approximation algorithm for scheduling malleable and non-malleable parallel tasks
24th Annual ACM Symposium on Parallelism in Algorithms and Architectures (SPAA 2012),
Pittsburgh, Pennsylvania, USA, June 25 - 27, 2012

Klaus Jansen and Stefan Kraft
An Improved Approximation Scheme for Variable-Sized Bin Packing
37th International Symposium on Mathematical Foundations of Computer Science (MFCS 2012),
Bratislava, Slovakia, August 27 - 31, 2012, Springer LNCS 7464, 529-541

Copyright

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.