direkt zum Inhalt springen

direkt zum Hauptnavigationsmenü

Sie sind hier

TU Berlin

Inhalt des Dokuments

Preprints

1994

Preprint 371-1994
Heike Ripphausen-Lipa and Dorothea Wagner and Karsten Weihe.
Efficient Algorithms for Disjoint Paths in Planar Graphs.



Preprint 373-1994
Andreas S. Schulz.
A note on the permutahedron of series-parallel posets.





1993

Preprint 349-1993
Stefan Felsner.
3-Interval Irreducible Partially Ordered Sets.


Preprint 368-1993
Stefan Felsner and Rudolf Müller and Lorenz Wernisch.
Optimal Algorithms for Trapezoid Graphs.


Preprint 348-1993
Stefan Felsner and Lorenz Wernisch.
Maximum k-Chains in Planar Point Sets: Combinatorial Structure and Algorithms.



Preprint 350-1993
Jens Gustedt and Angelika Steger.
Testing Hereditary Properties Efficiently on Average.


Preprint 345-1993
Paul Molitor and Uwe Sparmann and Dorothea Wagner.
Two-Layer Wiring with Pin Preassignments.


Preprint 365-1993
Rolf H. Möhring.
Triangulating Graphs without Asteroidal Triples.


Preprint 357-1993
Heike Ripphausen-Lipa and Dorothea Wagner and Karsten Weihe.
Linear-Time Algorithms for Disjoint Two-Face Paths Problems in Planar Graphs.



Preprint 354-1993
Dorothea Wagner and Karsten Weihe.
CRoP: A Library of Algorithms for the Channel Routing Problem.


Preprint 359-1993
Karsten Weihe.
Multicommodity Flows in Even, Planar Networks.



1992

Preprint 322-1992
Jens Gustedt and Michel Morvan.
$N$-free Orders and Minimal Interval Extensions.


Preprint 336-1992
Michel Habib and Rolf H. Möhring.
Treewidth of cocomparability graphs and a new order-theoretic parameter.


Preprint 343-1992
Edmund Ihler and Dorothea Wagner and Frank Wagner.
Modeling Hypergraphs by Graphs.


Preprint 319-1992
Klaus Jansen and Petra Scheffler.
Generalized coloring for tree-like graphs.


Preprint -1992
Klaus Jansen and Petra Scheffler and Gerhard Woeginger.
The Disjoint Cliques Problem.


Preprint 323-1992
Rolf H. Möhring and Dorothea Wagner and Frank Wagner.
VLSI Network Design.


Preprint 333-1992
Dirk Möller and Rudolf Müller.
A Concept for the Representation of Data and Algorithms.


Preprint 337-1992
Rudolf Müller.
On the Poset Polytope of a Digraph.


Preprint 324-1992
Heike Ripphausen–Lipa and Dorothea Wagner and Karsten Weihe.
The Vertex-Disjoint Menger Problem in Planar Graphs.


Preprint 317-1992
Majid Sarrafzadeh and Dorothea Wagner and Frank Wagner and Karsten Weihe.
Wiring Knock-Knee Layouts: A Global Approach.


Preprint 318-1992
Dorothea Wagner.
Optimal Routing Through Dense Channels.


Preprint 344-1992
Dorothea Wagner and Karsten Weihe.
A Linear Time Algorithm for Edge-Disjoint Paths in Planar Graphs.


1991

Preprint 309-1991
Stefan Felsner.
Tolerance Graphs and Orders.



Preprint 291-1991
Stefan Felsner and Jens Gustedt and Michel Morvan and Jean-Xavier Rampon.
Constructing Colorings for Diagrams.


Preprint 285-1991
Stefan Felsner and Michel Habib and Rolf H. Möhring.
On the Interplay between Interval Dimension and Dimension.


Preprint 308-1991
Stefan Felsner and William T.\ Trotter.
Colorings of Diagrams of Interval Orders and α-Sequences of Sets.


Preprint 295-1991
Stefan Felsner and Dorothea Wagner.
On the Complexity of Partial Order Properties.



Preprint 276-1991
Christoph Meinel and Stephan Waack.
Separating complexitiy classes related to bounded alternating ω-branching programs.


Preprint 279-1991
Dorothea Wagner.
A New Approach to Knock-Knee Channel Routing.


Preprint 307-1991
Dorothea Wagner and Frank Wagner.
Between Min Cut and Graph Bisection.


1990

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.



1989

Preprint 224-1989
Martin Bartusch and Rolf H. Möhring and Franz J. Radermacher.
Design Aspects of an Advanced Model-Oriented DSS for Scheduling Problems in Civil Engineering.



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.