F. Bruce Shepherd

3.0k citations
80 papers · 1.7k · 1 hit paper · h-index 22

Impact in

Papers in

F. Bruce Shepherd

78 papers receiving 1.6k citations

F. Bruce Shepherd's Hit Papers

The stable paths problem and interdomain routing 2002 · 349 citations
3490+8+16Years since publication100200300

Peers

F. Bruce Shepherd
Comparison fields: 5 of 63
  • Computational Theory and Mathematics 870
  • Computer Networks and Communications 1.2k
  • Discrete Mathematics and Combinatorics 116
  • Computer Graphics and Computer-Aided Design 70
  • Hardware and Architecture 130
Replace Fabrizio Grandoni with:
Fabrizio Grandoni Switzerland
Julia Chuzhoy United States
Mohammad Taghi Hajiaghayi United States
Peter J. Slater United States
Olivier Hudry France
Marco Protasi Italy
Mohammad R. Salavatipour Canada
Giorgio Gambosi Italy
Hadas Shachnai Israel
Jacobo Valdes United States
F. Bruce Shepherd relative to Fabrizio Grandoni Switzerland Fabrizio Grandoni's profile →
Citations per field
00.5×1.5×2.2×
Fabrizio Grandoni · 1×
Citations per year

Countries citing papers authored by F. Bruce Shepherd

Since Specialization
Citations

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

Fields of papers citing papers by F. Bruce Shepherd

Since Specialization
Physical SciencesHealth SciencesLife SciencesSocial Sciences

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

Co-authors

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

All Works

20 of 20 papers shown

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

#Work
1
The stable paths problem and interdomain routing
Hit paper breakdown →
2002349
2 1989102
3 200391
4 199980
5 200570
6 200266
7 200760
8 200559
9 200459
10
200652
11 200742
12 200339
13 199538
14 198537
15 200434
16 200333
17 201331
18 199126
19 199425
20 200624

About F. Bruce Shepherd

F. Bruce Shepherd is a scholar working on Computational Theory and Mathematics, Computer Networks and Communications, Electrical and Electronic Engineering, Industrial and Manufacturing Engineering and Discrete Mathematics and Combinatorics, having authored 80 papers that have together received 1.7k indexed citations. Recurring topics across this work include Advanced Graph Theory Research (49 papers), Complexity and Algorithms in Graphs (43 papers), Optimization and Search Problems (21 papers), Advanced Optical Network Technologies (11 papers), Vehicle Routing Optimization Methods (7 papers), Network Traffic and Congestion Control (7 papers), graph theory and CDMA systems (7 papers) and Cooperative Communication and Network Coding (5 papers). The work is most often cited by research in Computational Theory and Mathematics (870 citations), Computer Networks and Communications (1.2k citations), Discrete Mathematics and Combinatorics (116 citations), Computer Graphics and Computer-Aided Design (70 citations) and Hardware and Architecture (130 citations). F. Bruce Shepherd has collaborated with scholars based in Canada, United States and United Kingdom. Frequent co-authors include Gordon Wilfong, Timothy G. Griffin, Chandra Chekuri, Sanjeev Khanna, William McCuaig, Rajmohan Rajaraman, Venkatesan Guruswami, Mihalis Yannakakis, Gianpaolo Oriolo and E. J. Cockayne. Their work appears in journals such as SIAM Journal on Discrete Mathematics, Mathematical Programming, Mathematics of Operations Research, Journal of Combinatorial Theory Series B and Journal of Graph Theory.

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