by Alexander Schrijver, Plantage Muidergracht, A. Schrijver
http://homepages.cwi.nl/~lex/files/dict.ps
Add To MetaCart
Abstract:
copyright c
Citations
|
624
|
On computable numbers, with an application to the Entscheidungsproblem
– Turing
- 1936
|
|
227
|
Matroid Theory
– Welsh
- 1976
|
|
167
|
Graph minors XIII. The disjoint paths problem
– Robertson, Seymour
- 1995
|
|
86
|
On the problem of decomposing a graph into n connected factors
– Tutte
- 1961
|
|
46
|
Finding dominators in directed graphs
– Tarjan
- 1974
|
|
25
|
Über eine Eigenschaft der ebenen Komplexe
– Wagner
- 1937
|
|
18
|
On two commodity network flows
– Rothschild, Whinston
- 1966
|
|
17
|
Hadwiger’s conjecture for K6-free graphs, Combinatorica 13
– Robertson, Seymour, et al.
- 1993
|
|
12
|
Disjoint homotopic paths and trees in a planar graph
– Schrijver
- 1991
|
|
12
|
Finding k disjoint paths in a directed planar graph
– Schrijver
- 1994
|
|
9
|
A simple version of Karzanov's blocking flow algorithm
– Tarjan
- 1984
|
|
7
|
Integral extreme points
– Veinott, Dantzig
- 1968
|
|
6
|
Über positive Lösungen homogener linearer Gleichungen
– Stiemke
- 1915
|
|
6
|
A linear-time algorithm for edge-disjoint paths in planar graphs
– Wagner, Weihe
- 1995
|
|
4
|
Two commodity network flows and linear programming
– Sakarovitch
- 1973
|
|
4
|
The problem of the classification of personnel, Psychometrika 15
– Thorndike
- 1950
|
|
3
|
Min-Max Theorems on Shortest Chains and Disjoint Cuts of a Network
– Robacker
- 1956
|
|
3
|
Ob otsenke khromaticheskogo klassa p-grafa [Russian; On an estimate of the chromatic class of a p-graph], Diskretnyĭ Analiz 3
– Vizing
- 1964
|
|
1
|
The factorization of linear graphs, The Journal of the London
– Tutte
- 1979
|
