Matroids and the greedy algorithm. - Jack Edmonds 001 (Math. Program., 1971)

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems. - Jack Edmonds 001; Richard M. Karp (J. ACM, 1972)

Matching, Euler tours and the Chinese postman. - Jack Edmonds 001; Ellis L. Johnson (Math. Program., 1973)

Brick decompositions and the matching rank of graphs. - Jack Edmonds 001; László Lovász 001; William R. Pulleyblank (Comb., 1982)

Polyhedral polarity defined by a general bilinear inequality. - Victor Griffin; Julián Aráoz; Jack Edmonds 001 (Math. Program., 1982)

Polarities Given by Systems of Bilinear Inequalities. - Julián Aráoz; Jack Edmonds 001; Victor J. Griffin (Math. Oper. Res., 1983)

Reductions to 1-matching polyhedra. - Juláan Aráoz; William H. Cunningham; Jack Edmonds 001; Jan Green-Krótki (Networks, 1983)

A case of non-convergent dual changes in assignment problems. - Julián Aráoz; Jack Edmonds 001 (Discret. Appl. Math., 1985)

Packing and covering a tree by subtrees. - Imre Bárány; Jack Edmonds 001; Laurence A. Wolsey (Comb., 1986)

Existentially Polytime Theorems. - Kathie Cameron; Jack Edmonds 001 (Polyhedral Combinatorics, 1990)

Coflow polyhedra. - Kathie Cameron; Jack Edmonds 001 (Discret. Math., 1992)

A minor-monotone graph parameter based on oriented matroids. - Jack Edmonds 001; Monique Laurent; Alexander Schrijver (Discret. Math., 1997)

Lambda composition. - Kathie Cameron; Jack Edmonds 001 (J. Graph Theory, 1997)

Some Graphic Uses of an Even Number of Odd Nodes. - Kathie Cameron; Jack Edmonds 001 (SODA, 1999)

Submodular Functions, Matroids, and Certain Polyhedra. - Jack Edmonds 001 (Combinatorial Optimization, 2001)

Matching: A Well-Solved Class of Integer Linear Programs. - Jack Edmonds 001; Ellis L. Johnson (Combinatorial Optimization, 2001)

Redundancy and Helly. - Jack Edmonds 001 (Eur. J. Comb., 2001)

Coloring vertices of a graph or finding a Meyniel obstruction - Kathie Cameron; Jack Edmonds 001; Benjamin Lévêque; Frédéric Maffray (CoRR, 2005)

Colouring Some Classes of Perfect Graphs Robustly. - Kathie Cameron; Jack Edmonds 001 (Electron. Notes Discret. Math., 2005)

Euler Complexes. - Jack Edmonds 001 (Bonn Workshop of Combinatorial Optimization, 2008)

The travelling preacher, projection, and a lower bound for the stability number of a graph. - Kathie Cameron; Jack Edmonds 001 (Discret. Optim., 2008)

On Finding Another. - Jack Edmonds 001 (Electron. Notes Discret. Math., 2008)

Branching Systems. - Jack Edmonds 001 (IWOCA, 2009)

Matroid Partition. - Jack Edmonds 001 (50 Years of Integer Programming, 2010)

Euler Complexes (Oiks). - Jack Edmonds 001 (Electron. Notes Discret. Math., 2010)

Sperner Oiks. - Jack Edmonds 001; Stéphane Gaubert; Vladimir Gurvich (Electron. Notes Discret. Math., 2010)

Scarf Oiks. - Jack Edmonds 001; Stéphane Gaubert; Vladimir Gurvich (Electron. Notes Discret. Math., 2010)

On Finding Another Room-Partitioning of the Vertices. - Jack Edmonds 001; Laura Sanità (Electron. Notes Discret. Math., 2010)

Exponentiality of the exchange algorithm for finding another room-partitioning. - Jack Edmonds 001; Laura Sanità (Discret. Appl. Math., 2014)

Understanding PPA-completeness. - Xiaotie Deng; Jack R. Edmonds; Zhe Feng 004; Zhengyang Liu 002; Qi Qi 003; Zeying Xu (J. Comput. Syst. Sci., 2021)

A PPA parity theorem about trees in a bipartite graph. - Kathie Cameron; Jack Edmonds 001 (Discret. Appl. Math., 2022)