Jack R. Edmonds

Publication Activity (10 Years)

Years Active: 1971-2022
Publications (10 Years): 3

Top Topics

Bipartite Graph

Deeper Understanding

Top Venues

Discret. Appl. Math.

J. Comput. Syst. Sci.

Computational Complexity Conference

Publications

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