
Search the dblp DataBase
Jack Edmonds:
[Publications]
[Author Rank by year]
[Coauthors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
 Jack Edmonds, Richard M. Karp
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. [Citation Graph (1, 0)][DBLP] J. ACM, 1972, v:19, n:2, pp:248264 [Journal]
 Jack Edmonds
Submodular Functions, Matroids, and Certain Polyhedra. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:1126 [Conf]
 Jack Edmonds, Ellis L. Johnson
Matching: A WellSolved Class of Integer Linear Programs. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:2730 [Conf]
 Jack Edmonds, Richard M. Karp
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. [Citation Graph (0, 0)][DBLP] Combinatorial Optimization, 2001, pp:3133 [Conf]
 Kathie Cameron, Jack Edmonds
Some Graphic Uses of an Even Number of Odd Nodes. [Citation Graph (0, 0)][DBLP] SODA, 1999, pp:872 [Conf]
 Imre Bárány, Jack Edmonds, Laurence A. Wolsey
Packing and covering a tree by subtrees. [Citation Graph (0, 0)][DBLP] Combinatorica, 1986, v:6, n:3, pp:221233 [Journal]
 Jack Edmonds
Redundancy and Helly. [Citation Graph (0, 0)][DBLP] Eur. J. Comb., 2001, v:22, n:5, pp:679685 [Journal]
 Jack Edmonds, Monique Laurent, Alexander Schrijver
A minormonotone graph parameter based on oriented matroids. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1997, v:165, n:, pp:219226 [Journal]
 Kathie Cameron, Jack Edmonds
Coflow polyhedra. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1992, v:101, n:13, pp:121 [Journal]
Branching Systems. [Citation Graph (, )][DBLP]
Coloring vertices of a graph or finding a Meyniel obstruction [Citation Graph (, )][DBLP]
Search in 0.020secs, Finished in 0.022secs
