direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Publikationsliste

1997

Skutella, M..
Approximation Algorithms for the Discrete Time-Cost Tradeoff Problem.
In Proceedings of the 8th Annual ACM–SIAM Symposium on Discrete Algorithms, pp. 501–508, New Orleans, LA, 1997.


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.


1995


1994

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.


1993

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


1992

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.


Zusatzinformationen / Extras