D. R. Fulkerson

18.2k total citations · 4 hit papers
63 papers, 8.9k citations indexed

About

D. R. Fulkerson is a scholar working on Industrial and Manufacturing Engineering, Computational Theory and Mathematics and Management Science and Operations Research. According to data from OpenAlex, D. R. Fulkerson has authored 63 papers receiving a total of 8.9k indexed citations (citations by other indexed papers that have themselves been cited), including 15 papers in Industrial and Manufacturing Engineering, 14 papers in Computational Theory and Mathematics and 13 papers in Management Science and Operations Research. Recurrent topics in D. R. Fulkerson's work include Optimization and Mathematical Programming (10 papers), Digital Image Processing Techniques (9 papers) and graph theory and CDMA systems (9 papers). D. R. Fulkerson is often cited by papers focused on Optimization and Mathematical Programming (10 papers), Digital Image Processing Techniques (9 papers) and graph theory and CDMA systems (9 papers). D. R. Fulkerson collaborates with scholars based in United States. D. R. Fulkerson's co-authors include L. R. Ford, Oliver Gross, Lester R. Ford, George B. Dantzig, Jack Edmonds, Selmer Martin Johnson, H. J. Ryser, Alan J. Hoffman, M. H. McAndrew and Patrick J. Wolfe and has published in prestigious journals such as Econometrica, Management Science and Mathematics of Computation.

In The Last Decade

D. R. Fulkerson

56 papers receiving 7.8k citations

Hit Papers

align trajectories sort by overperformance

What are hit papers?

Hit papers significantly outperform the citation benchmark for their cohort. A paper qualifies if it has ≥500 total citations, achieves ≥1.5× the top-1% citation threshold for papers in the same subfield and year (this is the minimum needed to enter the top 1%, not the average within it), or reaches the top citation threshold in at least one of its specific research topics.

Flows in networks

1962 2.8k citations D. R. Fulkerson et al. profile →
Maximal Flow Through a Network

1956 1.4k citations L. R. Ford, D. R. Fulkerson Canadian Journal of Mathematics profile →
Incidence matrices and interval graphs

1965 702 citations D. R. Fulkerson, Oliver Gross Pacific Journal of Mathematics profile →
Flows in Networks

1963 540 citations D. R. Fulkerson et al. profile →

Peers — A (Enhanced Table)

Peers by citation overlap · career bar shows stage (early→late) cites · hero ref

Name	h						Papers	Cites
D. R. Fulkerson United States	29	2.7k	2.3k	1.6k	1.5k	1.1k	63	8.9k
Philip Wolfe United States	22	2.3k 0.8×	857 0.4×	1.7k 1.0×	695 0.5×	862 0.8×	48	8.5k
S. L. Hakimi United States	33	1.7k 0.6×	2.5k 1.1×	2.0k 1.3×	1.1k 0.7×	433 0.4×	122	7.6k
Thomas L. Magnanti United States	35	1.9k 0.7×	2.7k 1.2×	3.5k 2.2×	2.0k 1.4×	974 0.9×	92	10.9k
Martin Grötschel Germany	36	4.2k 1.5×	1.9k 0.8×	2.2k 1.4×	1.4k 1.0×	622 0.6×	107	8.4k
Ravindra K. Ahuja United States	37	1.9k 0.7×	2.9k 1.2×	2.9k 1.8×	1.6k 1.1×	962 0.9×	97	10.0k
James B. Orlin United States	45	3.0k 1.1×	3.9k 1.7×	3.3k 2.1×	2.0k 1.4×	1.4k 1.3×	156	12.4k
Alexander Schrijver Netherlands	39	6.2k 2.3×	2.8k 1.2×	1.9k 1.2×	2.1k 1.4×	862 0.8×	152	12.1k
Brian W. Kernighan United States	27	1.7k 0.6×	3.5k 1.5×	2.2k 1.4×	2.9k 1.9×	579 0.5×	82	11.8k
A. H. G. Rinnooy Kan Netherlands	38	1.2k 0.4×	2.0k 0.8×	5.6k 3.5×	408 0.3×	1.6k 1.5×	117	9.3k
Nimrod Megiddo United States	43	2.7k 1.0×	2.6k 1.1×	1000 0.6×	480 0.3×	1.0k 0.9×	150	8.5k

Countries citing papers authored by D. R. Fulkerson

