Matthias Middendorf

According to our database, Matthias Middendorf authored at least 9 papers between 1990 and 2004.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2004

A Component-Based Framework for Recognition Systems.

Matthias Middendorf, Carsten Peust, Johannes Schacht

Proceedings of the Reading and Learning, Adaptive Content Recognition, 2004

1995

The Complexity of Induced Minors and Related Problems.

Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer

Algorithmica, 1995

1993

Weakly transitive orientations, Hasse diagrams and string graphs.

Matthias Middendorf, Frank Pfeiffer

Discret. Math., 1993

On the complexity of the disjoint paths problems.

Matthias Middendorf, Frank Pfeiffer

Comb., 1993

1992

The max clique problem in classes of string-graphs.

Matthias Middendorf, Frank Pfeiffer

Discret. Math., 1992

1991

Induced minors and related problems.

Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer

Proceedings of the Graph Structure Theory, 1991

1990

On the complexity of recognizing perfectly orderable graphs.

Matthias Middendorf, Frank Pfeiffer

Discret. Math., 1990

The Paths-Selection.

Matthias Middendorf, Frank Pfeiffer

Proceedings of the Polyhedral Combinatorics, 1990

On the Complexity of the Disjoint Paths Problem (Extended Abstract).

Matthias Middendorf, Frank Pfeiffer

Proceedings of the Polyhedral Combinatorics, 1990