An upper bound for the k-domination number of a graph. - Ernest J. Cockayne; B. Gamble; F. Bruce Shepherd (J. Graph Theory, 1985)

Domination parameters for the bishops graph. - Ernest J. Cockayne; B. Gamble; F. Bruce Shepherd (Discret. Math., 1986)

Domination in graphs with minimum degree two. - William McCuaig; F. Bruce Shepherd (J. Graph Theory, 1989)

Hamiltonicity in claw-free graphs. - F. Bruce Shepherd (J. Comb. Theory B, 1991)

Non-Interfering Network Flows. - Colin McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (SWAT, 1992)

Formulations for the stable set polytope of a claw-free graph. - William R. Pulleyblank; F. Bruce Shepherd (IPCO, 1993)

Induced Circuits in Planar Graphs. - Colin J. H. McDiarmid; Bruce A. Reed; Alexander Schrijver; F. Bruce Shepherd (J. Comb. Theory B, 1994)

Near-perfect matrices. - F. Bruce Shepherd (Math. Program., 1994)

A note on clutter partitions. - F. Bruce Shepherd (Oper. Res. Lett., 1994)

Note on a Conjecture of Toft. - Tommy R. Jensen; F. Bruce Shepherd (Comb., 1995)

Right angle free subsets in the plane. - B. Gamble; William R. Pulleyblank; Bruce A. Reed; F. Bruce Shepherd (Graphs Comb., 1995)

Applying Lehman's theorems to packing problems. - F. Bruce Shepherd (Math. Program., 1995)

The Gallai-Younger Conjecture for Planar Graphs. - Bruce A. Reed; F. Bruce Shepherd (Comb., 1996)

Excluding Minors in Cubic Graphs. - Kyriakos Kilakos; F. Bruce Shepherd (Comb. Probab. Comput., 1996)

Subdivisions and the chromatic index of r-graphs. - Kyriakos Kilakos; F. Bruce Shepherd (J. Graph Theory, 1996)

Strong orientations without even directed circuits. - A. M. H. Gerards; F. Bruce Shepherd (Discret. Math., 1998)

Face extensions in planar cubic graphs. - Kyriakos Kilakos; F. Bruce Shepherd (Discret. Math., 1998)

The Graphs with All Subgraphs T-Perfect. - A. M. H. Gerards; F. Bruce Shepherd (SIAM J. Discret. Math., 1998)

Policy Disputes in Path-Vector Protocols. - Timothy Griffin; F. Bruce Shepherd; Gordon T. Wilfong (ICNP, 1999)

Directed network design with orientation constraints. - Sanjeev Khanna; Joseph Naor; F. Bruce Shepherd (SODA, 2000)

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. - F. Bruce Shepherd; Lisa Zhang (Discret. Appl. Math., 2001)

Reserving Resilient Capacity in a Network. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (SIAM J. Discret. Math., 2001)

Clustering and Server Selection using Passive Monitoring. - Matthew Andrews; F. Bruce Shepherd; Aravind Srinivasan; Peter Winkler 001; Francis Zane (INFOCOM, 2002)

Route oscillations in I-BGP with route reflection. - Anindya Basu; Chih-Hao Luke Ong; April Rasala; F. Bruce Shepherd; Gordon T. Wilfong (SIGCOMM, 2002)

Node-Capacitated Ring Routing. - András Frank; F. Bruce Shepherd; Vivek Tandon; Zoltán Végh (Math. Oper. Res., 2002)

Foreword. - Andrew R. Conn; F. Bruce Shepherd (Math. Program., 2002)

The stable paths problem and interdomain routing. - Timothy Griffin; F. Bruce Shepherd; Gordon T. Wilfong (IEEE/ACM Trans. Netw., 2002)

Multicommodity Demand Flow in a Tree. - Chandra Chekuri; Marcelo Mydlarz; F. Bruce Shepherd (ICALP, 2003)

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. - Venkatesan Guruswami; Sanjeev Khanna; Rajmohan Rajaraman; F. Bruce Shepherd; Mihalis Yannakakis (J. Comput. Syst. Sci., 2003)

Reserving resilient capacity for a single commodity with upper-bound constraints. - Graham R. Brightwell; Gianpaolo Oriolo; F. Bruce Shepherd (Networks, 2003)

Bipartite Domination and Simultaneous Matroid Covers. - C. W. Ko; F. Bruce Shepherd (SIAM J. Discret. Math., 2003)

Edge-Disjoint Paths in Planar Graphs. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (FOCS, 2004)

Lighting fibers in a dark network. - F. Bruce Shepherd; Adrian Vetta (IEEE J. Sel. Areas Commun., 2004)

Content distribution for seamless transmission. - Edward G. Coffman Jr.; Andreas Constantinides; Dan Rubenstein; F. Bruce Shepherd; Angelos Stavrou (SIGMETRICS Perform. Evaluation Rev., 2004)

Multicommodity flow, well-linked terminals, and routing problems. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (STOC, 2005)

Design tools for transparent optical networks. - 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 (Bell Labs Tech. J., 2006)

An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (Theory Comput., 2006)

Island hopping and path colouring with applications to WDM network design. - Andrew McGregor 001; F. Bruce Shepherd (SODA, 2007)

Degree-constrained network flows. - Patrick Donovan; F. Bruce Shepherd; Adrian Vetta; Gordon T. Wilfong (STOC, 2007)