Since Specialization

Citations

This map shows the geographic impact of D. R. Fulkerson'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 D. R. Fulkerson with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites D. R. Fulkerson more than expected).

Fields of papers citing papers by D. R. Fulkerson

Since Specialization

Physical SciencesHealth SciencesLife SciencesSocial Sciences

This network shows the impact of papers produced by D. R. Fulkerson. 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 D. R. Fulkerson. The network helps show where D. R. Fulkerson may publish in the future.

Co-authorship network of co-authors of D. R. Fulkerson

This figure shows the co-authorship network connecting the top 25 collaborators of D. R. Fulkerson. A scholar is included among the top collaborators of D. R. Fulkerson 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 D. R. Fulkerson. D. R. Fulkerson is excluded from the visualization to improve readability, since they are connected to all nodes in the network.

All Works

Sort: Min cites: Since: Top N: Style:

20 of 20 papers shown

1.

Ford, L. R. & D. R. Fulkerson. (2004). A Suggested Computation for Maximal Multi-Commodity Network Flows. Management Science. 50(12_supplement). 1778–1780. 128 indexed citations

2.

Fulkerson, D. R., Michel Balinski, & Alan J. Hoffman. (1978). Polyhedral combinatorics : dedicated to the memory of D. R. Fulkerson. North-Holland eBooks. 9 indexed citations

3.

Berge, Claude & D. R. Fulkerson. (1975). Studies in graph theory. 23 indexed citations

4.

Fulkerson, D. R., et al.. (1975). Blocking pairs of polyhedra arising from network flows. Journal of Combinatorial Theory Series B. 18(3). 265–283. 14 indexed citations

5.

Fulkerson, D. R.. (1972). Anti-blocking polyhedra. Journal of Combinatorial Theory Series B. 12(1). 50–71. 105 indexed citations

6.

Fulkerson, D. R., et al.. (1971). Disjoint common partial transversals of two families of sets. 2 indexed citations

7.

Fulkerson, D. R. & Lloyd S. Shapley. (1971). Minimal k‐arc connected graphs. Networks. 1(1). 91–98. 12 indexed citations

8.

Edmonds, Jack & D. R. Fulkerson. (1970). Bottleneck extrema. Journal of Combinatorial Theory. 8(3). 299–306. 142 indexed citations

9.

Fulkerson, D. R., et al.. (1968). Networks, frames, blocking systems. 6 indexed citations

10.

Fulkerson, D. R.. (1965). Upsets in Round Robin Tournaments. Canadian Journal of Mathematics. 17. 957–969. 23 indexed citations

11.

Fulkerson, D. R. & Oliver Gross. (1964). Incidence matrices with the consecutive 1’s property. Bulletin of the American Mathematical Society. 70(5). 681–684. 12 indexed citations

12.

Fulkerson, D. R. & Patrick J. Wolfe. (1962). An Algorithm for Scaling Matrices. SIAM Review. 4(2). 142–146. 33 indexed citations

13.

Fulkerson, D. R. & H. J. Ryser. (1960). Traces, Term Ranks, Widths and Heights. IBM Journal of Research and Development. 4(5). 455–459. 5 indexed citations

14.

Fulkerson, D. R.. (1960). Zero-one matrices with zero trace. Pacific Journal of Mathematics. 10(3). 831–836. 81 indexed citations

15.

Fulkerson, D. R.. (1959). Increasing the Capacity of a Network: The Parametric Budget Problem. Management Science. 5(4). 472–483. 38 indexed citations

16.

Fulkerson, D. R., et al.. (1958). A Suggested Computation for Maximal Multi-Commodity Network Flows. Management Science. 5(1). 97–101. 188 indexed citations

17.

Ford, L. R. & D. R. Fulkerson. (1957). A Simple Algorithm for Finding Maximal Network Flows and an Application to the Hitchcock Problem. Canadian Journal of Mathematics. 9. 210–218. 167 indexed citations

18.

Ford, L. R. & D. R. Fulkerson. (1957). Construction of maximal dynamic flows in networks.. 1 indexed citations

19.

Ford, L. R. & D. R. Fulkerson. (1954). Notes on Linear Programming: Part XX Maximal Flow Through a Network. 1 indexed citations

20.

Ford, L. R. & D. R. Fulkerson. (1954). Notes on Linear Programming. 2 indexed citations

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