Frank Pfeiffer

List of publications from the DBLP Bibliography Server - FAQ
Other views: by type - by year (modern) - classic-C

Ask others: ACM DL/Guide -

	1995
j6		Michael R. Fellows, Jan Kratochvíl, Martin Middendorf, Frank Pfeiffer: The Complexity of Induced Minors and Related Problems. Algorithmica 13(3): 266-282 (1995)
	1994
j5		Frank Pfeiffer: A Note on the Half-integral Multiflow-problem Restricted to Minor-closed Classes of Graphs. Discrete Applied Mathematics 51(1-2): 127-135 (1994)
	1993
j4		Matthias Middendorf, Frank Pfeiffer: On the complexity of the disjoint paths problems. Combinatorica 13(1): 97-107 (1993)
j3		Matthias Middendorf, Frank Pfeiffer: Weakly transitive orientations, Hasse diagrams and string graphs. Discrete Mathematics 111(1-3): 393-400 (1993)
	1992
j2		Matthias Middendorf, Frank Pfeiffer: The max clique problem in classes of string-graphs. Discrete Mathematics 108(1-3): 365-372 (1992)
	1991
c1		Michael R. Fellows, Jan Kratochvíl, Matthias Middendorf, Frank Pfeiffer: Induced minors and related problems. Graph Structure Theory 1991: 179-182
	1990
j1		Matthias Middendorf, Frank Pfeiffer: On the complexity of recognizing perfectly orderable graphs. Discrete Mathematics 80(3): 327-333 (1990)

Coauthor Index

1	Michael R. Fellows (Mike Fellows)	[j6] [c1]
2	Jan Kratochvíl	[j6] [c1]
3	Martin Middendorf	[j6]
4	Matthias Middendorf	[j4] [j3] [j2] [c1] [j1]

Last update Sat May 25 16:12:04 2013 CET by the DBLP Team —

Data released under the ODC-BY 1.0 license — See also our legal information page