Jack Edmonds

发表

Existentially Polytime Theorems

Kathie Cameron, Jack Edmonds, J. Edmonds, 1990, Polyhedral Combinatorics.

Matching, Euler tours and the Chinese postman

Jack Edmonds, Ellis L. Johnson, J. Edmonds, 1973, Math. Program..

An introduction to matching

Jack Edmonds, J. Edmonds, 1967 .

Maximum matching and a polyhedron with 0,1-vertices

Jack Edmonds, J. Edmonds, 1965 .

Combinatorial Optimization — Eureka, You Shrink!

Jack Edmonds, Ellis L. Johnson, J. Edmonds, 2003, Lecture Notes in Computer Science.

Sperner Oiks

Vladimir Gurvich, Jack Edmonds, Stéphane Gaubert, 2010, Electron. Notes Discret. Math..

Scarf Oiks

Vladimir Gurvich, Jack Edmonds, Stéphane Gaubert, 2010, Electron. Notes Discret. Math..

A case of non-convergent dual changes in assignment problems

Jack Edmonds, Julián Aráoz, J. Edmonds, 1985, Discret. Appl. Math..

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Richard M. Karp, Jack Edmonds, R. Karp, 1972, Combinatorial Optimization.

Some graphic uses of an even number of odd nodes

Kathie Cameron, Jack Edmonds, J. Edmonds, 1999, SODA '99.

Coflow polyhedra

Kathie Cameron, Jack Edmonds, 1992, Discret. Math..

On Finding Another

Jack Edmonds, J. Edmonds, 2008, Electron. Notes Discret. Math..

Submodular Functions, Matroids, and Certain Polyhedra

Jack Edmonds, J. Edmonds, 2001, Combinatorial Optimization.

Packing and covering a tree by subtrees

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

Redundancy and Helly

Jack Edmonds, 2001, Eur. J. Comb..

Eureka - you shrink!: surprise session for Jack Edmonds

Jack Edmonds, J. Edmonds, 2003 .

Brick decompositions and the matching rank of graphs

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

Exponentiality of the exchange algorithm for finding another room-partitioning

Laura Sanità, Jack Edmonds, J. Edmonds, 2014, Discret. Appl. Math..

Matching: A Well-Solved Class of Integer Linear Programs

Jack Edmonds, Ellis L. Johnson, J. Edmonds, 2001, Combinatorial Optimization.

Reductions to 1-matching polyhedra

Jack Edmonds, William H. Cunningham, Jan Green-Krótki, 1983, Networks.

On Finding Another Room-Partitioning of the Vertices

Laura Sanità, Jack Edmonds, J. Edmonds, 2010, Electron. Notes Discret. Math..

Polyhedral polarity defined by a general bilinear inequality

Jack Edmonds, Victor Griffin, Julián Aráoz, 1982, Math. Program..

Lambda composition

Kathie Cameron, Jack Edmonds, J. Edmonds, 1997, J. Graph Theory.

Euler Complexes (Oiks)

Jack Edmonds, 2010, Electron. Notes Discret. Math..

Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems

Richard M. Karp, Jack Edmonds, 2001, Combinatorial Optimization.

Colouring Some Classes of Perfect Graphs Robustly

Kathie Cameron, Jack Edmonds, J. Edmonds, 2005, Electron. Notes Discret. Math..

Euler Complexes

Jack Edmonds, J. Edmonds, 2008, Bonn Workshop of Combinatorial Optimization.

Branching Systems

Jack Edmonds, 2009, IWOCA.

Polarities Given by Systems of Bilinear Inequalities

Jack Edmonds, Julián Aráoz, Victor Griffin, 1983, Math. Oper. Res..

Matroid Partition

Jack Edmonds, J. Edmonds, 2010, 50 Years of Integer Programming.

Attacks on Lightweight Hardware-Based Security Primitives pdf

Fatemeh Tehranipoor, Jack Edmonds, 2020, ArXiv.

Matroids and the greedy algorithm

Jack Edmonds, J. Edmonds, 1971, Math. Program..

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

Kathie Cameron, Jack Edmonds, 2008, Discret. Optim..

A minor-monotone graph parameter based on oriented matroids

Alexander Schrijver, Jack Edmonds, Monique Laurent, 1997, Discret. Math..

On the surface duality of linear graphs

Jack Edmonds, J. Edmonds, 1965 .

The poset scheduling problem

Jack Edmonds, Gerard J. Chang, J. Edmonds, 1985 .

Finding a Strong Stable Set or a Meyniel Obstruction in any Graph

Kathie Cameron, Jack Edmonds, J. Edmonds, 2005 .

Combinatorial Optimization -- Eureka, You Shrink!: Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers

Michael Jünger, Gerhard Reinelt, Giovanni Rinaldi, 2003 .

Lehman / s Switching Tutte and Game and a Theorem of Nash-Williams

Jack Edmonds, 2010 .

Lehmans switching game and a theorem of Tutte and Nash-Williams

Jack Edmonds, J. Edmonds, 1965 .

Total Dual Integrality of Linear Inequality Systems

Jack Edmonds, Rick Giles, J. Edmonds, 1984 .

Existence of k-edge connected ordinary graphs with prescribed degrees

Jack Edmonds, J. Edmonds, 1964 .