Bruce Shepherd - Citazioni di Google Scholar

Citata da

	Tutte	Dal 2015
Citazioni	4106	1093
Indice H	33	18
i10-index	65	32

320

160

240

19971998199920002001200220032004200520062007200820092010201120122013201420152016201720182019202011 11 16 25 26 48 98 182 204 242 220 225 290 269 301 228 250 230 222 238 214 210 180 25

Coautori

Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-ChampaignEmail verificata su illinois.edu
Gordon WilfongBell LabsEmail verificata su nokia-bell-labs.com
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of PennsylvaniaEmail verificata su cis.upenn.edu
Aravind SrinivasanProfessor of Computer Science, University of MarylandEmail verificata su cs.umd.edu
Matthew AndrewsAlcatel-Lucent Bell LabsEmail verificata su research.bell-labs.com
Timothy G. GriffinSenior Lecturer, University of CambridgeEmail verificata su cl.cam.ac.uk
Adrian VettaProfessor of Mathematics/ Professor of Computer Science, McGill UniversityEmail verificata su math.mcgill.ca
Luke OngProfessor of Computer Science, University of OxfordEmail verificata su cs.ox.ac.uk
WR PulleyblankUnited States Military AcademyEmail verificata su usma.edu
Joseph Seffi NaorTechnionEmail verificata su cs.technion.ac.il
Ishai MenacheMicrosoft ResearchEmail verificata su microsoft.com
Neil OlverLondon School of Economics and Political ScienceEmail verificata su lse.ac.uk
Alexander SchrijverUniversity of Amsterdam and CWIEmail verificata su cwi.nl
Yossi AzarTel Aviv UniversityEmail verificata su tau.ac.il
Navendu JainMicrosoft ResearchEmail verificata su microsoft.com
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia UniversityEmail verificata su cs.columbia.edu
Venkatesan GuruswamiCarnegie Mellon UniversityEmail verificata su cmu.edu
Rajmohan RajaramanProfessor of Computer Science, Northeastern UniversityEmail verificata su ccs.neu.edu
Maria Grazia Scutella'Dipartimento di Informatica Universita' di PisaEmail verificata su di.unipi.it
Elliot AnshelevichProfessor of Computer Science, Rensselaer Polytechnic InstituteEmail verificata su cs.rpi.edu

Bruce Shepherd

University of British Columbia

Email verificata su cs.ubc.ca - Home page

Optimization Algorithms Networking


Titolo	Citata da	Anno
The stable paths problem and interdomain routing TG Griffin, FB Shepherd, G Wilfong IEEE/ACM Transactions On Networking 10 (2), 232-243, 2002	657	2002
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems V Guruswami, S Khanna, R Rajaraman, B Shepherd, M Yannakakis Journal of Computer and System Sciences 67 (3), 473-496, 2003	296	2003
System and method for locating a closest server in response to a client domain name request M Andrews, M Hofmann, B Shepherd, A Srinivasan, P Winkler, F Zane US Patent 7,020,698, 2006	226	2006
Policy disputes in path-vector protocols TG Griffin, FB Shepherd, G Wilfong Proceedings. Seventh International Conference on Network Protocols, 21-30, 1999	214	1999
Multicommodity demand flow in a tree and packing integer programs C Chekuri, M Mydlarz, FB Shepherd ACM Transactions on Algorithms (TALG) 3 (3), 27-es, 2007	165*	2007
Route oscillations in I-BGP with route reflection A Basu, CHL Ong, A Rasala, FB Shepherd, G Wilfong Proceedings of the 2002 conference on Applications, technologies …, 2002	158	2002
Domination in graphs with minimum degree two W McCuaig, B Shepherd Journal of Graph Theory 13 (6), 749-762, 1989	157	1989
The all-or-nothing multicommodity flow problem C Chekuri, S Khanna, FB Shepherd Proceedings of the thirty-sixth annual ACM symposium on Theory of computing …, 2004	111*	2004
Multicommodity flow, well-linked terminals, and routing problems C Chekuri, S Khanna, FB Shepherd Proceedings of the thirty-seventh annual ACM symposium on Theory of …, 2005	106	2005
Clustering and server selection using passive monitoring M Andrews, B Shepherd, A Srinivasan, P Winkler, F Zane Proceedings. Twenty-First Annual Joint Conference of the IEEE Computer and …, 2002	93	2002
An O (√ n) approximation and integrality gap for disjoint paths and unsplittable flow C Chekuri, S Khanna, FB Shepherd Theory of computing 2 (1), 137-146, 2006	90	2006
Hardness of robust network design C Chekuri, FB Shepherd, G Oriolo, MG Scutella Networks: An International Journal 50 (1), 50-54, 2007	89	2007
Edge-disjoint paths in planar graphs with constant congestion C Chekuri, S Khanna, FB Shepherd SIAM Journal on Computing 39 (1), 281-301, 2009	70	2009
Method and apparatus for exchanging routing information within an autonomous system in a packet-based data network A Basu, CHL Ong, AP Rasala, FB Sheperd, GT Wilfong US Patent 7,180,864, 2007	67	2007
Edge-disjoint paths in planar graphs C Chekuri, S Khanna, FB Shepherd 45th Annual IEEE Symposium on Foundations of Computer Science, 71-80, 2004	66	2004
Applying Lehman's theorems to packing problems FB Shepherd Mathematical Programming 71 (3), 353-367, 1995	65	1995
An upper bound for the k‐domination number of a graph EJ Cockayne, B Gamble, B Shepherd Journal of Graph Theory 9 (4), 533-534, 1985	63	1985
Co-location-resistant clouds Y Azar, S Kamara, I Menache, M Raykova, B Shepard Proceedings of the 6th Edition of the ACM Workshop on Cloud Computing …, 2014	58	2014
The VPN conjecture is true N Goyal, N Olver, FB Shepherd Journal of the ACM (JACM) 60 (3), 1-17, 2013	54	2013
Strategic network formation through peering and service agreements E Anshelevich, B Shepherd, G Wilfong 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06 …, 2006	54*	2006

Il sistema al momento non può eseguire l'operazione. Riprova più tardi.

Articoli 1–20

Citazioni per anno

Citazioni duplicate

Citazioni unite

Aggiungi coautoriCoautori

Carica PDF

Segui questo autore

Citata da

Coautori