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.
A critical point for random graphs with a given degree sequence
19951.4k citationsMichael Molloy, Bruce Reedprofile →
The Size of the Giant Component of a Random Graph with a Given Degree Sequence
1998492 citationsMichael Molloy, Bruce Reedprofile →
Peers — A (Enhanced Table)
Peers by citation overlap · career bar shows stage (early→late)
cites ·
hero ref
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).
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-authorship network of co-authors of Bruce Reed
This figure shows the co-authorship network connecting the top 25 collaborators of Bruce Reed.
A scholar is included among the top collaborators of Bruce Reed 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 Bruce Reed. Bruce Reed is excluded from
the visualization to improve readability, since they are connected to all nodes in the network.
Chudnovsky, Maria, Bruce Reed, & Paul Seymour. (2010). The edge-density for K2,t minors. Journal of Combinatorial Theory Series B. 101(1). 18–46.19 indexed citations
Havet, Frédéric, Bruce Reed, & Jean‐Sébastien Sereni. (2008). L(2,1)-labelling of graphs. HAL (Le Centre pour la Communication Scientifique Directe). 621–630.16 indexed citations
7.
Kawarabayashi, Ken‐ichi & Bruce Reed. (2008). A nearly linear time algorithm for the half integral disjoint paths packing. Symposium on Discrete Algorithms. 446–454.13 indexed citations
Addario‐Berry, Louigi, Maria Chudnovsky, Frédéric Havet, Bruce Reed, & Paul Seymour. (2008). Bisimplicial vertices in even-hole-free graphs. Journal of Combinatorial Theory Series B. 98(6). 1119–1164.30 indexed citations
Karp, Richard M. & Bruce Reed. (1995). When is the Assignment Bound Tight for the Asymmetric Traveling-Salesman Problem.9 indexed citations
17.
Frieze, Alan & Bruce Reed. (1993). Polychromatic Hamilton cycles. Discrete Mathematics. 118(1-3). 69–74.31 indexed citations
18.
Reed, Bruce, et al.. (1991). Induced circuits in planar graphs. Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands. 1–6.1 indexed citations
19.
McDiarmid, Colin, Bruce Reed, Alexander Schrijver, & F. Bruce Shepherd. (1991). Non-interfering dipaths in planar digraphs. 1–7.4 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.