 | 2009 |
|---|
| 11 |       | Florian Diedrich,
Klaus Jansen,
Ulrich M. Schwarz,
Denis Trystram:
A Survey on Approximation Algorithms for Scheduling with Machine Unavailability.
Algorithmics of Large and Complex Networks 2009: 50-64 |
| 10 | | Florian Diedrich,
Klaus Jansen:
Improved approximation algorithms for scheduling with fixed jobs.
SODA 2009: 675-684 |
| 2008 |
|---|
| 9 | | Florian Diedrich,
Frank Neumann:
Using fast matrix multiplication in bio-inspired computation for complex optimization problems.
IEEE Congress on Evolutionary Computation 2008: 3827-3832 |
| 8 | | Florian Diedrich,
Britta Kehden,
Frank Neumann:
Multi-objective Problems in Terms of Relational Algebra.
RelMiCS 2008: 84-98 |
| 7 | | Florian Diedrich,
Rolf Harren,
Klaus Jansen,
Ralf Thöle,
Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack.
J. Comput. Sci. Technol. 23(5): 749-762 (2008) |
| 2007 |
|---|
| 6 | | Florian Diedrich,
Klaus Jansen:
An Approximation Algorithm for the General Mixed Packing and Covering Problem.
ESCAPE 2007: 128-139 |
| 5 | | Florian Diedrich,
Ulrich M. Schwarz:
A Framework for Scheduling with Online Availability.
Euro-Par 2007: 205-213 |
| 4 | | Florian Diedrich,
Klaus Jansen,
Fanny Pascual,
Denis Trystram:
Approximation Algorithms for Scheduling with Reservations.
HiPC 2007: 297-307 |
| 3 | | Florian Diedrich,
Rolf Harren,
Klaus Jansen,
Ralf Thöle,
Henning Thomas:
Approximation Algorithms for 3D Orthogonal Knapsack.
TAMC 2007: 34-45 |
| 2 | | Florian Diedrich,
Klaus Jansen:
Faster and simpler approximation algorithms for mixed packing and covering problems.
Theor. Comput. Sci. 377(1-3): 181-204 (2007) |
| 2006 |
|---|
| 1 | | Mihhail Aizatulin,
Florian Diedrich,
Klaus Jansen:
Implementation of Approximation Algorithms for the Max-Min Resource Sharing Problem.
WEA 2006: 207-218 |
