Jack Edmonds - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 29 from 29

2021

Flash-Based Security Primitives: Evolution, Challenges and Future DirectionsHolden Gordon, Jack Edmonds, Soroor Ghandali, Wei Yan 0005, Nima Karimian, Fatemeh Tehranipoor. cryptography, 5(1):7, 2021. [doi]

2014

Exponentiality of the exchange algorithm for finding another room-partitioningJack Edmonds, Laura Sanità. DAM, 164:86-91, 2014. [doi]

2010

Euler Complexes (Oiks)Jack Edmonds. endm, 36:1289-1293, 2010. [doi]

Matroid PartitionJack Edmonds. In Michael Jünger, Thomas M. Liebling, Denis Naddef, George L. Nemhauser, William R. Pulleyblank, Gerhard Reinelt, Giovanni Rinaldi, Laurence A. Wolsey, editors, 50 Years of Integer Programming 1958-2008 - From the Early Years to the State-of-the-Art. pages 199-217, Springer, 2010. [doi]

Scarf OiksJack Edmonds, Stéphane Gaubert, Vladimir Gurvich. endm, 36:1281-1288, 2010. [doi]

Sperner OiksJack Edmonds, Stéphane Gaubert, Vladimir Gurvich. endm, 36:1273-1280, 2010. [doi]

On Finding Another Room-Partitioning of the VerticesJack Edmonds, Laura Sanità. endm, 36:1257-1264, 2010. [doi]

2009

Branching SystemsJack Edmonds. iwoca 2009: 1 [doi]

2008

The travelling preacher, projection, and a lower bound for the stability number of a graphKathie Cameron, Jack Edmonds. disopt, 5(2):290-292, 2008. [doi]

On Finding AnotherJack Edmonds. endm, 31:181-182, 2008. [doi]

Euler ComplexesJack Edmonds. bonnco 2009: 65-68 [doi]

2005

Colouring Some Classes of Perfect Graphs RobustlyKathie Cameron, Jack Edmonds. endm, 22:553-556, 2005. [doi]

2001

Submodular Functions, Matroids, and Certain PolyhedraJack Edmonds. aussois 2003: 11-26 [doi]

Matching: A Well-Solved Class of Integer Linear ProgramsJack Edmonds, Ellis L. Johnson. aussois 2003: 27-30 [doi]

Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJack Edmonds, Richard M. Karp. aussois 2003: 31-33 [doi]

Redundancy and HellyJack Edmonds. ejc, 22(5):679-685, 2001. [doi]

1999

Some Graphic Uses of an Even Number of Odd NodesKathie Cameron, Jack Edmonds. soda 1999: 872 [doi]

1997

Lambda compositionKathie Cameron, Jack Edmonds. jgt, 26(1):9-16, 1997. [doi]

A minor-monotone graph parameter based on oriented matroidsJack Edmonds, Monique Laurent, Alexander Schrijver. DM, 165-166:219-226, 1997. [doi]

1992

Coflow polyhedraKathie Cameron, Jack Edmonds. DM, 101(1-3):1-21, 1992. [doi]

1990

Existentially Polytime TheoremsKathie Cameron, Jack Edmonds. dimacs 1990: 83-100

1986

Packing and covering a tree by subtreesImre Bárány, Jack Edmonds, Laurence A. Wolsey. combinatorica, 6(3):221-233, 1986.

1985

A case of non-convergent dual changes in assignment problemsJulián Aráoz, Jack Edmonds. DAM, 11(2):95-102, 1985. [doi]

1983

Reductions to 1-matching polyhedraJuláan Aráoz, William H. Cunningham, Jack Edmonds, Jan Green-Krótki. networks, 13(4):455-473, 1983. [doi]

Polarities Given by Systems of Bilinear InequalitiesJulián Aráoz, Jack Edmonds, Victor J. Griffin. mor, 8(1):34-41, 1983. [doi]

1982

Polyhedral polarity defined by a general bilinear inequalityVictor Griffin, Julián Aráoz, Jack Edmonds. mp, 23(1):117-137, 1982. [doi]

1973

Matching, Euler tours and the Chinese postmanJack Edmonds, Ellis L. Johnson. mp, 5(1):88-124, 1973. [doi]

1972

Theoretical Improvements in Algorithmic Efficiency for Network Flow ProblemsJack Edmonds, Richard M. Karp. JACM, 19(2):248-264, 1972. [doi]

1971

Matroids and the greedy algorithmJack Edmonds. mp, 1(1):127-136, 1971. [doi]

Sign in or sign up to see more results.

runs on WebDSL