Jack Edmonds

15.6k citations
62 papers · 10.2k · 7 hit papers · h-index 27

Impact in

Papers in

Jack Edmonds

60 papers receiving 9.4k citations

Jack Edmonds's Hit Papers

Paths, Trees, and Flowers 2009 · 619 citations
6190+20+40Years since publication50010001.5k

Peers

Jack Edmonds
Comparison fields: 5 of 164
  • Computational Theory and Mathematics 5.5k
  • Discrete Mathematics and Combinatorics 918
  • Computer Graphics and Computer-Aided Design 874
  • Industrial and Manufacturing Engineering 1.5k
  • Computer Networks and Communications 2.9k
Replace Vašek Chvátal with:
Vašek Chvátal Canada
Martin Grötschel Germany
ALAN M. FRIEZE United States
Martin Dyer United Kingdom
D. R. Fulkerson United States
Uriel Feige Israel
Vijay V. Vazirani United States
Alexander Schrijver Netherlands
Shimon Even Israel
Mihalis Yannakakis United States
Jack Edmonds relative to Vašek Chvátal Canada Vašek Chvátal's profile →
Citations per field
00.5×1.5×
Vašek Chvátal · 1×
Citations per year

Countries citing papers authored by Jack Edmonds

Since Specialization
Citations

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

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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.

Border = papers with Jack Edmonds Line = papers co-authored together Jack Edmonds links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 62 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 →
19721795
2
Paths, Trees, and Flowers
Hit paper breakdown →
19651692
3
Maximum matching and a polyhedron with 0,1-vertices
Hit paper breakdown →
19651198
4
Matching, Euler tours and the Chinese postman
Hit paper breakdown →
1973741
5
Paths, Trees, and Flowers
Hit paper breakdown →
2009619
6
Matroids and the greedy algorithm
Hit paper breakdown →
1971601
7 1967536
8 1977368
9
Submodular functions, matroids and certain polyhedra
Hit paper breakdown →
2003329
10 1965304
11 2003293
12 1967258
13 1980217
14 1965194
15 1970184
16 1979114
17 1974105
18 198284
19 196578
20 196273

About Jack Edmonds

Jack Edmonds is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Numerical Analysis, Geometry and Topology and Management Science and Operations Research, having authored 62 papers that have together received 10.2k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (26 papers), Graph Labeling and Dimension Problems (8 papers), Complexity and Algorithms in Graphs (8 papers), Advanced Algebra and Logic (6 papers), Advanced Optimization Algorithms Research (6 papers), Game Theory and Applications (5 papers), Optimization and Search Problems (5 papers) and Constraint Satisfaction and Optimization (5 papers). The work is most often cited by research in Computational Theory and Mathematics (5.5k citations), Discrete Mathematics and Combinatorics (918 citations), Computer Graphics and Computer-Aided Design (874 citations), Industrial and Manufacturing Engineering (1.5k citations) and Computer Networks and Communications (2.9k citations). Jack Edmonds has collaborated with scholars based in Canada, United States and France. Frequent co-authors include Richard M. Karp, Ellis L. Johnson, Rick Giles, William H. Cunningham, D. R. Fulkerson, William R. Pulleyblank, Kathie Cameron, László Lovász, Imre Bárány and Laurence A. Wolsey. Their work appears in journals such as Discrete Applied Mathematics, Mathematical Programming, Canadian Journal of Mathematics, COMBINATORICA and Discrete Mathematics.

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.

Explore authors with similar magnitude of impact