direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Page Content

List of all publications

<< previous [1]

1997

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


1996

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


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


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


1995

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

Link to publication [19]


1994

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


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


1993

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


1992

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


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


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


<< previous [26]
------ Links: ------

Zusatzinformationen / Extras

Quick Access:

Schnellnavigation zur Seite über Nummerneingabe

Auxiliary Functions

This site uses Matomo for anonymized webanalysis. Visit Data Privacy for more information and opt-out options.
Copyright TU Berlin 2008