Jack Edmonds
- Computational Theory and Mathematics top 0.05%
- Computer Networks and Communications top 0.5%
- Electrical and Electronic Engineering top 5%
- Artificial Intelligence top 1%
- Industrial and Manufacturing Engineering top 0.2%
- Co-authors
- Richard M. KarpEllis L. JohnsonWilliam H. CunninghamD. R. FulkersonKathie CameronLászló LovászWilliam R. PulleyblankImre Bárány
- Topics
- Advanced Graph Theory Research (23 papers)Graph Labeling and Dimension Problems (8 papers)Complexity and Algorithms in Graphs (7 papers)
- Cited by
- Computational Theory and MathematicsDiscrete Mathematics and CombinatoricsComputer Graphics and Computer-Aided Design
- Partner nations
- CanadaUnited StatesFrance
In The Last Decade
Jack Edmonds
40 papers receiving 6.3k citations
Hit Papers
Peers
Comparison fields: 5 of 162
- Computational Theory and Mathematics 3.4k
- Computer Networks and Communications 2.0k
- Electrical and Electronic Engineering 1.1k
- Artificial Intelligence 1.1k
- Industrial and Manufacturing Engineering 1.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-authorship network of co-authors of Jack Edmonds
This figure shows the co-authorship network connecting the top 25 collaborators of Jack Edmonds. A scholar is included among the top collaborators of Jack Edmonds based on the total number of citations received by their joint publications. Widths of edges represent the number of papers authors have co-authored together. Node borders signify the number of papers an author published with Jack Edmonds. Jack Edmonds is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | 1 | |
| 2 | 0 | |
| 3 | 1 | |
| 4 | 1 | |
| 5 | 1 | |
| 6 | 2 | |
| 7 | 8 | |
| 8 | 5 | |
| 9 | 37 | |
| 10 | 23 | |
| 11 | 4 | |
| 12 | Matching, Euler tours and the Chinese postmanbreakdown → | 583 |
| 13 | Matroids and the greedy algorithmbreakdown → | 473 |
| 14 | 142 | |
| 15 | 154 | |
| 16 | 61 | |
| 17 | 7 | |
| 18 | Paths, Trees, and Flowersbreakdown → | 1292 |
| 19 | 251 | |
| 20 | 37 |
About Jack Edmonds
Jack Edmonds is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics and Computer Graphics and Computer-Aided Design, having authored 42 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) and Complexity and Algorithms in Graphs (7 papers). The work is most often cited by research in Computational Theory and Mathematics (3.4k citations), Discrete Mathematics and Combinatorics (632 citations) and Computer Graphics and Computer-Aided Design (514 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 Journal of the ACM, Mathematical Programming and Mathematics of Operations Research.
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.