direkt zum Inhalt springen
direkt zum Hauptnavigationsmenü
Sie sind hier
Suche
Institut für MathematikFG Kombinatorische Optimierung und Graphenalgorithmen
Preprint 220-1989 Stefan Felsner. A 3/2-Approximation Algorithm for the Jump Number of Interval Orders.
Preprint 221-1989 Jens Gustedt. On the Pathwidth of Chordal Graphs.
Preprint 218-1989 Ruth Kuchem and Dorothea Wagner and Frank Wagner. Area-Optimal Three-Layer Channel Routing.
Preprint 223-1989 Rolf H. Möhring. Graph Problems related to Gate Matrix Layout and PLA Folding.
Preprint 225-1989 Rudolf Müller and Dorothea Wagner. α-Vertex-Separation is $N\!\!P$-hard even for 3-regular Graphs.
Preprint 240-1989 Dorothea Wagner and Frank Wagner. Channel Routing under Different Optimization Criteria.
Preprint 245-1990 Hans L. Bodlaender and Rolf H. Möhring. The pathwidth and treewidth of cographs.
Preprint 255-1990 Stefan Felsner. Orthogonal Structures in Directed Graphs.
Preprint 265-1990 Stefan Felsner and Michel Morvan. More Bounds for the Dimension of Interval Orders.
Preprint 247-1990 Michael Formann and Dorothea Wagner and Frank Wagner. Routing through a Dense Channel with Minimum Total Wire Length.
Preprint 244-1990 Michel Habib and Rolf H. Möhring. Recognition of partial orders with interval dimension two via transitive orientation with side constraints.
Preprint 595-1998 Rolf H. Möhring and Andreas S. Schulz and Marc Uetz. Approximation in stochastic scheduling: The power of LP-based priority policies.
