Schäffter, M..
Scheduling Jobs with Communication Delays: Complexity Results and Approximation Algorithms.
Doctoral thesis, TU Berlin, 1996.

Parra, A..
Structural and Algorithmic Aspects of Chordal Graph Embeddings.
Doctoral thesis, TU Berlin, 1996.

Schulz, A. S..
Polytopes and Scheduling.
Doctoral thesis, TU Berlin, 1996.

Skutella, M..
Konjugiertenklassen und Harish-Chandra-Serien symplektischer und orthogonaler Gruppen.
Diploma thesis, RWTH Aachen, 1995. In German.

Link zur Publikation

Weihe, C..
Flow and Routing Problems in Planar Graphs.
Doctoral thesis, TU Berlin, 1994.

Ripphausen-Lipa, H..
Efficient Algorithms for Disjoint Steiner Trees Packing Problems in Planar Graphs.
Doctoral thesis, TU Berlin, 1994.

Müller, R..
Bounds for linear VLSI layout problems.
Doctoral thesis, TU Berlin, 1993.

Gustedt, J..
Algorithmic Aspects of Ordered Structures.
Doctoral thesis, TU Berlin, 1992.

Felsner, S..
Interval Orders: Combinatorial Structure and Algorithms.
Doctoral thesis, TU Berlin, 1992.

Klimm, M. and Weibull, J. W..
Finding all minimal CURB sets.
. SSE/EFI Working Paper Series in Economics and Finance No 722, 20 pages, July 1, 2009, \texttturlhttp://swopec.hhs.se/hastef/abs/hastef0722.htm.