Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem. - Mihhail Aizatulin; Florian Diedrich; Klaus Jansen (WEA, 2006)

An Approximation Algorithm for the General Mixed Packing and Covering Problem. - Florian Diedrich; Klaus Jansen (ESCAPE, 2007)

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

Faster and simpler approximation algorithms for mixed packing and covering problems. - Florian Diedrich; Klaus Jansen (Theor. Comput. Sci., 2007)

Multi-objective Problems in Terms of Relational Algebra. - Florian Diedrich; Britta Kehden; Frank Neumann 001 (RelMiCS, 2008)

Using fast matrix multiplication in bio-inspired computation for complex optimization problems. - Florian Diedrich; Frank Neumann 001 (IEEE Congress on Evolutionary Computation, 2008)

Approximation Algorithms for 3D Orthogonal Knapsack. - Florian Diedrich; Rolf Harren; Klaus Jansen; Ralf Thöle; Henning Thomas (J. Comput. Sci. Technol., 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)

Improved approximation algorithms for scheduling with fixed jobs. - Florian Diedrich; Klaus Jansen (SODA, 2009)

Approximation algorithms for linear programs and geometrically constrained packing roblems (Algorithmes d'approximation pour des programmes linéaires et les problèmes de Packing avec des contraintes géometriques) - Florian Diedrich (2009)

Approximation Algorithms for Scheduling with Reservations. - Florian Diedrich; Klaus Jansen; Fanny Pascual; Denis Trystram (Algorithmica, 2010)

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)

Heuristic Approaches to Minimize Tour Duration for the TSP with Multiple Time Windows. - Niklas Paulsen; Florian Diedrich; Klaus Jansen (ATMOS, 2015)