F. Bruce Shepherd

101 papers A* 24A 1B 6Journal 64Unranked 6

Year	Rank	Type	Title / Venue / Authors
2026	A*	`conf`	Unsplittable Flow Cut Gap in Undirected Graphs. SODA David Alemán Espinosa, Nikhil Kumar, Joseph Poremba, F. Bruce Shepherd
2025	J	`jnl`	Cut-sufficient directed 2-commodity multiflow topologies. Math. Program. Joseph Poremba, F. Bruce Shepherd
2025	J	`jnl`	Uncrossed Multiflows and Applications to Disjoint Paths. CoRR Chandra Chekuri, Guyslain Naves, Joseph Poremba, F. Bruce Shepherd
2024	A*	`conf`	A Parameterized Family of Meta-Submodular Functions. SODA Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
2023	J	`jnl`	A knapsack intersection hierarchy. Oper. Res. Lett. Adam Jozefiak, F. Bruce Shepherd, Noah Weninger
2023	B	`conf`	Cut-Sufficient Directed 2-Commodity Multiflow Topologies. IPCO Joseph Poremba, F. Bruce Shepherd
2023	J	`jnl`	Diversity Embeddings and the Hypergraph Sparsest Cut. CoRR Adam D. Jozefiak, F. Bruce Shepherd
2023	J	`jnl`	Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators. Math. Program. Guyslain Naves, F. Bruce Shepherd, Henry Xia
2022	J	`jnl`	A Knapsack Intersection Hierarchy Applied to All-or-Nothing Flow in Trees. CoRR Adam Jozefiak, F. Bruce Shepherd, Noah Weninger
2022	J	`jnl`	When Do Gomory-Hu Subtrees Exist? SIAM J. Discret. Math. Guyslain Naves, F. Bruce Shepherd
2021	A*	`conf`	Beyond Submodular Maximization via One-Sided Smoothness. SODA Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
2021	B	`conf`	Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. IPCO Guyslain Naves, F. Bruce Shepherd, Henry Xia
2021	J	`jnl`	Maximum edge-disjoint paths in planar graphs with congestion 2. Math. Program. Loïc Seguin-Charbonneau, F. Bruce Shepherd
2020	J	`jnl`	A Parameterized Family of Meta-Submodular Functions. CoRR Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
2020	J	`jnl`	Maximum Weight Disjoint Paths in Outerplanar Graphs via Single-Tree Cut Approximators. CoRR Guyslain Naves, F. Bruce Shepherd, Henry Xia
2020	J	`jnl`	The Empirical Core of the Multicommodity Flow Game Without Side Payments. CoRR Coulter Beeson, F. Bruce Shepherd
2019	J	`jnl`	Beyond Submodular Maximization. CoRR Mehrdad Ghadiri, Richard Santiago, F. Bruce Shepherd
2019	A*	`conf`	Multivariate Submodular Optimization. ICML Richard Santiago, F. Bruce Shepherd
2018	—	`conf`	Multi-Agent Submodular Optimization. APPROX-RANDOM Richard Santiago, F. Bruce Shepherd
2018	J	`jnl`	Multi-Agent Submodular Optimization. CoRR Richard Santiago, F. Bruce Shepherd
2018	J	`jnl`	When Do Gomory-Hu Subtrees Exist? CoRR Guyslain Naves, F. Bruce Shepherd
2017	J	`jnl`	The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. Theory Comput. F. Bruce Shepherd, Adrian R. Vetta
2016	J	`jnl`	Multi-Agent and Multivariate Submodular Optimization. CoRR Richard Santiago, F. Bruce Shepherd
2015	A*	`conf`	Polylogarithmic Approximations for the Capacitated Single-Sink Confluent Flow Problem. FOCS F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
2015	J	`jnl`	Shortest Path Versus Multihub Routing in Networks With Uncertain Demand. IEEE/ACM Trans. Netw. Alexandre Fréchette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer
2015	J	`jnl`	The Inapproximability of Maximum Single-Sink Unsplittable, Priority and Confluent Flow Problems. CoRR F. Bruce Shepherd, Adrian Vetta
2014	J	`jnl`	Approximability of Robust Network Design. Math. Oper. Res. Neil Olver, F. Bruce Shepherd
2014	—	`conf`	Co-Location-Resistant Clouds. CCSW Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd
2014	J	`jnl`	Co-Location-Resistant Clouds. IACR Cryptol. ePrint Arch. Yossi Azar, Seny Kamara, Ishai Menache, Mariana Raykova, F. Bruce Shepherd
2013	J	`jnl`	Dynamic vs Oblivious Routing in Network Design. CoRR Navin Goyal, Neil Olver, F. Bruce Shepherd
2013	J	`jnl`	Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory B Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2013	J	`jnl`	Maximum Edge-Disjoint Paths in $k$-sums of Graphs CoRR Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
2013	—	`conf`	Maximum Edge-Disjoint Paths in k-Sums of Graphs. ICALP (1) Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd
2013	J	`jnl`	Shortest Path versus Multi-Hub Routing in Networks with Uncertain Demand CoRR Alexandre Fréchette, F. Bruce Shepherd, Marina Thottan, Peter J. Winzer
2013	A*	`conf`	Shortest path versus multi-hub routing in networks with uncertain demand. INFOCOM Alexandre Fréchette, F. Bruce Shepherd, Marina K. Thottan, Peter J. Winzer
2013	J	`jnl`	The All-or-Nothing Multicommodity Flow Problem. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2013	J	`jnl`	The VPN Conjecture Is True. J. ACM Navin Goyal, Neil Olver, F. Bruce Shepherd
2013	A*	`conf`	Tight bounds for online vector bin packing. STOC Yossi Azar, Ilan Reuven Cohen, Seny Kamara, F. Bruce Shepherd
2012	—	`conf`	Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks. ICALP (2) Navendu Jain, Ishai Menache, Joseph Naor, F. Bruce Shepherd
2011	J	`jnl`	Buy-at-Bulk Network Design with Protection. Math. Oper. Res. Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang
2011	J	`jnl`	Dynamic vs. Oblivious Routing in Network Design. Algorithmica Navin Goyal, Neil Olver, F. Bruce Shepherd
2011	A*	`conf`	Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. FOCS Loïc Seguin-Charbonneau, F. Bruce Shepherd
2011	J	`jnl`	Strategic network formation through peering and service agreements. Games Econ. Behav. Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
2010	A*	`conf`	Approximability of Robust Network Design. SODA Neil Olver, F. Bruce Shepherd
2010	J	`jnl`	Flow-Cut Gaps for Integer and Fractional Multiflows CoRR Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2010	A*	`conf`	Flow-Cut Gaps for Integer and Fractional Multiflows. SODA Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel
2010	B	`ed.`	Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings IPCO Friedrich Eisenbrand, F. Bruce Shepherd
2009	J	`jnl`	A Note on Multiflows and Treewidth. Algorithmica Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2009	A	`conf`	Dynamic vs. Oblivious Routing in Network Design. ESA Navin Goyal, Neil Olver, F. Bruce Shepherd
2009	J	`jnl`	Edge-Disjoint Paths in Planar Graphs with Constant Congestion. SIAM J. Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2008	J	`jnl`	Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discret. Math. Chandra Chekuri, F. Bruce Shepherd
2008	—	`conf`	Single-Sink Multicommodity Flow with Side Constraints. Bonn Workshop of Combinatorial Optimization F. Bruce Shepherd
2008	A*	`conf`	The vpn conjecture is true. STOC Navin Goyal, Neil Olver, F. Bruce Shepherd
2007	A*	`conf`	Buy-at-Bulk Network Design with Protection. FOCS Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang
2007	A*	`conf`	Degree-constrained network flows. STOC Patrick Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
2007	J	`jnl`	Hardness of robust network design. Networks Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà
2007	A*	`conf`	Island hopping and path colouring with applications to WDM network design. SODA Andrew McGregor, F. Bruce Shepherd
2007	J	`jnl`	Multicommodity demand flow in a tree and packing integer programs. ACM Trans. Algorithms Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
2007	J	`jnl`	The Demand-Matching Problem. Math. Oper. Res. F. Bruce Shepherd, Adrian Vetta
2006	J	`jnl`	An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory Comput. Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2006	J	`jnl`	Design tools for transparent optical networks. Bell Labs Tech. J. 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
2006	A*	`conf`	Edge-disjoint paths in Planar graphs with constant congestion. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2006	A*	`conf`	Strategic Network Formation through Peering and Service Agreements. FOCS Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
2005	A*	`conf`	Multicommodity flow, well-linked terminals, and routing problems. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2004	J	`jnl`	Content distribution for seamless transmission. SIGMETRICS Perform. Evaluation Rev. Edward G. Coffman Jr., Andreas Constantinides, Dan Rubenstein, F. Bruce Shepherd, Angelos Stavrou
2004	A*	`conf`	Edge-Disjoint Paths in Planar Graphs. FOCS Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2004	J	`jnl`	Lighting fibers in a dark network. IEEE J. Sel. Areas Commun. F. Bruce Shepherd, Adrian Vetta
2004	A*	`conf`	The all-or-nothing multicommodity flow problem. STOC Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
2003	J	`jnl`	Bipartite Domination and Simultaneous Matroid Covers. SIAM J. Discret. Math. C. W. Ko, F. Bruce Shepherd
2003	A*	`conf`	Multicommodity Demand Flow in a Tree. ICALP Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
2003	J	`jnl`	Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems. J. Comput. Syst. Sci. Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
2003	J	`jnl`	Reserving resilient capacity for a single commodity with upper-bound constraints. Networks Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd
2002	A*	`conf`	Clustering and Server Selection using Passive Monitoring. INFOCOM Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
2002	J	`jnl`	Foreword. Math. Program. Andrew R. Conn, F. Bruce Shepherd
2002	J	`jnl`	Node-Capacitated Ring Routing. Math. Oper. Res. András Frank, F. Bruce Shepherd, Vivek Tandon, Zoltán Végh
2002	A*	`conf`	Route oscillations in I-BGP with route reflection. SIGCOMM Anindya Basu, Chih-Hao Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong
2002	B	`conf`	The Demand Matching Problem. IPCO F. Bruce Shepherd, Adrian Vetta
2002	J	`jnl`	The stable paths problem and interdomain routing. IEEE/ACM Trans. Netw. Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
2001	J	`jnl`	A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. Discret. Appl. Math. F. Bruce Shepherd, Lisa Zhang
2001	J	`jnl`	Reserving Resilient Capacity in a Network. SIAM J. Discret. Math. Graham R. Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd
2000	A*	`conf`	Directed network design with orientation constraints. SODA Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd
1999	A*	`conf`	Near-Optimal Hardness Results and Approximation Algorithms for Edge-Disjoint Paths and Related Problems. STOC Venkatesan Guruswami, Sanjeev Khanna, Rajmohan Rajaraman, F. Bruce Shepherd, Mihalis Yannakakis
1999	B	`conf`	Policy Disputes in Path-Vector Protocols. ICNP Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
1998	J	`jnl`	Face extensions in planar cubic graphs. Discret. Math. Kyriakos Kilakos, F. Bruce Shepherd
1998	J	`jnl`	Strong orientations without even directed circuits. Discret. Math. A. M. H. Gerards, F. Bruce Shepherd
1998	J	`jnl`	The Graphs with All Subgraphs T-Perfect. SIAM J. Discret. Math. A. M. H. Gerards, F. Bruce Shepherd
1996	J	`jnl`	Excluding Minors in Cubic Graphs. Comb. Probab. Comput. Kyriakos Kilakos, F. Bruce Shepherd
1996	J	`jnl`	Subdivisions and the chromatic index of J. Graph Theory Kyriakos Kilakos, F. Bruce Shepherd
1996	J	`jnl`	The Gallai-Younger Conjecture for Planar Graphs. Comb. Bruce A. Reed, F. Bruce Shepherd
1995	J	`jnl`	Applying Lehman's theorems to packing problems. Math. Program. F. Bruce Shepherd
1995	J	`jnl`	Note on a Conjecture of Toft. Comb. Tommy R. Jensen, F. Bruce Shepherd
1995	J	`jnl`	Right angle free subsets in the plane. Graphs Comb. B. Gamble, William R. Pulleyblank, Bruce A. Reed, F. Bruce Shepherd
1994	J	`jnl`	A note on clutter partitions. Oper. Res. Lett. F. Bruce Shepherd
1994	J	`jnl`	Induced Circuits in Planar Graphs. J. Comb. Theory B Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1994	J	`jnl`	Near-perfect matrices. Math. Program. F. Bruce Shepherd
1993	B	`conf`	Formulations for the stable set polytope of a claw-free graph. IPCO William R. Pulleyblank, F. Bruce Shepherd
1992	—	`conf`	Non-Interfering Network Flows. SWAT Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
1991	J	`jnl`	Hamiltonicity in claw-free graphs. J. Comb. Theory B F. Bruce Shepherd
1989	J	`jnl`	Domination in graphs with minimum degree two. J. Graph Theory William McCuaig, F. Bruce Shepherd
1986	J	`jnl`	Domination parameters for the bishops graph. Discret. Math. Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd
1985	J	`jnl`	An upper bound for the J. Graph Theory Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd