default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDF. Bruce Shepherd
Person information
- affiliation: University of British Columbia, Department of Computer Science, Vancouver, BC, Canada
- affiliation (former): McGill University, Montreal, QC, Canada
- affiliation (former): Bell Laboratories, Murray Hill, NJ, USA
- affiliation (former): London School of Economics, UK
- affiliation (former, PhD 1990): University of Waterloo, ON, Canada
- affiliation (former): University of Victoria, Greater Victoria, BC, Canada
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[c35]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. SODA 2024: 1278-1306- 2023
- [j47]Guyslain Naves
, F. Bruce Shepherd, Henry Xia:
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. Math. Program. 197(2): 1049-1067 (2023) - [j46]Adam Jozefiak, F. Bruce Shepherd, Noah Weninger:
A knapsack intersection hierarchy. Oper. Res. Lett. 51(1): 72-78 (2023) - [c34]Joseph Poremba, F. Bruce Shepherd:
Cut-Sufficient Directed 2-Commodity Multiflow Topologies. IPCO 2023: 408-422 - [i15]Adam D. Jozefiak, F. Bruce Shepherd:
Diversity Embeddings and the Hypergraph Sparsest Cut. CoRR abs/2303.04199 (2023) - 2022
- [j45]Guyslain Naves, F. Bruce Shepherd:
When Do Gomory-Hu Subtrees Exist? SIAM J. Discret. Math. 36(3): 1567-1585 (2022) - [i14]Adam Jozefiak, F. Bruce Shepherd, Noah Weninger:
A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees. CoRR abs/2201.02914 (2022) - 2021
- [j44]Loïc Seguin-Charbonneau, F. Bruce Shepherd:
Maximum edge-disjoint paths in planar graphs with congestion 2. Math. Program. 188(1): 295-317 (2021) - [c33]Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. IPCO 2021: 326-339 - [c32]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization via One-Sided Smoothness. SODA 2021: 1006-1025 - 2020
- [i13]Coulter Beeson, F. Bruce Shepherd:
The Empirical Core of the Multicommodity Flow Game Without Side Payments. CoRR abs/2001.09911 (2020) - [i12]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
A Parameterized Family of Meta-Submodular Functions. CoRR abs/2006.13754 (2020) - [i11]Guyslain Naves, F. Bruce Shepherd, Henry Xia:
Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. CoRR abs/2007.10537 (2020)
2010 – 2019
- 2019
- [c31]Richard Santiago, F. Bruce Shepherd:
Multivariate Submodular Optimization. ICML 2019: 5599-5609 - [i10]Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd:
Beyond Submodular Maximization. CoRR abs/1904.09216 (2019) - 2018
- [c30]Richard Santiago, F. Bruce Shepherd:
Multi-Agent Submodular Optimization. APPROX-RANDOM 2018: 23:1-23:20 - [i9]Richard Santiago, F. Bruce Shepherd:
Multi-Agent Submodular Optimization. CoRR abs/1803.03767 (2018) - [i8]Guyslain Naves, F. Bruce Shepherd:
When Do Gomory-Hu Subtrees Exist? CoRR abs/1807.07331 (2018) - 2017
- [j43]F. Bruce Shepherd, Adrian R. Vetta:
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. Theory Comput. 13(1): 1-25 (2017) - 2016
- [i7]Richard Santiago, F. Bruce Shepherd:
Multi-Agent and Multivariate Submodular Optimization. CoRR abs/1612.05222 (2016) - 2015
- [j42]Alexandre Fréchette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer:
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand. IEEE/ACM Trans. Netw. 23(6): 1931-1943 (2015) - [c29]F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. FOCS 2015: 748-758 - [i6]F. Bruce Shepherd, Adrian Vetta:
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. CoRR abs/1504.00627 (2015) - 2014
- [j41]Neil Olver, F. Bruce Shepherd:
Approximability of Robust Network Design. Math. Oper. Res. 39(2): 561-572 (2014) - [c28]Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd:
Co-Location-Resistant Clouds. CCSW 2014: 9-20 - [i5]Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd:
Co-Location-Resistant Clouds. IACR Cryptol. ePrint Arch. 2014: 713 (2014) - 2013
- [j40]Navin Goyal, Neil Olver, F. Bruce Shepherd:
The VPN Conjecture Is True. J. ACM 60(3): 17:1-17:17 (2013) - [j39]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B 103(2): 248-273 (2013) - [j38]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. 42(4): 1467-1493 (2013) - [c27]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) 2013: 328-339 - [c26]Alexandre Fréchette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer:
Shortest path versus multi-hub routing in networks with uncertain demand. INFOCOM 2013: 710-718 - [c25]Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd:
Tight bounds for online vector bin packing. STOC 2013: 961-970 - [i4]Alexandre Fréchette, F. Bruce Shepherd, Marina Thottan, Peter J. Winzer:
Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand. CoRR abs/1302.7028 (2013) - [i3]Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in $k$-sums of Graphs. CoRR abs/1303.4897 (2013) - [i2]Navin Goyal, Neil Olver, F. Bruce Shepherd:
Dynamic vs Oblivious Routing in Network Design. CoRR abs/1309.4140 (2013) - 2012
- [c24]Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd:
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) 2012: 586-597 - 2011
- [j37]Navin Goyal, Neil Olver, F. Bruce Shepherd:
Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61(1): 161-173 (2011) - [j36]Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic network formation through peering and service agreements. Games Econ. Behav. 73(1): 17-38 (2011) - [j35]Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang:
Buy-at-Bulk Network Design with Protection. Math. Oper. Res. 36(1): 71-87 (2011) - [c23]Loïc Seguin-Charbonneau, F. Bruce Shepherd:
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. FOCS 2011: 200-209 - 2010
- [c22]Neil Olver, F. Bruce Shepherd:
Approximability of Robust Network Design. SODA 2010: 1097-1105 - [c21]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. SODA 2010: 1198-1208 - [e1]Friedrich Eisenbrand, F. Bruce Shepherd:
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings. Lecture Notes in Computer Science 6080, Springer 2010, ISBN 978-3-642-13035-9 [contents] - [i1]Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel:
Flow-Cut Gaps for Integer and Fractional Multiflows. CoRR abs/1008.2136 (2010)
2000 – 2009
- 2009
- [j34]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
A Note on Multiflows and Treewidth. Algorithmica 54(3): 400-412 (2009) - [j33]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. 39(1): 281-301 (2009) - [c20]Navin Goyal, Neil Olver, F. Bruce Shepherd:
Dynamic vs. Oblivious Routing in Network Design. ESA 2009: 277-288 - 2008
- [j32]Chandra Chekuri, F. Bruce Shepherd:
Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discret. Math. 23(1): 163-177 (2008) - [c19]F. Bruce Shepherd:
Single-Sink Multicommodity Flow with Side Constraints. Bonn Workshop of Combinatorial Optimization 2008: 429-450 - [c18]Navin Goyal, Neil Olver, F. Bruce Shepherd:
The vpn conjecture is true. STOC 2008: 443-450 - 2007
- [j31]F. Bruce Shepherd, Adrian Vetta:
The Demand-Matching Problem. Math. Oper. Res. 32(3): 563-578 (2007) - [j30]Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà:
Hardness of robust network design. Networks 50(1): 50-54 (2007) - [j29]Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd:
Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms 3(3): 27 (2007) - [c17]Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang:
Buy-at-Bulk Network Design with Protection. FOCS 2007: 634-644 - [c16]Andrew McGregor, F. Bruce Shepherd:
Island hopping and path colouring with applications to WDM network design. SODA 2007: 864-873 - [c15]Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong:
Degree-constrained network flows. STOC 2007: 681-688 - 2006
- [j28]Chandra Chekuri, Paul Claisse, René-Jean Essiambre, Steven Fortune, Daniel C. Kilper, Wonsuck Lee, Nachi K. Nithi, Iraj Saniee, F. Bruce Shepherd, Christopher A. White, Gordon T. Wilfong, Lisa Zhang:
Design tools for transparent optical networks. Bell Labs Tech. J. 11(2): 129-143 (2006) - [j27]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory Comput. 2(7): 137-146 (2006) - [c14]Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong:
Strategic Network Formation through Peering and Service Agreements. FOCS 2006: 77-86 - [c13]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-disjoint paths in Planar graphs with constant congestion. STOC 2006: 757-766 - 2005
- [c12]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Multicommodity flow, well-linked terminals, and routing problems. STOC 2005: 183-192 - 2004
- [j26]F. Bruce Shepherd, Adrian Vetta:
Lighting fibers in a dark network. IEEE J. Sel. Areas Commun. 22(9): 1583-1588 (2004) - [j25]Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, F. Bruce Shepherd, Angelos Stavrou:
Content distribution for seamless transmission. SIGMETRICS Perform. Evaluation Rev. 32(2): 31-32 (2004) - [c11]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
Edge-Disjoint Paths in Planar Graphs. FOCS 2004: 71-80 - [c10]Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd:
The all-or-nothing multicommodity flow problem. STOC 2004: 156-165 - 2003
- [j24]Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis:
Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. 67(3): 473-496 (2003) - [j23]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003) - [j22]C. W. Ko, F. Bruce Shepherd:
Bipartite Domination and Simultaneous Matroid Covers. SIAM J. Discret. Math. 16(4): 517-523 (2003) - [c9]Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd:
Multicommodity Demand Flow in a Tree. ICALP 2003: 410-425 - 2002
- [j21]András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh:
Node-Capacitated Ring Routing. Math. Oper. Res. 27(2): 372-383 (2002) - [j20]Andrew R. Conn, F. Bruce Shepherd:
Foreword. Math. Program. 91(3): 399-400 (2002) - [j19]Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong:
The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. 10(2): 232-243 (2002) - [c8]Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane:
Clustering and Server Selection using Passive Monitoring. INFOCOM 2002: 1717-1725 - [c7]F. Bruce Shepherd, Adrian Vetta:
The Demand Matching Problem. IPCO 2002: 457-474 - [c6]Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong:
Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247 - 2001
- [j18]F. Bruce Shepherd, Lisa Zhang:
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. Discret. Appl. Math. 110(2-3): 301-315 (2001) - [j17]Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd:
Reserving Resilient Capacity in a Network. SIAM J. Discret. Math. 14(4): 524-539 (2001) - 2000
- [c5]Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd:
Directed network design with orientation constraints. SODA 2000: 663-671
1990 – 1999
- 1999
- [c4]Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong:
Policy Disputes in Path-Vector Protocols. ICNP 1999: 21-30 - [c3]Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis:
Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC 1999: 19-28 - 1998
- [j16]Kyriakos Kilakos, F. Bruce Shepherd:
Face extensions in planar cubic graphs. Discret. Math. 181(1-3): 179-191 (1998) - [j15]A. M. H. Gerards, F. Bruce Shepherd:
Strong orientations without even directed circuits. Discret. Math. 188(1-3): 111-125 (1998) - [j14]A. M. H. Gerards, F. Bruce Shepherd:
The Graphs with All Subgraphs T-Perfect. SIAM J. Discret. Math. 11(4): 524-545 (1998) - 1996
- [j13]Bruce A. Reed, F. Bruce Shepherd:
The Gallai-Younger Conjecture for Planar Graphs. Comb. 16(4): 555-566 (1996) - [j12]Kyriakos Kilakos, F. Bruce Shepherd:
Excluding Minors in Cubic Graphs. Comb. Probab. Comput. 5: 57-78 (1996) - [j11]Kyriakos Kilakos, F. Bruce Shepherd:
Subdivisions and the chromatic index of r-graphs. J. Graph Theory 22(3): 203-212 (1996) - 1995
- [j10]Tommy R. Jensen, F. Bruce Shepherd:
Note on a Conjecture of Toft. Comb. 15(3): 373-377 (1995) - [j9]B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd:
Right angle free subsets in the plane. Graphs Comb. 11(2): 121-129 (1995) - [j8]F. Bruce Shepherd:
Applying Lehman's theorems to packing problems. Math. Program. 71: 353-367 (1995) - 1994
- [j7]Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Induced Circuits in Planar Graphs. J. Comb. Theory B 60(2): 169-176 (1994) - [j6]F. Bruce Shepherd:
Near-perfect matrices. Math. Program. 64: 295-323 (1994) - [j5]F. Bruce Shepherd:
A note on clutter partitions. Oper. Res. Lett. 15(3): 127-131 (1994) - 1993
- [c2]William R. Pulleyblank, F. Bruce Shepherd:
Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279 - 1992
- [c1]Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd:
Non-Interfering Network Flows. SWAT 1992: 245-257 - 1991
- [j4]F. Bruce Shepherd:
Hamiltonicity in claw-free graphs. J. Comb. Theory B 53(2): 173-194 (1991)
1980 – 1989
- 1989
- [j3]William McCuaig, F. Bruce Shepherd:
Domination in graphs with minimum degree two. J. Graph Theory 13(6): 749-762 (1989) - 1986
- [j2]Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
Domination parameters for the bishops graph. Discret. Math. 58(3): 221-227 (1986) - 1985
- [j1]Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd:
An upper bound for the k-domination number of a graph. J. Graph Theory 9(4): 533-534 (1985)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 20:14 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
