Bruce Reed
Impact in
-
- Limits and Structures in Graph Theory
- Computational Theory and Mathematics top 0.05%
- Advanced Graph Theory Research
- Graph Labeling and Dimension Problems
- Complexity and Algorithms in Graphs
Papers in ⓘ
-
- Advanced Graph Theory Research 119
- Graph Labeling and Dimension Problems 52
- Complexity and Algorithms in Graphs 33
-
- Limits and Structures in Graph Theory 76
- Co-authors
- Michael Molloy (18 shared papers)Colin McDiarmid (20 shared papers)Ken‐ichi Kawarabayashi (17 shared papers)Dan Mungas (7 shared papers)William J. Jagust (3 shared papers)Adrian Vetta (6 shared papers)Helena C. Chui (2 shared papers)Paul Seymour (9 shared papers)
- Journals
- Journal of Combinatorial Theory Series B (20 papers)Combinatorics Probability Computing (10 papers)Discrete Mathematics (9 papers)Journal of Graph Theory (8 papers)Random Structures and Algorithms (8 papers)
- Partner nations
- CanadaFranceUnited States
In The Last Decade
Bruce Reed
156 papers receiving 5.6k citations
Hit Papers
Peers
Comparison fields: 5 of 164
- Discrete Mathematics and Combinatorics 1.5k
- Computational Theory and Mathematics 2.8k
- Statistical and Nonlinear Physics 1.5k
- Geometry and Topology 684
- Mathematical Physics 517
Countries citing papers authored by Bruce Reed
This map shows the geographic impact of Bruce Reed'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 Bruce Reed with the expected number of citations based on a country's size and research output (numbers larger than one mean the country cites Bruce Reed more than expected).
Fields of papers citing papers by Bruce Reed
This network shows the impact of papers produced by Bruce Reed. 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 Bruce Reed. The network helps show where Bruce Reed may publish in the future.
Co-authors
The 25 scholars most cited alongside Bruce Reed, linked wherever they have co-authored with each other. Click a name or a connecting line to browse the papers they share.
All Works
Showing the 20 most-cited of 162 papers — load more, or switch the sort, to bring in the rest.
| # | Work | ||
|---|---|---|---|
| 1 | A critical point for random graphs with a given degree sequence Hit paper breakdown → | 1995 | 1422 |
| 2 | The Size of the Giant Component of a Random Graph with a Given Degree Sequence Hit paper breakdown → | 1998 | 492 |
| 3 | 2004 | 218 | |
| 4 | 2013 | 209 | |
| 5 | 1998 | 194 | |
| 6 | 2004 | 161 | |
| 7 | 2002 | 158 | |
| 8 | 1991 | 150 | |
| 9 | Graph Colouring and the Probabilistic Method | 2001 | 146 |
| 10 | 2014 | 130 | |
| 11 | 1998 | 113 | |
| 12 | 1996 | 111 | |
| 13 | 1992 | 106 | |
| 14 | 1997 | 97 | |
| 15 | 2011 | 80 | |
| 16 | 1996 | 64 | |
| 17 | 2012 | 62 | |
| 18 | 2004 | 61 | |
| 19 | 2000 | 59 | |
| 20 | 1998 | 57 |
About Bruce Reed
Bruce Reed 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 162 papers that have together received 5.9k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (119 papers), Limits and Structures in Graph Theory (76 papers), Graph Labeling and Dimension Problems (52 papers), Complexity and Algorithms in Graphs (33 papers), graph theory and CDMA systems (23 papers), Graph theory and applications (21 papers), Computational Geometry and Mesh Generation (14 papers) and Interconnection Networks and Systems (12 papers). The work is most often cited by research in Discrete Mathematics and Combinatorics (1.5k citations), Computational Theory and Mathematics (2.8k citations), Statistical and Nonlinear Physics (1.5k citations), Geometry and Topology (684 citations) and Mathematical Physics (517 citations). Bruce Reed has collaborated with scholars based in Canada, France and United States. Frequent co-authors include Michael Molloy, Colin McDiarmid, Ken‐ichi Kawarabayashi, Dan Mungas, William J. Jagust, Adrian Vetta, Helena C. Chui, Paul Seymour, Alan Frieze and Vašek Chvátal. Their work appears in journals such as Journal of Combinatorial Theory Series B, Combinatorics Probability Computing, Discrete Mathematics, Journal of Graph Theory and Random Structures and Algorithms.
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.