Jack Edmonds

According to our database1, Jack Edmonds authored at least 29 papers between 1971 and 2014.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2014
Exponentiality of the exchange algorithm for finding another room-partitioning.
Discret. Appl. Math., 2014

2010
On Finding Another Room-Partitioning of the Vertices.
Electron. Notes Discret. Math., 2010

Scarf Oiks.
Electron. Notes Discret. Math., 2010

Sperner Oiks.
Electron. Notes Discret. Math., 2010

Euler Complexes (Oiks).
Electron. Notes Discret. Math., 2010

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

2009
Branching Systems.
Proceedings of the Combinatorial Algorithms, 20th International Workshop, 2009

2008
On Finding Another.
Electron. Notes Discret. Math., 2008

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

Euler Complexes.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2005
Colouring Some Classes of Perfect Graphs Robustly.
Electron. Notes Discret. Math., 2005

Coloring vertices of a graph or finding a Meyniel obstruction
CoRR, 2005

2001
Redundancy and Helly.
Eur. J. Comb., 2001

Matching: A Well-Solved Class of Integer Linear Programs.
Proceedings of the Combinatorial Optimization, 2001

Submodular Functions, Matroids, and Certain Polyhedra.
Proceedings of the Combinatorial Optimization, 2001

1999
Some Graphic Uses of an Even Number of Odd Nodes.
Proceedings of the Tenth Annual ACM-SIAM Symposium on Discrete Algorithms, 1999

1997
Lambda composition.
J. Graph Theory, 1997

A minor-monotone graph parameter based on oriented matroids.
Discret. Math., 1997

1992
Coflow polyhedra.
Discret. Math., 1992

1990
Existentially Polytime Theorems.
Proceedings of the Polyhedral Combinatorics, 1990

1986
Packing and covering a tree by subtrees.
Comb., 1986

1985
A case of non-convergent dual changes in assignment problems.
Discret. Appl. Math., 1985

1983
Reductions to 1-matching polyhedra.
Networks, 1983

Polarities Given by Systems of Bilinear Inequalities.
Math. Oper. Res., 1983

1982
Polyhedral polarity defined by a general bilinear inequality.
Math. Program., 1982

Brick decompositions and the matching rank of graphs.
Comb., 1982

1973
Matching, Euler tours and the Chinese postman.
Math. Program., 1973

1972
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems.
J. ACM, 1972

1971
Matroids and the greedy algorithm.
Math. Program., 1971


  Loading...