Algorithms and Complexity Group

Publications

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

2018

Jan Clemens Gehrke, Klaus Jansen, Stefan E. J. Kraft, and Jakob Schikowski
A PTAS for Scheduling Unrelated Machines of Few Different Types
International Journal of Foundations of Computer Science(29) No. 04, June 2018

Lin Chen, Klaus Jansen, and Guochuan Zhang
On the Optimality of Exact and Approximation Algorithms for Scheduling Problems
Journal of Computer and System Sciences, April 2018

Cristina Bazgan, Ljiljana Brankovic, Katrin Casel, Henning Fernau, Klaus Jansen, Kim-Manuel Klein, Michael Lampis, Mathieu Liedloff, Jérôme Monnot, and Vangelis Th. Paschos
The many Facets of Upper Domination
Theoretical Computer Science (717), pp. 2-25, March 22, 2018

Klaus Jansen and Stefan Kraft
A Faster FPTAS for the Unbounded Knapsack Problem
European Journal of Combinatorics (68), pp. 148-174, February 2018

Max Bannach and Sebastian Berndt
Practical Access to Dynamic Programming on Tree Decompositions(ESA 2018)
Helsinki, Finland August 20 - 22, 2018

Sebastian Berndt and Kim-Manuel Klein
Using Structural Properties for Integer Programs(CIE 2018)
Kiel, Germany, July 30 - August 3, 2018

Sebastian Berndt
Computing Tree Width: From Theory to Practice and Back(CIE 2018)
Kiel, Germany, July 30 - August 3, 2018

Sören Henning, Klaus Jansen, Malin Rau, and Lars Schmarje
Complexity and Inapproximability Results for Parallel Task Scheduling and Strip Packing(CSR 2018)
Moscow, Russia, June 6 - 10, 2018

Klaus Jansen and Felix Land
Scheduling Monotone Moldable Jobs in Linear Time(IPDPS 2018)
Vancouver, Canada, May 21 - 25, 2018

Sebastian Berndt and Maciej Liśkiewicz
On the Gold Standard for Security of Universal Steganography(EUROCRYPT 2018)
Tel Aviv, Israel, April 29 - May 3, 2018

Klaus Jansen and Lars Rohwedder
Compact LP Relaxations for Allocation Problems(SOSA 2018)
New Orleans, USA, January 7 - 10, 2018

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.