Bruce Shepherd 个人学术档案

引用次数

	总计	2019 年至今
引用	4728	802
h 指数	33	16
i10 指数	67	22

320

160

240

1996199719981999200020012002200320042005200620072008200920102011201220132014201520162017201820192020202120222023202413 11 11 20 33 41 49 96 184 208 251 226 226 276 268 302 239 263 212 205 232 188 214 166 136 154 157 130 58

开放获取的出版物数量

查看全部

5 篇文章

1 篇文章

可查看的文章

无法查看的文章

根据资助方的强制性开放获取政策

合著作者

Chandra ChekuriProfessor of Computer Science, University of Illinois, Urbana-Champaign在 illinois.edu 的电子邮件经过验证
Gordon WilfongBell Labs在 nokia-bell-labs.com 的电子邮件经过验证
Sanjeev KhannaHenry Salvatori Professor of Computer Science, University of Pennsylvania在 cis.upenn.edu 的电子邮件经过验证
Aravind SrinivasanProfessor of Computer Science and Distinguished University Professor, University of Maryland在 umd.edu 的电子邮件经过验证
Timothy G. GriffinSenior Lecturer, University of Cambridge在 cl.cam.ac.uk 的电子邮件经过验证
Matthew AndrewsNokia Bell Labs在 nokia-bell-labs.com 的电子邮件经过验证
Adrian VettaProfessor of Mathematics/ Professor of Computer Science, McGill University在 math.mcgill.ca 的电子邮件经过验证
Alexander SchrijverUniversity of Amsterdam and CWI在 cwi.nl 的电子邮件经过验证
Ishai MenacheMicrosoft Research在 microsoft.com 的电子邮件经过验证
WR PulleyblankUnited States Military Academy在 westpoint.edu 的电子邮件经过验证
Joseph Seffi NaorTechnion在 cs.technion.ac.il 的电子邮件经过验证
Luke OngDistinguished University Professor, Nanyang Technological University在 ntu.edu.sg 的电子邮件经过验证
Richard SantiagoPostdoctoral Researcher, ETH Zurich在 ethz.ch 的电子邮件经过验证
Navendu JainMicrosoft Research在 microsoft.com 的电子邮件经过验证
Neil OlverLondon School of Economics and Political Science在 lse.ac.uk 的电子邮件经过验证
Mihalis YannakakisPercy K. and Vida L. W. Hudson Professor of Computer Science, Columbia University在 cs.columbia.edu 的电子邮件经过验证
Venkatesan GuruswamiUniversity of California, Berkeley在 berkeley.edu 的电子邮件经过验证
Rajmohan RajaramanProfessor of Computer Science, Northeastern University在 ccs.neu.edu 的电子邮件经过验证
Maria Grazia Scutella'Dipartimento di Informatica Universita' di Pisa在 di.unipi.it 的电子邮件经过验证
Elliot AnshelevichProfessor of Computer Science, Rensselaer Polytechnic Institute在 cs.rpi.edu 的电子邮件经过验证

关注

Bruce Shepherd

University of British Columbia

在 cs.ubc.ca 的电子邮件经过验证 - 首页

Optimization Algorithms Networking


标题按引用次数排序按年份排序按标题排序	引用次数引用次数	年份
The stable paths problem and interdomain routing TG Griffin, FB Shepherd, G Wilfong IEEE/ACM Transactions On Networking 10 (2), 232-243, 2002	748	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 Proceedings of the thirty-first Annual ACM Symposium on Theory of Computing …, 1999	343	1999
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	266	2006
Policy disputes in path-vector protocols TG Griffin, FB Shepherd, G Wilfong Proceedings. Seventh International Conference on Network Protocols, 21-30, 1999	234	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	196*	2007
Domination in graphs with minimum degree two W McCuaig, B Shepherd Journal of Graph Theory 13 (6), 749-762, 1989	185	1989
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	176	2002
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	145*	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	130	2005
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	109	2014
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	107	2006
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	99	2002
Hardness of robust network design C Chekuri, FB Shepherd, G Oriolo, MG Scutella Networks: An International Journal 50 (1), 50-54, 2007	96	2007
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	80	1985
Edge-disjoint paths in planar graphs with constant congestion C Chekuri, S Khanna, FB Shepherd Proceedings of the thirty-eighth annual ACM symposium on Theory of Computing …, 2006	79	2006
Edge-disjoint paths in planar graphs C Chekuri, S Khanna, FB Shepherd 45th Annual IEEE Symposium on Foundations of Computer Science, 71-80, 2004	78	2004
Applying Lehman's theorems to packing problems FB Shepherd Mathematical Programming 71, 353-367, 1995	73	1995
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	72	2007
Hamiltonicity in claw-free graphs FB Shepherd Journal of Combinatorial Theory, Series B 53 (2), 173-194, 1991	71	1991
Tight bounds for online vector bin packing Y Azar, IR Cohen, S Kamara, B Shepherd Proceedings of the forty-fifth annual ACM symposium on Theory of Computing …, 2013	67	2013

系统目前无法执行此操作，请稍后再试。

文章 1–20

每年引用数

重复的引用

合并的引用

添加合著者合著作者

上传 PDF

关注此作者

引用次数

合著作者

引用