F. Bruce Shepherd
Publication record assembled from the DBLP archive of ranked conferences.
Papers indexed
33
Venues
11
Active years
1993–2026
Best venue rank
A*
Where they publish
Papers
33 indexed papers, newest first.
| Year | Venue | Title | Authors |
|---|---|---|---|
| 2026 | SODA | Unsplittable Flow Cut Gap in Undirected Graphs. | David Alemn Espinosa, Nikhil Kumar, Joseph Poremba, F. Bruce Shepherd |
| 2024 | SODA | A Parameterized Family of Meta-Submodular Functions. | Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd |
| 2023 | IPCO | Cut-Sufficient Directed 2-Commodity Multiflow Topologies. | Joseph Poremba, F. Bruce Shepherd |
| 2021 | IPCO | Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. | Guyslain Naves, F. Bruce Shepherd, Henry Xia |
| 2021 | SODA | Beyond Submodular Maximization via One-Sided Smoothness. | Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd |
| 2019 | ICML | Multivariate Submodular Optimization. | Richard Santiago, F. Bruce Shepherd |
| 2015 | FOCS | Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. | F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
| 2014 | CCS | Co-Location-Resistant Clouds. | Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd |
| 2013 | ICALP | Maximum Edge-Disjoint Paths in k-Sums of Graphs. | Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd |
| 2013 | INFOCOM | Shortest path versus multi-hub routing in networks with uncertain demand. | Alexandre Frchette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer |
| 2013 | STOC | Tight bounds for online vector bin packing. | Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd |
| 2012 | ICALP | Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. | Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd |
| 2011 | FOCS | Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. | Loc Seguin-Charbonneau, F. Bruce Shepherd |
| 2010 | SODA | Flow-Cut Gaps for Integer and Fractional Multiflows. | Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel |
| 2010 | SODA | Approximability of Robust Network Design. | Neil Olver, F. Bruce Shepherd |
| 2009 | ESA | Dynamic vs. Oblivious Routing in Network Design. | Navin Goyal, Neil Olver, F. Bruce Shepherd |
| 2008 | STOC | The vpn conjecture is true. | Navin Goyal, Neil Olver, F. Bruce Shepherd |
| 2007 | FOCS | Buy-at-Bulk Network Design with Protection. | Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang |
| 2007 | SODA | Island hopping and path colouring with applications to WDM network design. | Andrew McGregor, F. Bruce Shepherd |
| 2007 | STOC | Degree-constrained network flows. | Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
| 2006 | FOCS | Strategic Network Formation through Peering and Service Agreements. | Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong |
| 2006 | STOC | Edge-disjoint paths in Planar graphs with constant congestion. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2005 | STOC | Multicommodity flow, well-linked terminals, and routing problems. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | FOCS | Edge-Disjoint Paths in Planar Graphs. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2004 | STOC | The all-or-nothing multicommodity flow problem. | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
| 2003 | ICALP | Multicommodity Demand Flow in a Tree. | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
| 2002 | INFOCOM | Clustering and Server Selection using Passive Monitoring. | Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane |
| 2002 | IPCO | The Demand Matching Problem. | F. Bruce Shepherd, Adrian Vetta |
| 2002 | SIGCOMM | Route oscillations in I-BGP with route reflection. | Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong |
| 2000 | SODA | Directed network design with orientation constraints. | Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd |
| 1999 | ICNP | Policy Disputes in Path-Vector Protocols. | Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong |
| 1999 | STOC | 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 |
| 1993 | IPCO | Formulations for the stable set polytope of a claw-free graph. | William R. Pulleyblank, F. Bruce Shepherd |