Jack Edmonds

31 papers A* 1C 1Journal 23Unranked 5
YearRankTypeTitle / Venue / Authors
2022 J jnl
A PPA parity theorem about trees in a bipartite graph.
Discret. Appl. Math.
Kathie Cameron, Jack Edmonds
2014 J jnl
Exponentiality of the exchange algorithm for finding another room-partitioning.
Discret. Appl. Math.
Jack Edmonds, Laura Sanità
2010 J jnl
Euler Complexes (Oiks).
Electron. Notes Discret. Math.
Jack Edmonds
2010 — ch.
Matroid Partition.
50 Years of Integer Programming
Jack Edmonds
2010 J jnl
On Finding Another Room-Partitioning of the Vertices.
Electron. Notes Discret. Math.
Jack Edmonds, Laura Sanità
2010 J jnl
Scarf Oiks.
Electron. Notes Discret. Math.
Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich
2010 J jnl
Sperner Oiks.
Electron. Notes Discret. Math.
Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich
2009 C conf
Branching Systems.
IWOCA
Jack Edmonds
2008 — conf
Euler Complexes.
Bonn Workshop of Combinatorial Optimization
Jack Edmonds
2008 J jnl
On Finding Another.
Electron. Notes Discret. Math.
Jack Edmonds
2008 J jnl
The travelling preacher, projection, and a lower bound for the stability number of a graph.
Discret. Optim.
Kathie Cameron, Jack Edmonds
2005 J jnl
Coloring vertices of a graph or finding a Meyniel obstruction
CoRR
Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray
2005 J jnl
Colouring Some Classes of Perfect Graphs Robustly.
Electron. Notes Discret. Math.
Kathie Cameron, Jack Edmonds
2001 — conf
Matching: A Well-Solved Class of Integer Linear Programs.
Combinatorial Optimization
Jack Edmonds, Ellis L. Johnson
2001 J jnl
Redundancy and Helly.
Eur. J. Comb.
Jack Edmonds
2001 — conf
Submodular Functions, Matroids, and Certain Polyhedra.
Combinatorial Optimization
Jack Edmonds
2001 — conf
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
Combinatorial Optimization
Jack Edmonds, Richard M. Karp
1999 A* conf
Some Graphic Uses of an Even Number of Odd Nodes.
SODA
Kathie Cameron, Jack Edmonds
1997 J jnl
A minor-monotone graph parameter based on oriented matroids.
Discret. Math.
Jack Edmonds, Monique Laurent, Alexander Schrijver
1997 J jnl
Lambda composition.
J. Graph Theory
Kathie Cameron, Jack Edmonds
1992 J jnl
Coflow polyhedra.
Discret. Math.
Kathie Cameron, Jack Edmonds
1990 — conf
Existentially Polytime Theorems.
Polyhedral Combinatorics
Kathie Cameron, Jack Edmonds
1986 J jnl
Packing and covering a tree by subtrees.
Comb.
Imre Bárány, Jack Edmonds, Laurence A. Wolsey
1985 J jnl
A case of non-convergent dual changes in assignment problems.
Discret. Appl. Math.
Julián Aráoz, Jack Edmonds
1983 J jnl
Polarities Given by Systems of Bilinear Inequalities.
Math. Oper. Res.
Julián Aráoz, Jack Edmonds, Victor J. Griffin
1983 J jnl
Reductions to 1-matching polyhedra.
Networks
Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki
1982 J jnl
Brick decompositions and the matching rank of graphs.
Comb.
Jack Edmonds, László Lovász, William R. Pulleyblank
1982 J jnl
Polyhedral polarity defined by a general bilinear inequality.
Math. Program.
Victor Griffin, Julián Aráoz, Jack Edmonds
1973 J jnl
Matching, Euler tours and the Chinese postman.
Math. Program.
Jack Edmonds, Ellis L. Johnson
1972 J jnl
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
J. ACM
Jack Edmonds, Richard M. Karp
1971 J jnl
Matroids and the greedy algorithm.
Math. Program.
Jack Edmonds