F. Bruce Shepherd - Concepedia

Author

F. Bruce Shepherd

Also Known As

B Shepherd, B. Shepherd, Bruce Shepherd, F B. Shepherd, F. B. Shepherd, F. Bruce Shepherd, F. Bruce Shepherd, F.B. Shepherd, F.Bruce Shepherd, Shepherd, Bruce

126

Publications

Citations

H-Index

Concepts

All Affiliations

McGill University University of Pennsylvania Nokia (United States)University of Illinois Urbana-Champaign London School of Economics and Political Science

About

F. Bruce Shepherd is an author at McGill University specializing in engineering, discrete mathematics, and combinatorial optimization.

Top Concepts

#	Concept	H-Index	Publications	Citations
1	Engineering	21	36	1.9K
2	Computer Science	17	24	1.7K
3	Education	13	15	728
4	Business	10	12	447
5	Computer Engineering	10	10	256

F. Bruce Shepherd

Publications

2.5K

Citations

H-Index

Page 1

	Year	Citations
The stable paths problem and interdomain routing Timothy G. Griffin, F. Bruce Shepherd, Gordon Wilfong IEEE/ACM Transactions on Networking Network Routing AlgorithmNetwork ScienceDynamic BehaviorEngineeringEdge Computing	2002	514
Domination in graphs with minimum degree two William McCuaig, F. Bruce Shepherd Journal of Graph Theory Graph MinorMinimum Degree TwoNetwork ScienceGraph TheoryExceptional Graphs	1989	175
Policy disputes in path-vector protocols Timothy G. Griffin, F. Bruce Shepherd, Gordon Wilfong Path Vector ProtocolEngineeringInformation SecurityVerificationNetwork Routing	2005	146
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, Journal of Computer and System Sciences Mathematical ProgrammingRelated ProblemsEngineeringGraph TheoryExtremal Graph Theory	2003	137
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman,	1999	133
Multicommodity demand flow in a tree and packing integer programs Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd ACM Transactions on Algorithms Mathematical ProgrammingIntegrality GapBranch-and-bound AlgorithmEngineeringComputational Complexity	2007	107
Route oscillations in I-BGP with route reflection Anindya Basu, C.-H. Luke Ong, April Rasala, I-bgp ConfigurationNetwork Routing AlgorithmNetwork ScienceEngineeringRouting Protocol	2002	99
Multicommodity flow, well-linked terminals, and routing problems Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Directed GraphEngineeringNetwork RoutingNetwork AnalysisEducation	2005	95
The all-or-nothing multicommodity flow problem Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd Mathematical ProgrammingComputational Complexity TheoryEngineeringUnit DemandNetwork Analysis	2004	84
Hardness of robust network design Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Networks Mathematical ProgrammingEngineeringNetwork RobustnessNetwork AnalysisFlow‐cut Gap	2007	61

Page 1