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


Klaus Jansen and Gouchuan Zhang
Maximizing the total profit of rectangles packed into a rectangle
Algorithmica 47, 323-342, April 2007

Florian Diedrich and Klaus Jansen
Faster and simpler approximation algorithms for mixed packing and covering problems
Theoretical Computer Science, volume 377, issues 1-3, 181-204, May 31, 2007

Janka Chlebíková and Klaus Jansen
The d-precoloring problem for k-degenerate graphs
Discrete Mathematics, volume 307, issue 16, 2042-2052, July 28,  2007

Florian Diedrich and Klaus Jansen
An approximation algorithm for the general mixed packing and covering problem
International Symposium on Combinatorics, Algorithms, Probabilistic and Experimental Methodologies (ESCAPE 2007),
Hangzhou, China, April 07 - 09, 2007, Springer LNCS 4614, 128-139

Florian Diedrich, Rolf Harren, Klaus Jansen, Ralf Thöle, and Henning Thomas
Approximation algorithms for 3D orthogonal knapsack
Proceedings of the 4th Annual Conference on Theory and Applications of Models of Computation (TAMC 2007),
Shanghai, China, May 22 - 25, 2007, Springer LNCS 4484, 34-45

Klaus Jansen
Approximation algorithms for geometric intersection graphs
Proceedings of the 33rd International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2007),
Dornburg near Jena, Germany, June 21 - 23, 2007, Springer LNCS 4769, 151-153

Klaus Jansen and Roberto Solis-Oba
New approximability results for 2-dimensional packing problems
32nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2007),
Cesky Krumlov, Czech Republic, August 26 - 31, 2007, Springer LNCS  4708, 103-114

Florian Diedrich and Ulrich Michael Schwarz
A framework for scheduling with online availability
13th International European Conference on Parallel and Distributed Computing (Euro-Par 2007),
Rennes, France, August 28 - 31, 2007, Springer LNCS 4641, 205-213

Ulrich Michael Schwarz
Tightness results for malleable task algorithms
Proceedings of the 7th International Conference on Parallel Processing and Applied Mathematics (PPAM 2007),
Gdansk, Poland, September 9 - 12, 2007, Springer LNCS 4967, 1059-1067

Florian Diedrich, Klaus Jansen, Fanny Pascual, and Denis Trystram
Approximation algorithms for scheduling with reservations
4th International Conference on High Performance Computing (HiPC 2007),
Goa, Indien, December 18 - 21, 2007, Springer LNCS 4873, 297-307


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.