| 2008 |
|---|
| 13 | EE | Kathie Cameron,
Jack Edmonds:
The travelling preacher, projection, and a lower bound for the stability number of a graph.
Discrete Optimization 5(2): 290-292 (2008) |
| 12 | EE | Jack Edmonds:
On Finding Another.
Electronic Notes in Discrete Mathematics 31: 181-182 (2008) |
| 2005 |
|---|
| 11 | EE | Kathie Cameron,
Jack Edmonds,
Benjamin Lévêque,
Frédéric Maffray:
Coloring vertices of a graph or finding a Meyniel obstruction
CoRR abs/cs/0509023: (2005) |
| 10 | EE | Kathie Cameron,
Jack Edmonds:
Colouring Some Classes of Perfect Graphs Robustly.
Electronic Notes in Discrete Mathematics 22: 553-556 (2005) |
| 2001 |
|---|
| 9 | EE | Jack Edmonds:
Submodular Functions, Matroids, and Certain Polyhedra.
Combinatorial Optimization 2001: 11-26 |
| 8 | EE | Jack Edmonds,
Ellis L. Johnson:
Matching: A Well-Solved Class of Integer Linear Programs.
Combinatorial Optimization 2001: 27-30 |
| 7 | EE | Jack Edmonds,
Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Combinatorial Optimization 2001: 31-33 |
| 6 | EE | Jack Edmonds:
Redundancy and Helly.
Eur. J. Comb. 22(5): 679-685 (2001) |
| 1999 |
|---|
| 5 | EE | Kathie Cameron,
Jack Edmonds:
Some Graphic Uses of an Even Number of Odd Nodes.
SODA 1999: 872 |
| 1997 |
|---|
| 4 | EE | Jack Edmonds,
Monique Laurent,
Alexander Schrijver:
A minor-monotone graph parameter based on oriented matroids.
Discrete Mathematics 165-166: 219-226 (1997) |
| 1992 |
|---|
| 3 | EE | Kathie Cameron,
Jack Edmonds:
Coflow polyhedra.
Discrete Mathematics 101(1-3): 1-21 (1992) |
| 1986 |
|---|
| 2 | | Imre Bárány,
Jack Edmonds,
Laurence A. Wolsey:
Packing and covering a tree by subtrees.
Combinatorica 6(3): 221-233 (1986) |
| 1972 |
|---|
| 1 | EE | Jack Edmonds,
Richard M. Karp:
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
J. ACM 19(2): 248-264 (1972) |
