A Framework for Scheduling with Online Availability. - Florian Diedrich; Ulrich M. Schwarz (Euro-Par, 2007)

Tightness Results for Malleable Task Scheduling Algorithms. - Ulrich M. Schwarz (PPAM, 2007)

Online scheduling on semi-related machines. - Ulrich M. Schwarz (Inf. Process. Lett., 2008)

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability. - Florian Diedrich; Klaus Jansen; Ulrich M. Schwarz; Denis Trystram (Algorithmics of Large and Complex Networks, 2009)

Two for One: Tight Approximation of 2D Bin Packing. - Klaus Jansen; Lars Prädel; Ulrich M. Schwarz (WADS, 2009)

A PTAS for Scheduling with Tree Assignment Restrictions - Ulrich M. Schwarz (CoRR, 2010)

Parallel machine scheduling with nested job assignment restrictions. - Gabriella Muratore; Ulrich M. Schwarz; Gerhard J. Woeginger (Oper. Res. Lett., 2010)

Approximation algorithms for scheduling and two-dimensional packing problems. - Ulrich M. Schwarz (2010)

Faster Approximation Algorithms for Scheduling with Fixed Jobs. - Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Ola Svensson (CATS, 2011)

Tight approximation algorithms for scheduling with fixed jobs and nonavailability. - Florian Diedrich; Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Ola Svensson (ACM Trans. Algorithms, 2012)

Two for One: Tight Approximation of 2D Bin Packing. - Rolf Harren; Klaus Jansen; Lars Prädel; Ulrich M. Schwarz; Rob van Stee (Int. J. Found. Comput. Sci., 2013)