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


Sören Domrös, Daniel Lucas, Reinhard von Hanxleden, and Klaus Jansen
On Order-preserving, Gap-avoiding Rectangle Packing
Scitepress, Volume 3:IVAPP, 38-49, 2021

Klaus Jansen, Oliver Sinnen, and Huijun Wang
An EPTAS for Scheduling Fork-Join Graphs with Communication Delay
Theoretial Computer Science, 2021

Klaus Jansen, Alexandra Lassota, Marten Maack, and Tytus Pikies
Total Completion Time Minimization for Scheduling with Incompatibility Cliques (ICAPS 2021)
Guangzhou, China, June 7-12, 2021

Klaus Jansen, Kim Manuel Klein, and Alexandra Lassota
The Double Exponential Runtime is Tight for 2-Stage Stochastic (IPCO 2021)
Atlanta, Georgia, USA, May 19-21, 2021

Sebastian Berndt, Klaus Jansen, and Alexandra Lassota
Tightness of Sensitivity and Proximity Bounds for Integer Programs (SOFSEM 2021)
Bozen, Italien, January 25-28, 2021

Sebastian Berndt, Klaus Jansen, and Kim Manuel Klein
New Bounds for the Vertices of the Integer Hull (SOSA 2021)
Alexandria, USA, January 11-12, 2021


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.