PhD Theses
- Approximation Schemes for Machine Scheduling;
Dr. Marten Maack, 2020
- Algorithms for Integer Programming and Allocation;
Dr. Lars Rohwedder, 2019
- Useful Structures and How to Find Them – Hardness and Approximation Results for Various Variants of theParallel Task Scheduling Problem;
Dr. Malin Rau, 2019
- About the Structure and Sensitivity of Integer Linear Programs and their Application in Combinatorial Optimization;
Dr. Kim-Manuel Klein, 2017
- Improved Approximation Algorithms for Packing and Scheduling Problems;
Dr. Stefan Erich Julius Kraft, 2015
- On Schemes of Scheduling Problems;
Dr. Lin Chen, 2013
- Approximation Algorithms for Geometric Packing Problems;
Dr. Lars Prädel, 2012
- Approximation Algorithms for 2-Dimensional Packing and Related Scheduling Problems;
Dr. Christina Robenek (Otte), 2012
- Approximation Algorithms for Scheduling and Two-Dimensional Packing Problems;
Dr. Ulrich Michael Schwarz, 2010
- Approximation Algorithms for Linear Programs and Geometrically Constrained Packing Problems;
Dr. Florian Diedrich, 2008
- Approximation Algorithms for Packing and Scheduling Problems;
Dr. Ralf Thöle, 2008
- Approximation Algorithms for 2D Packing Problems;
Dr. Olga Gerber, 2005
- On-Line and Efficient Algorithms for Scheduling Problems in Communication Networks;
Dr. Deshi Ye, 2005
- Approximation Algorithms for Min-Max Resource Sharing and Malleable Tasks Scheduling;
Dr. Hu Zhang, 2004
- Approximation and Online Algorithms in Scheduling and Coloring;
Dr. Aleksei V. Fishkin, 2003
- Approximation Schemes for Scheduling Problems;
Dr. Monaldo Mastrolilli, 2002