Ulrich M. Schwarz

According to our database, Ulrich M. Schwarz authored at least 11 papers between 2007 and 2013.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2013

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

2012

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

2011

Faster Approximation Algorithms for Scheduling with Fixed Jobs.

Klaus Jansen, Lars Prädel, Ulrich M. Schwarz, Ola Svensson

Proceedings of the Seventeenth Computing: The Australasian Theory Symposium, 2011

2010

Approximation algorithms for scheduling and two-dimensional packing problems.

Ulrich M. Schwarz

PhD thesis, 2010

Parallel machine scheduling with nested job assignment restrictions.

Gabriella Muratore, Ulrich M. Schwarz, Gerhard J. Woeginger

Oper. Res. Lett., 2010

A PTAS for Scheduling with Tree Assignment Restrictions

Ulrich M. Schwarz

CoRR, 2010

2009

Two for One: Tight Approximation of 2D Bin Packing.

Klaus Jansen, Lars Prädel, Ulrich M. Schwarz

Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.

Florian Diedrich, Klaus Jansen, Ulrich M. Schwarz, Denis Trystram

Proceedings of the Algorithmics of Large and Complex Networks - Design, 2009

2008

Online scheduling on semi-related machines.

Ulrich M. Schwarz

Inf. Process. Lett., 2008

2007

Tightness Results for Malleable Task Scheduling Algorithms.

Ulrich M. Schwarz

Proceedings of the Parallel Processing and Applied Mathematics, 2007

A Framework for Scheduling with Online Availability.

Florian Diedrich, Ulrich M. Schwarz

Proceedings of the Euro-Par 2007, 2007