Frank Pfeiffer

According to our database, Frank Pfeiffer authored at least 10 papers between 1990 and 1995.

Collaborative distances:

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

1995

The Complexity of Induced Minors and Related Problems.

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

Algorithmica, 1995

1994

A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs.

Frank Pfeiffer

Discret. Appl. Math., 1994

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

Zur Komplexität des disjunkte-Wege-Problems.

Frank Pfeiffer

PhD thesis, 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