#6,608

Most Influential Person

Canadian mathematician and computer scientist

According to Wikipedia, Jack R. Edmonds is an American-born and educated computer scientist and mathematician who lived and worked in Canada for much of his life. He has made fundamental contributions to the fields of combinatorial optimization, polyhedral combinatorics, discrete mathematics and the theory of computing. He was the recipient of the 1985 John von Neumann Theory Prize.

- Paths, Trees, and Flowers (1965) (2352)
- Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems (1972) (2227)
- Maximum matching and a polyhedron with 0,1-vertices (1965) (1645)
- Submodular Functions, Matroids, and Certain Polyhedra (2001) (1118)
- Matching, Euler tours and the Chinese postman (1973) (916)
- Matroids and the greedy algorithm (1971) (771)
- A Min-Max Relation for Submodular Functions on Graphs (1977) (491)
- Minimum partition of a matroid into independent subsets (1965) (416)
- Systems of distinct representatives and linear algebra (1967) (335)
- A Combinatorial Decomposition Theory (1980) (304)
- Transversals and Matroid Partition (1965) (234)
- Matching: A Well-Solved Class of Integer Linear Programs (2001) (228)
- Matroid Intersection (139)
- Facets of I-matching polyhedra (1974) (125)
- Brick decompositions and the matching rank of graphs (1982) (113)
- Lehmans switching game and a theorem of Tutte and Nash-Williams (1965) (90)
- Packing and covering a tree by subtrees (1986) (63)
- Covers and packings in a family of sets (1962) (58)
- Existence of k-edge connected ordinary graphs with prescribed degrees (1964) (51)
- A note on perfect graphs (1986) (48)
- On the surface duality of linear graphs (1965) (46)
- Lambda composition (1997) (46)
- Total Dual Integrality of Linear Inequality Systems (1984) (39)
- Matroid Partition (2010) (34)
- A COMBINATORIAL REPRESENTATION FOR ORIENTED POLYHEDRAL SURFACES (1960) (32)
- Existentially Polytime Theorems (1990) (27)
- An introduction to matching (1967) (20)
- Some Well-Solved Problems in Combinatorial Optimization (1975) (19)
- Reductions to 1-matching polyhedra (1983) (17)
- Combinatorial Optimization -- Eureka, You Shrink!: Papers Dedicated to Jack Edmonds. 5th International Workshop, Aussois, France, March 5-9, 2001, Revised Papers (2003) (13)
- Coflow polyhedra (1992) (13)
- Some graphic uses of an even number of odd nodes (1999) (12)
- On Finding Another Room-Partitioning of the Vertices (2010) (12)
- Euler Complexes (2008) (9)
- Combinatorial Optimization — Eureka, You Shrink! (2003) (9)
- Lehman / s Switching Tutte and Game and a Theorem of Nash-Williams (2010) (9)
- Polyhedral polarity defined by a general bilinear inequality (1982) (7)
- The poset scheduling problem (1985) (6)
- Finding a Strong Stable Set or a Meyniel Obstruction in any Graph (2005) (5)
- Solutions: Solution to problem in number 4, p. 250 (1980) (4)
- Redundancy and Helly (2001) (4)
- Polarities Given by Systems of Bilinear Inequalities (1983) (4)
- A minor-monotone graph parameter based on oriented matroids (1997) (3)
- A case of non-convergent dual changes in assignment problems (1985) (2)
- Lifting the Facets of Polyhedra (1984) (2)
- The travelling preacher, projection, and a lower bound for the stability number of a graph (2008) (2)
- Exponentiality of the exchange algorithm for finding another room-partitioning (2014) (2)
- Rutcor Research Report RRR 18-2009 , On Scarf and Sperner Oiks (2009) (2)
- Colouring Some Classes of Perfect Graphs Robustly (2005) (1)
- A PPA parity theorem about trees in a bipartite graph (2020) (1)
- Games of no return a (2010) (1)
- THE DEGREE-CONSTRAINED SUBGRAPH PROBLEM (2015) (0)
- Optimum Antichain Unions (1980) (0)
- Euler Complexes (Oiks) (2010) (0)
- Branching Systems (2009) (0)
- More about Scarf and Sperner OIKs (2010) (0)
- Coflow in the traveling preacher problem (1994) (0)
- Eureka - you shrink!: surprise session for Jack Edmonds (2003) (0)
- On Finding Another (2008) (0)
- Combinatorial Decomposition and Graph Realizability (1980) (0)
- Advanced Problems: 5771-5776 (1971) (0)
- MATHEMATICAL RESEARCH RELATED TO INFORMATION SELECTION SYSTEMS (1961) (0)

This paper list is powered by the following services:

Jack Edmonds is affiliated with the following schools:

This website uses cookies to enhance the user experience. Read the Privacy Policy for more.

Subscribe To Newsletter?Yes!