Technical Reports 1992 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 1992

Technical Report 317-1992: Majid Sarrafzadeh, Dorothea Wagner, Frank Wagner, and Karsten Weihe

Wiring Knock-Knee Layouts: A Global Approach
Technical Report 318-1992: Dorothea Wagner

Optimal Routing Through Dense Channels
Technical Report 319-1992: Klaus Jansen and Petra Scheffler

Generalized coloring for tree-like graphs
Technical Report 322-1992: Jens Gustedt and Michel Morvan

N-free Orders and Minimal Interval Extensions
Technical Report 323-1992: Rolf H. Möhring, Dorothea Wagner, and Frank Wagner

VLSI Network Design
Technical Report 324-1992: Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe

The Vertex-Disjoint Menger Problem in Planar Graphs
Technical Report 333-1992: Dirk Möller and Rudolf Müller

A Concept for the Representation of Data and Algorithms
Technical Report 336-1992: Michel Habib and Rolf H. Möhring

Treewidth of cocomparability graphs and a new order-theoretic parameter
Technical Report 337-1992: Rudolf Müller

On the Poset Polytope of a Digraph
Technical Report 341-1992: Klaus Jansen, Petra Scheffler, and Gerhard Woeginger

The Disjoint Cliques Problem
Technical Report 343-1992: Edmund Ihler, Dorothea Wagner, and Frank Wagner

Modeling Hypergraphs by Graphs
Technical Report 344-1992: Dorothea Wagner and Karsten Weihe

A Linear Time Algorithm for Edge-Disjoint Paths in Planar Graphs