Technical Reports 1994 of the group Combinatorial Optimization & Graph Algorithms

Technical reports 1994

Technical Report 371-1994: Heike Ripphausen-Lipa, Dorothea Wagner, and Karsten Weihe

Efficient Algorithms for Disjoint Paths in Planar Graphs
Technical Report 373-1994: Andreas S. Schulz

A note on the permutahedron of series-parallel posets
Technical Report 374-1994: Karsten Weihe

Edge-Disjoint (s,t)-Paths in Undirected Planar Graphs in Linear Time
Technical Report 375-1994: Christophe Fiorio and Jens Gustedt

Two Linear Time Union-Find Strategies for Image Processing
Technical Report 376-1994: Valeska Naumann

Measuring the Distance to Series-Parallelity by Path Expressions
Technical Report 377-1994: Rolf H. Möhring, Matthias Müller-Hannemann, and Karsten Weihe

Using Network Flows for Surface Modeling
Technical Report 383-1994: Karsten Weihe

Introduction to basic C++ - unpublished lecture notes, written in German
Technical Report 386-1994: Annelie von Arnim and Andreas S. Schulz

Facets of the Generalized Permutahedron of a Poset
Technical Report 390-1994: Karsten Weihe

Maximum (s,t)-Flows in Planar Networks in O(|V| log |V|) Time
Technical Report 392-1994: Andreas Parra

Triangulating Multitolerance Graphs
Technical Report 393-1994: Maurice Queyranne

A Combinatorial Algorithm for Minimizing Symmetric Submodular Functions
Technical Report 394-1994: Jens Gustedt

The General Two-Path Problem in time O(m log n), extended abstract
Technical Report 396-1994: Petra Scheffler

A Practical Linear Time Algorithm for Disjoint Paths in Graphs with Bounded Tree-width
Technical Report 401-1994: Rudolf Müller and Andreas S. Schulz

The Interval Order Polytope of a Digraph
Technical Report 407-1994: Andreas Parra and Petra Scheffler

How to Use the Minimal Separators of a Graph for Its Chordal Triangulation
Technical Report 408-1994: Maurice Queyranne and Andreas S. Schulz

Polyhedral Approaches to Machine Scheduling