The Demand-Matching Problem. - F. Bruce Shepherd; Adrian Vetta (Math. Oper. Res., 2007)

Hardness of robust network design. - Chandra Chekuri; F. Bruce Shepherd; Gianpaolo Oriolo; Maria Grazia Scutellà (Networks, 2007)

Multicommodity demand flow in a tree and packing integer programs. - Chandra Chekuri; Marcelo Mydlarz; F. Bruce Shepherd (ACM Trans. Algorithms, 2007)

Single-Sink Multicommodity Flow with Side Constraints. - F. Bruce Shepherd (Bonn Workshop of Combinatorial Optimization, 2008)

Approximate Integer Decompositions for Undirected Network Design Problems. - Chandra Chekuri; F. Bruce Shepherd (SIAM J. Discret. Math., 2008)

A Note on Multiflows and Treewidth. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (Algorithmica, 2009)

Edge-Disjoint Paths in Planar Graphs with Constant Congestion. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (SIAM J. Comput., 2009)

Dynamic vs. Oblivious Routing in Network Design. - Navin Goyal; Neil Olver; F. Bruce Shepherd (Algorithmica, 2011)

Strategic network formation through peering and service agreements. - Elliot Anshelevich; F. Bruce Shepherd; Gordon T. Wilfong (Games Econ. Behav., 2011)

Buy-at-Bulk Network Design with Protection. - Spyridon Antonakopoulos; Chandra Chekuri; F. Bruce Shepherd; Lisa Zhang (Math. Oper. Res., 2011)

Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. - Navendu Jain; Ishai Menache; Joseph Naor; F. Bruce Shepherd (ICALP (2), 2012)

Maximum Edge-Disjoint Paths in k-Sums of Graphs. - Chandra Chekuri; Guyslain Naves; F. Bruce Shepherd (ICALP (1), 2013)

Shortest path versus multi-hub routing in networks with uncertain demand. - Alexandre Fréchette; F. Bruce Shepherd; Marina K. Thottan; Peter J. Winzer (INFOCOM, 2013)

Tight bounds for online vector bin packing. - Yossi Azar; Ilan Reuven Cohen; Seny Kamara; F. Bruce Shepherd (STOC, 2013)

The VPN Conjecture Is True. - Navin Goyal; Neil Olver; F. Bruce Shepherd (J. ACM, 2013)

Flow-cut gaps for integer and fractional multiflows. - Chandra Chekuri; F. Bruce Shepherd; Christophe Weibel (J. Comb. Theory B, 2013)

The All-or-Nothing Multicommodity Flow Problem. - Chandra Chekuri; Sanjeev Khanna; F. Bruce Shepherd (SIAM J. Comput., 2013)

Co-Location-Resistant Clouds. - Yossi Azar; Seny Kamara; Ishai Menache; Mariana Raykova 001; F. Bruce Shepherd (IACR Cryptol. ePrint Arch., 2014)

Approximability of Robust Network Design. - Neil Olver; F. Bruce Shepherd (Math. Oper. Res., 2014)

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. - F. Bruce Shepherd; Adrian Vetta; Gordon T. Wilfong (FOCS, 2015)

Shortest Path Versus Multihub Routing in Networks With Uncertain Demand. - Alexandre Fréchette; F. Bruce Shepherd; Marina K. Thottan; Peter J. Winzer (IEEE/ACM Trans. Netw., 2015)

Multi-Agent and Multivariate Submodular Optimization. - Richard Santiago; F. Bruce Shepherd (CoRR, 2016)

The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. - F. Bruce Shepherd; Adrian R. Vetta (Theory Comput., 2017)

Multi-Agent Submodular Optimization. - Richard Santiago; F. Bruce Shepherd (APPROX-RANDOM, 2018)

Multivariate Submodular Optimization. - Richard Santiago; F. Bruce Shepherd (ICML, 2019)

Beyond Submodular Maximization. - Mehrdad Ghadiri; Richard Santiago; F. Bruce Shepherd (CoRR, 2019)

The Empirical Core of the Multicommodity Flow Game Without Side Payments. - Coulter Beeson; F. Bruce Shepherd (CoRR, 2020)

Beyond Submodular Maximization via One-Sided Smoothness. - Mehrdad Ghadiri; Richard Santiago; F. Bruce Shepherd (SODA, 2021)

Maximum edge-disjoint paths in planar graphs with congestion 2. - Loïc Seguin-Charbonneau; F. Bruce Shepherd (Math. Program., 2021)

A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees. - Adam Jozefiak; F. Bruce Shepherd; Noah Weninger (CoRR, 2022)

When Do Gomory-Hu Subtrees Exist? - Guyslain Naves; F. Bruce Shepherd (SIAM J. Discret. Math., 2022)

Diversity Embeddings and the Hypergraph Sparsest Cut. - Adam D. Jozefiak; F. Bruce Shepherd (CoRR, 2023)

A knapsack intersection hierarchy. - Adam Jozefiak; F. Bruce Shepherd; Noah Weninger (Oper. Res. Lett., 2023)

Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. - Guyslain Naves; F. Bruce Shepherd; Henry Xia (Math. Program., 2023)

A Parameterized Family of Meta-Submodular Functions. - Mehrdad Ghadiri; Richard Santiago; F. Bruce Shepherd (SODA, 2024)

Cut-sufficient directed 2-commodity multiflow topologies. - Joseph Poremba; F. Bruce Shepherd (Math. Program., 2025)