Author

F. Bruce Shepherd

Observed names: B Shepherd, B. Shepherd, Bruce Shepherd, F B. Shepherd, F. B. Shepherd, F. Bruce Shepherd, F.B. Shepherd, F.Bruce Shepherd, Shepherd, Bruce, Shepherd, F. B., Shepherd, F. Bruce

Institution: University of British Columbia

Observed institutions: AT&T (United States), Microsoft (United States), Centrum Wiskunde & Informatica, University of Bonn, University of British Columbia, University of Waterloo, University of Victoria, University of Oxford, Institute for Operations Research and the Management Sciences, Alcatel-Lucent (France), McGill University, Carnegie Mellon University, London School of Economics and Political Science

ORCID: 0000-0003-1972-1396

Observed ORCID: 0000-0003-1972-1396

OpenAlex ID: A5044801840

The stable paths problem and interdomain routing

2002 · T.G. Griffin, F.B. Shepherd, et al. · IEEE/ACM Transactions on Networking · 519

Domination in graphs with minimum degree two

1989 · William McCuaig, Bruce Shepherd · Journal of Graph Theory · 172

Policy disputes in path-vector protocols

2005 · T.G. Griffin, F.B. Shepherd, et al. · Proceedings/Proceedings - International Conference on Network Protocols · 147

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

2003 · Venkatesan Guruswami, Sanjeev Khanna, et al. · Journal of Computer and System Sciences · 139

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

1999 · Venkatesan Guruswami, Sanjeev Khanna, et al. · ACM Symposium on Theory of Computing (STOC) · 133

PDF

Multicommodity demand flow in a tree and packing integer programs

2007 · Chandra Chekuri, Marcelo Mydlarz, et al. · ACM Transactions on Algorithms · 110

Route oscillations in I-BGP with route reflection

2002 · Anindya Basu, Chih-Hao Luke Ong, et al. · ACM SIGCOMM Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications (SIGCOMM) · 100

Multicommodity flow, well-linked terminals, and routing problems

2005 · Chandra Chekuri, Sanjeev Khanna, et al. · ACM Symposium on Theory of Computing (STOC) · 96

Untitled

2006 · Chandra Chekuri, Sanjeev Khanna, et al. · Theory of Computing · 91

PDF

The all-or-nothing multicommodity flow problem

2004 · Chandra Chekuri, Sanjeev Khanna, et al. · ACM Symposium on Theory of Computing (STOC) · 87

Clustering and server selection using passive monitoring

2003 · M. Andrews, B. Shepherd, et al. · Annual Joint Conference of the IEEE Computer and Communications Societies (INFOCOM) · 70

Hardness of robust network design

2007 · C. Chekuri, F.B. Shepherd, et al. · Networks · 64

PDF

Tight bounds for online vector bin packing

2013 · Yossi Azar, Ilan Reuven Cohen, et al. · ACM Symposium on Theory of Computing (STOC) · 59

Edge-Disjoint Paths in Planar Graphs

2004 · C. Chekuri, S. Khanna, et al. · Annual Symposium on Foundations of Computer Science · 57

PDF

Applying Lehman's theorems to packing problems

1995 · F. B. Shepherd · Mathematical Programming · 57

Bipartite Domination and Simultaneous Matroid Covers

2003 · C. W. Ko, F. B. Shepherd · SIAM Journal on Discrete Mathematics · 56

An upper bound for the k‐domination number of a graph

1985 · E. J. Cockayne, B. Gamble, et al. · Journal of Graph Theory · 52

Multicommodity Demand Flow in a Tree

2003 · Chandra Chekuri, Marcelo Mydlarz, et al. · Lecture notes in computer science · 45

Hamiltonicity in claw-free graphs

1991 · F.Bruce Shepherd · Journal of Combinatorial Theory Series B · 40

Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks

2012 · Navendu Jain, Ishai Menache, et al. · Lecture notes in computer science · 39

Strategic Network Formation through Peering and Service Agreements

2006 · Elliot Anshelevich, Bruce Shepherd, et al. · Annual Symposium on Foundations of Computer Science · 38

Edge-disjoint paths in Planar graphs with constant congestion

2006 · Chandra Chekuri, Sanjeev Khanna, et al. · ACM Symposium on Theory of Computing (STOC) · 36

Near-perfect matrices

1994 · F. B. Shepherd · Mathematical Programming · 34

Selective randomized load balancing and mesh networks with changing demands

2006 · F. B. Shepherd, P. J. Winzer · Journal of Optical Networking · 33

The VPN conjecture is true

2008 · Navin Goyal, Neil Olver, et al. · 32

Works count: 121

Citation count: 3,054

H-index: 28

I10-index: 60