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
[1]
Hilfe
Suche: Author="Robertson, N."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Obstructions to branch-decomposition of matroids
J. Geelen
,
B. Gerards
,
N. Robertson
,
G. Whittle
Journal of Combinatorial Theory Series B
96
(4), 2006, pp. 560-570
On the excluded minors for the matroids of branch-width
k
J.F. Geelen
,
A.M.H. Gerards
,
N. Robertson
,
G.P. Whittle
Journal of Combinatorial Theory Series B
88
(2), 2003, pp. 261-265
Computing the orientable genus of projetive graphs
J.R. Fiedler
,
J.P. Huneke
,
R.B. Richter
,
N. Robertson
Journal of Graph Theory
20
(3), 1995, pp. 297-308
Graph minors. II. Algorithmic aspects of tree-width
N. Robertson
,
P.D. Seymour
Journal of Algorithms
7
(3), 1986, September, pp. 309-322
Graph minors. XIII. The disjoint paths problem
N. Robertson
,
P.D. Seymour
misc, 1986, September
Graph minors. IX. Disjoint crossed paths
N. Robertson
,
P.D. Seymour
misc, 1986, March
Graph minors. X. Obstructions to tree-decomposition
N. Robertson
,
P.D. Seymour
misc, 1986, December
Graph minors - A survey
N. Robertson
,
P.D. Seymour
misc, 1982
Graph minors. VIII. A Kuratowski theorem for general surfaces
N. Robertson
,
P.D. Seymour
misc