F. Bruce Shepherd

Orcid: 0000-0003-1972-1396

Affiliations:
  • University of British Columbia, Department of Computer Science, Vancouver, BC, Canada
  • McGill University, Montreal, QC, Canada (former)
  • Bell Laboratories, Murray Hill, NJ, USA (former)
  • London School of Economics, UK (former)
  • University of Waterloo, ON, Canada (former, PhD 1990)
  • University of Victoria, Greater Victoria, BC, Canada (former)


According to our database1, F. Bruce Shepherd authored at least 75 papers between 1985 and 2024.

Collaborative distances:
  • Dijkstra number2 of three.
  • Erdős number3 of two.

Awards

IEEE Fellow

IEEE Fellow 1991, "For contributions to the invention and development of metal-silicide Schottky-diode-based infrared imaging sensors.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
A Parameterized Family of Meta-Submodular Functions.
Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2023
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators.
Math. Program., February, 2023

A knapsack intersection hierarchy.
Oper. Res. Lett., January, 2023

Diversity Embeddings and the Hypergraph Sparsest Cut.
CoRR, 2023

Cut-Sufficient Directed 2-Commodity Multiflow Topologies.
Proceedings of the Integer Programming and Combinatorial Optimization, 2023

2022
When Do Gomory-Hu Subtrees Exist?
SIAM J. Discret. Math., 2022

A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees.
CoRR, 2022

2021
Maximum edge-disjoint paths in planar graphs with congestion 2.
Math. Program., 2021

Beyond Submodular Maximization via One-Sided Smoothness.
Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

2020
The Empirical Core of the Multicommodity Flow Game Without Side Payments.
CoRR, 2020

2019
Beyond Submodular Maximization.
CoRR, 2019

Multivariate Submodular Optimization.
Proceedings of the 36th International Conference on Machine Learning, 2019

2018
Multi-Agent Submodular Optimization.
Proceedings of the Approximation, 2018

2017
The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems.
Theory Comput., 2017

2016
Multi-Agent and Multivariate Submodular Optimization.
CoRR, 2016

2015
Shortest Path Versus Multihub Routing in Networks With Uncertain Demand.
IEEE/ACM Trans. Netw., 2015

Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem.
Proceedings of the IEEE 56th Annual Symposium on Foundations of Computer Science, 2015

2014
Approximability of Robust Network Design.
Math. Oper. Res., 2014

Co-Location-Resistant Clouds.
IACR Cryptol. ePrint Arch., 2014

2013
The All-or-Nothing Multicommodity Flow Problem.
SIAM J. Comput., 2013

Flow-cut gaps for integer and fractional multiflows.
J. Comb. Theory B, 2013

The VPN Conjecture Is True.
J. ACM, 2013

Tight bounds for online vector bin packing.
Proceedings of the Symposium on Theory of Computing Conference, 2013

Shortest path versus multi-hub routing in networks with uncertain demand.
Proceedings of the IEEE INFOCOM 2013, Turin, Italy, April 14-19, 2013, 2013

Maximum Edge-Disjoint Paths in k-Sums of Graphs.
Proceedings of the Automata, Languages, and Programming - 40th International Colloquium, 2013

2012
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks.
Proceedings of the Automata, Languages, and Programming - 39th International Colloquium, 2012

2011
Buy-at-Bulk Network Design with Protection.
Math. Oper. Res., 2011

Strategic network formation through peering and service agreements.
Games Econ. Behav., 2011

Dynamic vs. Oblivious Routing in Network Design.
Algorithmica, 2011

2009
Edge-Disjoint Paths in Planar Graphs with Constant Congestion.
SIAM J. Comput., 2009

A Note on Multiflows and Treewidth.
Algorithmica, 2009

2008
Approximate Integer Decompositions for Undirected Network Design Problems.
SIAM J. Discret. Math., 2008

Single-Sink Multicommodity Flow with Side Constraints.
Proceedings of the Research Trends in Combinatorial Optimization, 2008

2007
Multicommodity demand flow in a tree and packing integer programs.
ACM Trans. Algorithms, 2007

Hardness of robust network design.
Networks, 2007

The Demand-Matching Problem.
Math. Oper. Res., 2007

Degree-constrained network flows.
Proceedings of the 39th Annual ACM Symposium on Theory of Computing, 2007

Island hopping and path colouring with applications to WDM network design.
Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2007

2006
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow.
Theory Comput., 2006

Design tools for transparent optical networks.
Bell Labs Tech. J., 2006

2005
Multicommodity flow, well-linked terminals, and routing problems.
Proceedings of the 37th Annual ACM Symposium on Theory of Computing, 2005

2004
Content distribution for seamless transmission.
SIGMETRICS Perform. Evaluation Rev., 2004

Lighting fibers in a dark network.
IEEE J. Sel. Areas Commun., 2004

Edge-Disjoint Paths in Planar Graphs.
Proceedings of the 45th Symposium on Foundations of Computer Science (FOCS 2004), 2004

2003
Bipartite Domination and Simultaneous Matroid Covers.
SIAM J. Discret. Math., 2003

Reserving resilient capacity for a single commodity with upper-bound constraints.
Networks, 2003

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems.
J. Comput. Syst. Sci., 2003

Multicommodity Demand Flow in a Tree.
Proceedings of the Automata, Languages and Programming, 30th International Colloquium, 2003

2002
The stable paths problem and interdomain routing.
IEEE/ACM Trans. Netw., 2002

Foreword.
Math. Program., 2002

Node-Capacitated Ring Routing.
Math. Oper. Res., 2002

Route oscillations in I-BGP with route reflection.
Proceedings of the ACM SIGCOMM 2002 Conference on Applications, 2002

Clustering and Server Selection using Passive Monitoring.
Proceedings of the Proceedings IEEE INFOCOM 2002, 2002

2001
Reserving Resilient Capacity in a Network.
SIAM J. Discret. Math., 2001

A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.
Discret. Appl. Math., 2001

2000
Directed network design with orientation constraints.
Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, 2000

1999
Policy Disputes in Path-Vector Protocols.
Proceedings of the Seventh Annual International Conference on Network Protocols, 1999

1998
The Graphs with All Subgraphs T-Perfect.
SIAM J. Discret. Math., 1998

Face extensions in planar cubic graphs.
Discret. Math., 1998

Strong orientations without even directed circuits.
Discret. Math., 1998

1996
Subdivisions and the chromatic index of <i>r</i>-graphs.
J. Graph Theory, 1996

Excluding Minors in Cubic Graphs.
Comb. Probab. Comput., 1996

The Gallai-Younger Conjecture for Planar Graphs.
Comb., 1996

1995
Applying Lehman's theorems to packing problems.
Math. Program., 1995

Right angle free subsets in the plane.
Graphs Comb., 1995

Note on a Conjecture of Toft.
Comb., 1995

1994
A note on clutter partitions.
Oper. Res. Lett., 1994

Near-perfect matrices.
Math. Program., 1994

Induced Circuits in Planar Graphs.
J. Comb. Theory B, 1994

1993
Formulations for the stable set polytope of a claw-free graph.
Proceedings of the 3rd Integer Programming and Combinatorial Optimization Conference, Erice, Italy, April 29, 1993

1992
Non-Interfering Network Flows.
Proceedings of the Algorithm Theory, 1992

1991
Hamiltonicity in claw-free graphs.
J. Comb. Theory B, 1991

1989
Domination in graphs with minimum degree two.
J. Graph Theory, 1989

1986
Domination parameters for the bishops graph.
Discret. Math., 1986

1985
An upper bound for the <i>k</i>-domination number of a graph.
J. Graph Theory, 1985


  Loading...