L. R. Ford
- Computer Networks and Communications top 2%
- Computational Theory and Mathematics top 1%
- Electrical and Electronic Engineering top 10%
- Control and Systems Engineering top 5%
- Industrial and Manufacturing Engineering top 1%
- Topics
- Optimization and Mathematical Programming (5 papers)Transportation Planning and Optimization (3 papers)Optimization and Search Problems (2 papers)
- Partner nations
- United States
In The Last Decade
L. R. Ford
16 papers receiving 2.3k citations
Hit Papers
Peers
Comparison fields: 5 of 139
- Computer Networks and Communications 790
- Computational Theory and Mathematics 538
- Electrical and Electronic Engineering 400
- Control and Systems Engineering 360
- Industrial and Manufacturing Engineering 333
Countries citing papers authored by L. R. Ford
This map shows the geographic impact of L. R. Ford'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 L. R. Ford with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites L. R. Ford more than expected).
Fields of papers citing papers by L. R. Ford
This network shows the impact of papers produced by L. R. Ford. 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 L. R. Ford. The network helps show where L. R. Ford may publish in the future.
Co-authorship network of co-authors of L. R. Ford
This figure shows the co-authorship network connecting the top 25 collaborators of L. R. Ford. A scholar is included among the top collaborators of L. R. Ford 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 L. R. Ford. L. R. Ford is excluded from the visualization to improve readability, since they are connected to all nodes in the network.
All Works
| # | Work | Indexed citations |
|---|---|---|
| 1 | Flows in Networks | 188 |
| 2 | 128 | |
| 3 | 37 | |
| 4 | 5 | |
| 5 | 19 | |
| 6 | 308 | |
| 7 | 28 | |
| 8 | 167 | |
| 9 | 53 | |
| 10 | 126 | |
| 11 | 5 | |
| 12 | Construction of maximal dynamic flows in networks. | 1 |
| 13 | Notes on Linear Programming: Part XXXIV A Primal Dual Algorithm for the Capacitated Hitchcock Problem | 1 |
| 14 | 103 | |
| 15 | Notes on Linear Programming — Part XXXII: Solving the Transportation Problem | 3 |
| 16 | Notes on Linear Programming — Part XXXI: A Primal — Dual Algorithm | 1 |
| 17 | Maximal Flow Through a Networkbreakdown → | 1352 |
| 18 | Notes on Linear Programming: Part XXIX A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem | 2 |
| 19 | Notes on Linear Programming: Part XX Maximal Flow Through a Network | 1 |
| 20 | Notes on Linear Programming | 2 |
About L. R. Ford
L. R. Ford is a scholar working on Transportation, Numerical Analysis and Control and Systems Engineering, having authored 20 papers that have together received 2.5k indexed citations. Recurring topics across this work include Optimization and Mathematical Programming (5 papers), Transportation Planning and Optimization (3 papers) and Optimization and Search Problems (2 papers). The work is most often cited by research in Transportation (263 citations), Computer Networks and Communications (790 citations) and Computational Theory and Mathematics (538 citations). L. R. Ford has collaborated with scholars based in United States. Frequent co-authors include D. R. Fulkerson, Martin J. Beckmann, Frank Harary and George B. Dantzig. Their work appears in journals such as Econometrica, Management Science and Mathematics of Computation.
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.