Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
Hilfe
Suche: Author="Seymour, P.D."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph minors. XIX. Well-quasi-ordering on a surface
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
90
(2), 2004, pp. 325-385
Graph minors. XX. Wagner's conjecture
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
92
(2), 2004, pp. 325-357
Graph minors. XVI. Excluding a non-planar graph
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
89
(1), 2003, pp. 43-76
Directed tree-width
Thor Johnson
,
Neil Robertson
,
P.D. Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
82
(1), 2001, pp. 138-154
Graph minors - XVII. Taming a vortex
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
77
(1), 1999, pp. 162-210
A note on list arboricity
P.D. Seymour
Journal of Combinatorial Theory Series B
72
(1), 1998, pp. 150-151
Permanents, Pfaffian orientations, and even directed circuits
William McCuaig
,
Neil Robertson
,
P.D. Seymour
,
Robin Thomas
Proceedings of the 29th Annual ACM Symposium on Theory of Computing, STOC'97 (El Paso, Texas, May 4-6, 1997)
, 1997, pp. 402-405
Irreducible triangulations of surfaces
Z. Gao
,
R.B. Richter
,
P.D. Seymour
Journal of Combinatorial Theory Series B
68
(2), 1996, pp. 206-217
Graph minors - XV. giant steps
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
68
(1), 1996, pp. 112-148
Uniqueness of highly representative surface embeddings
P.D. Seymour
,
Robin Thomas
Journal of Graph Theory
23
(4), 1996, pp. 337-349
Packing circuits in Eulerian digraphs
P.D. Seymour
Combinatorica
16
(2), 1996, pp. 223-231
Graph minors - XIV. extending an embedding
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
65
(1), 1995, pp. 23-50
Graph minors. XII. Distance on a surface
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
64
(2), 1995, pp. 240-272
Packing directed circuits fractionally
P.D. Seymour
Combinatorica
15
(2), 1995, pp. 281-288
Nowhere-zero flows
P.D. Seymour
Handbook of Combinatorics
1
, 1995, pp. 289-299
Matroid minors
P.D. Seymour
Handbook of Combinatorics
1
, 1995, pp. 527-550
The complexity of multiterminal cuts
E. Dahlhaus
,
D.S. Johnson
,
C.H. Papadimitriou
,
P.D. Seymour
,
M. Yannakakis
SIAM Journal on Computing
23
(4), 1994, August, pp. 864-894
Graph minors. XI. Circuits on a surface
Neil Robertson
,
P.D. Seymour
Journal of Combinatorial Theory Series B
60
(1), 1994, pp. 72-106
Packing odd paths
A. Schrijver
,
P.D. Seymour
Journal of Combinatorial Theory Series B
62
(2), 1994, pp. 280-288
Call routing and the ratcatcher
P.D. Seymour
,
R. Thomas
Combinatorica
14
(2), 1994, pp. 217-241
A note on hyperplane generation
P.D. Seymour
Journal of Combinatorial Theory Series B
61
(1), 1994, pp. 88-91
Disjoint cycles in directed graphs on the torus and the Klein bottle
Guoli Ding
,
A. Schrijver
,
P.D. Seymour
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 40-45
On the fractional matching polytope of a hypergraph
Z. Füredi
,
J. Kahn
,
P.D. Seymour
Combinatorica
13
(2), 1993, pp. 167-180
Graph searching and a min-max theorem for tree-width
P.D. Seymour
,
Robin Thomas
Journal of Combinatorial Theory Series B
58
(1), 1993, pp. 22-33
The complexity of multiway cuts
E. Dahlhaus
,
D.S. Johnson
,
C.H. Papadimitriou
,
P.D. Seymour
,
M. Yannakakis
Proceedings of the 24th Annual ACM Symposium on Theory of Computing, STOC'92 (Victoria, British Columbia, Canada, May 4-6, 1992)
, 1992, pp. 241-251
Seiten 1
2
3
>