Jack Edmonds
Impact in
- Computational Theory and Mathematics top 0.05%
- Advanced Graph Theory Research
- Complexity and Algorithms in Graphs
-
- Limits and Structures in Graph Theory
Papers in
-
- Advanced Graph Theory Research 23
- Graph Labeling and Dimension Problems 8
- Complexity and Algorithms in Graphs 7
- Advanced Algebra and Logic 4
-
- Optimization and Search Problems 5
- Co-authors
- Richard M. Karp (1 shared paper)Ellis L. Johnson (1 shared paper)William H. Cunningham (2 shared papers)D. R. Fulkerson (1 shared paper)Kathie Cameron (8 shared papers)László Lovász (3 shared papers)William R. Pulleyblank (1 shared paper)Imre Bárány (1 shared paper)
- Journals
- Mathematical Programming (3 papers)Canadian Journal of Mathematics (2 papers)Discrete Mathematics (2 papers)Discrete Applied Mathematics (2 papers)COMBINATORICA (2 papers)
- Partner nations
- CanadaUnited StatesFrance
In The Last Decade
Jack Edmonds
43 papers receiving 6.3k citations
Jack Edmonds's Hit Papers
Peers
Comparison fields: 5 of 161
- Computational Theory and Mathematics 3.4k
- Discrete Mathematics and Combinatorics 636
- Computer Graphics and Computer-Aided Design 520
- Industrial and Manufacturing Engineering 1.0k
- Computer Networks and Communications 2.0k
Countries citing papers authored by Jack Edmonds
This map shows the geographic impact of Jack Edmonds's research. It shows the number of citations coming from papers published by authors working in each country. You can also color the map by specialization and compare the number of citations received by Jack Edmonds with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Jack Edmonds more than expected).
Fields of papers citing papers by Jack Edmonds
This network shows the impact of papers produced by Jack Edmonds. Nodes represent research fields, and links connect fields that are likely to share authors. Colored nodes show fields that tend to cite the papers produced by Jack Edmonds. The network helps show where Jack Edmonds may publish in the future.
Co-authors
The 25 scholars most cited alongside Jack Edmonds, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 45 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems Hit paper breakdown → | 1972 | 1528 |
| 2 | Paths, Trees, and Flowers Hit paper breakdown → | 1965 | 1308 |
| 3 | Maximum matching and a polyhedron with 0,1-vertices Hit paper breakdown → | 1965 | 965 |
| 4 | Matching, Euler tours and the Chinese postman Hit paper breakdown → | 1973 | 585 |
| 5 | Matroids and the greedy algorithm Hit paper breakdown → | 1971 | 476 |
| 6 | 1967 | 425 | |
| 7 | Submodular Functions, Matroids, and Certain Polyhedra. | 2001 | 300 |
| 8 | 1965 | 251 | |
| 9 | 1967 | 195 | |
| 10 | 1980 | 164 | |
| 11 | 1965 | 156 | |
| 12 | 1970 | 143 | |
| 13 | 1982 | 69 | |
| 14 | 1965 | 61 | |
| 15 | 1962 | 60 | |
| 16 | 1986 | 37 | |
| 17 | 1997 | 37 | |
| 18 | 1964 | 37 | |
| 19 | 1965 | 28 | |
| 20 | 1986 | 23 |
About Jack Edmonds
Jack Edmonds is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Discrete Mathematics and Combinatorics, Geometry and Topology and Artificial Intelligence, having authored 45 papers that have together received 6.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (23 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (7 papers), Optimization and Search Problems (5 papers), Graph theory and applications (4 papers), Game Theory and Applications (4 papers), Advanced Algebra and Logic (4 papers) and Computational Geometry and Mesh Generation (4 papers). The work is most often cited by research in Computational Theory and Mathematics (3.4k citations), Discrete Mathematics and Combinatorics (636 citations), Computer Graphics and Computer-Aided Design (520 citations), Industrial and Manufacturing Engineering (1.0k citations) and Computer Networks and Communications (2.0k citations). Jack Edmonds has collaborated with scholars based in Canada, United States and France. Frequent co-authors include Richard M. Karp, Ellis L. Johnson, William H. Cunningham, D. R. Fulkerson, Kathie Cameron, László Lovász, William R. Pulleyblank, Imre Bárány, Laurence A. Wolsey and Gerard J. Chang. Their work appears in journals such as Mathematical Programming, Canadian Journal of Mathematics, Discrete Mathematics, Discrete Applied Mathematics and COMBINATORICA.
Rankless uses publication and citation data sourced from OpenAlex, an open and comprehensive bibliographic database. While OpenAlex provides broad and valuable coverage of the global research landscape, it—like all bibliographic datasets—has inherent limitations. These include incomplete records, variations in author disambiguation, differences in journal indexing, and delays in data updates. As a result, some metrics and network relationships displayed in Rankless may not fully capture the entirety of a scholar's output or impact.