Jack Edmonds

From MaRDI portal
Person:204137

Available identifiers

zbMath Open edmonds.jack-rDBLP95/5373WikidataQ92866 ScholiaQ92866MaRDI QIDQ204137

List of research outcomes





PublicationDate of PublicationType
A PPA parity theorem about trees in a bipartite graph2022-01-05Paper
Understanding PPA-completeness2020-10-23Paper
Understanding PPA-completeness2017-10-10Paper
Euler Complexes2017-04-07Paper
Exponentiality of the exchange algorithm for finding another room-partitioning2015-09-22Paper
On finding another room-partitioning of the vertices2013-11-08Paper
Sperner oiks2013-11-08Paper
Scarf oiks2013-11-08Paper
Euler complexes (oiks)2013-11-08Paper
https://portal.mardi4nfdi.de/entity/Q35766892010-07-30Paper
Matroid Partition2010-06-03Paper
The travelling preacher, projection, and a lower bound for the stability number of a graph2008-10-29Paper
Colouring Some Classes of Perfect Graphs Robustly2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q44146332003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44146322003-07-25Paper
https://portal.mardi4nfdi.de/entity/Q44146342003-07-25Paper
Redundancy and Helly2003-03-26Paper
Some graphic uses of an even number of odd nodes1999-07-12Paper
Lambda composition1997-12-07Paper
A minor-monotone graph parameter based on oriented matroids1997-06-10Paper
Coflow polyhedra1993-01-16Paper
https://portal.mardi4nfdi.de/entity/Q33484341990-01-01Paper
A note on perfect graphs1986-01-01Paper
The poset scheduling problem1985-01-01Paper
A case of non-convergent dual changes in assignment problems1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32203571984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32203551984-01-01Paper
Reductions to 1–matching polyhedra1983-01-01Paper
Polarities Given by Systems of Bilinear Inequalities1983-01-01Paper
Brick decompositions and the matching rank of graphs1982-01-01Paper
Polyhedral polarity defined by a general bilinear inequality1982-01-01Paper
A Combinatorial Decomposition Theory1980-01-01Paper
Matroid Intersection1979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38709421979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41494761977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40706241975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40780691974-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41217131974-01-01Paper
Matching, Euler tours and the Chinese postman1973-01-01Paper
Matroid designs1973-01-01Paper
Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems1972-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40684421972-01-01Paper
Matroids and the greedy algorithm1971-01-01Paper
Bottleneck extrema1970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56846981970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56755431970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40780511970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q56613401970-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55938281968-01-01Paper
https://portal.mardi4nfdi.de/entity/Q55956481968-01-01Paper
Systems of distinct representatives and linear algebra1967-01-01Paper
Paths, Trees, and Flowers1965-01-01Paper
Transversals and matroid partition1965-01-01Paper
Maximum matching and a polyhedron with 0,1-vertices1965-01-01Paper
Minimum partition of a matroid into independent subsets1965-01-01Paper
Lehmans switching game and a theorem of Tutte and Nash-Williams1965-01-01Paper
On the surface duality of linear graphs1965-01-01Paper
Existence of k-edge connected ordinary graphs with prescribed degrees1964-01-01Paper
Covers and packings in a family of sets1962-01-01Paper

Research outcomes over time

This page was built for person: Jack Edmonds