On the Complexity of the Disjoint Paths Problem (Extended Abstract). - Matthias Middendorf; Frank Pfeiffer (Polyhedral Combinatorics, 1990)

The Paths-Selection. - Matthias Middendorf; Frank Pfeiffer (Polyhedral Combinatorics, 1990)

On the complexity of recognizing perfectly orderable graphs. - Matthias Middendorf; Frank Pfeiffer (Discret. Math., 1990)

Induced minors and related problems. - Michael R. Fellows; Jan Kratochvíl; Matthias Middendorf; Frank Pfeiffer (Graph Structure Theory, 1991)

The max clique problem in classes of string-graphs. - Matthias Middendorf; Frank Pfeiffer (Discret. Math., 1992)

On the complexity of the disjoint paths problems. - Matthias Middendorf; Frank Pfeiffer (Comb., 1993)

Weakly transitive orientations, Hasse diagrams and string graphs. - Matthias Middendorf; Frank Pfeiffer (Discret. Math., 1993)

The Complexity of Induced Minors and Related Problems. - Michael R. Fellows; Jan Kratochvíl; Matthias Middendorf; Frank Pfeiffer (Algorithmica, 1995)

A Component-Based Framework for Recognition Systems. - Matthias Middendorf; Carsten Peust; Johannes Schacht (Reading and Learning, 2004)