Jack Edmonds

According to our database, Jack Edmonds authored at least 31 papers between 1971 and 2022.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of two.

2022

A PPA parity theorem about trees in a bipartite graph.

Kathie Cameron, Jack Edmonds

Discret. Appl. Math., 2022

2016

Understanding PPA-Completeness.

Xiaotie Deng, Jack R. Edmonds, Zhe Feng, Zhengyang Liu, Qi Qi, Zeying Xu

Proceedings of the 31st Conference on Computational Complexity, 2016

2014

Exponentiality of the exchange algorithm for finding another room-partitioning.

Jack Edmonds, Laura Sanità

Discret. Appl. Math., 2014

2010

On Finding Another Room-Partitioning of the Vertices.

Jack Edmonds, Laura Sanità

Electron. Notes Discret. Math., 2010

Scarf Oiks.

Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich

Electron. Notes Discret. Math., 2010

Sperner Oiks.

Jack Edmonds, Stéphane Gaubert, Vladimir Gurvich

Electron. Notes Discret. Math., 2010

Euler Complexes (Oiks).

Jack Edmonds

Electron. Notes Discret. Math., 2010

Matroid Partition.

Jack Edmonds

Proceedings of the 50 Years of Integer Programming 1958-2008, 2010

2009

Branching Systems.

Jack Edmonds

Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008

On Finding Another.

Jack Edmonds

Electron. Notes Discret. Math., 2008

The travelling preacher, projection, and a lower bound for the stability number of a graph.

Kathie Cameron, Jack Edmonds

Discret. Optim., 2008

Euler Complexes.

Jack Edmonds

Proceedings of the Research Trends in Combinatorial Optimization, 2008

2005

Colouring Some Classes of Perfect Graphs Robustly.

Kathie Cameron, Jack Edmonds

Electron. Notes Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction

Kathie Cameron, Jack Edmonds, Benjamin Lévêque, Frédéric Maffray

CoRR, 2005

2001

Redundancy and Helly.

Jack Edmonds

Eur. J. Comb., 2001

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.

Jack Edmonds, Richard M. Karp

Proceedings of the Combinatorial Optimization, 2001

Matching: A Well-Solved Class of Integer Linear Programs.

Jack Edmonds, Ellis L. Johnson

Proceedings of the Combinatorial Optimization, 2001

Submodular Functions, Matroids, and Certain Polyhedra.

Jack Edmonds

Proceedings of the Combinatorial Optimization, 2001

1999

Some Graphic Uses of an Even Number of Odd Nodes.

Kathie Cameron, Jack Edmonds

Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997

Lambda composition.

Kathie Cameron, Jack Edmonds

J. Graph Theory, 1997

A minor-monotone graph parameter based on oriented matroids.

Jack Edmonds, Monique Laurent, Alexander Schrijver

Discret. Math., 1997

1992

Coflow polyhedra.

Kathie Cameron, Jack Edmonds

Discret. Math., 1992

1990

Existentially Polytime Theorems.

Kathie Cameron, Jack Edmonds

Proceedings of the Polyhedral Combinatorics, 1990

1986

Packing and covering a tree by subtrees.

Imre Bárány, Jack Edmonds, Laurence A. Wolsey

Comb., 1986

1985

A case of non-convergent dual changes in assignment problems.

Julián Aráoz, Jack Edmonds

Discret. Appl. Math., 1985

1983

Reductions to 1-matching polyhedra.

Juláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki

Networks, 1983

Polarities Given by Systems of Bilinear Inequalities.

Julián Aráoz, Jack Edmonds, Victor J. Griffin

Math. Oper. Res., 1983

1982

Polyhedral polarity defined by a general bilinear inequality.

Victor Griffin, Julián Aráoz, Jack Edmonds

Math. Program., 1982

Brick decompositions and the matching rank of graphs.

Jack Edmonds, László Lovász, William R. Pulleyblank

Comb., 1982

1973

Matching, Euler tours and the Chinese postman.

Jack Edmonds, Ellis L. Johnson

Math. Program., 1973

1971

Matroids and the greedy algorithm.

Jack Edmonds

Math. Program., 1971