Ronald Graham

170 papers receiving 11.0k citations

Ronald Graham's Hit Papers

Handbook of Combinatorics 1995 · 975 citations
9750+20+40Years since publication4008001.2k

Peers

Ronald Graham
Comparison fields: 5 of 191
  • Discrete Mathematics and Combinatorics 2.8k
  • Computer Graphics and Computer-Aided Design 935
  • Computational Theory and Mathematics 4.2k
  • Geometry and Topology 2.2k
  • Algebra and Number Theory 974
Replace N. J. A. Sloane with:
N. J. A. Sloane United States
László Lovász Hungary
Harald Niederreiter Austria
Noga Alon Israel
U. S. R. Murty Canada
Alexander Schrijver Netherlands
Fan Chung United States
J. A. Bondy Canada
Béla Bollobás United States
John E. Hopcroft United States
Ronald Graham relative to N. J. A. Sloane United States N. J. A. Sloane's profile →
Citations per field
00.5×1.5×2.0×
N. J. A. Sloane · 1×
Citations per year

Countries citing papers authored by Ronald Graham

Since Specialization
Citations

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

Fields of papers citing papers by Ronald Graham

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

The 25 scholars most cited alongside Ronald Graham, 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 Ronald Graham Line = papers co-authored together Ronald Graham links everyone, so they are left out of the graph.

All Works

20 of 20 papers shown

Showing the 20 most-cited of 177 papers — load more, or switch the sort, to bring in the rest.

#Work
1
Concrete Mathematics: A Foundation for Computer Science
Hit paper breakdown →
19891464
2
An efficient algorith for determining the convex hull of a finite planar set
Hit paper breakdown →
19721106
3
Concrete Mathematics: A Foundation for Computer Science.
Hit paper breakdown →
1991989
4
Bounds for Certain Multiprocessing Anomalies
Hit paper breakdown →
1966982
5
Handbook of Combinatorics
Hit paper breakdown →
1995975
6
Ramsey Theory
Hit paper breakdown →
1990588
7 1985478
8 1972386
9 1977336
10 1983275
11
Old and new problems and results in combinatorial number theory
1980237
12 2013219
13 1989215
14 1978188
15 1986137
16 1978125
17 1990107
18 1972105
19 1985104
20 1971103

About Ronald Graham

Ronald Graham is a scholar working on Computational Theory and Mathematics, Discrete Mathematics and Combinatorics, Geometry and Topology, Electrical and Electronic Engineering and Computer Networks and Communications, having authored 177 papers that have together received 12.2k indexed citations. Recurring topics across this work include Limits and Structures in Graph Theory (45 papers), Advanced Graph Theory Research (37 papers), Advanced Topology and Set Theory (23 papers), graph theory and CDMA systems (22 papers), VLSI and FPGA Design Techniques (21 papers), Interconnection Networks and Systems (20 papers), Graph Labeling and Dimension Problems (17 papers) and Computational Geometry and Mesh Generation (10 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (2.8k citations), Computer Graphics and Computer-Aided Design (935 citations), Computational Theory and Mathematics (4.2k citations), Geometry and Topology (2.2k citations) and Algebra and Number Theory (974 citations). Ronald Graham has collaborated with scholars based in United States, Hungary and Czechia. Frequent co-authors include Oren Patashnik, Donald E. Knuth, Fan Chung, Stanley Yung‐Chuan Liu, Martin Grötschel, László Lovász, Edward A. Bender, Pavol Hell, M. R. Garey and E. G. Coffman. Their work appears in journals such as Journal of Combinatorial Theory Series A, Discrete Mathematics, Journal of Graph Theory, Discrete & Computational Geometry and The Electronic Journal of Combinatorics.

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