F. Bruce Shepherd

Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel: Flow-cut gaps for integer and fractional multiflows. J. Comb. Theory, Ser. B 103(2): 248-273 (2013)

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)

Chandra Chekuri, Guyslain Naves, F. Bruce Shepherd: Maximum Edge-Disjoint Paths in $k$-sums of Graphs. CoRR abs/1303.4897 (2013)

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

Navin Goyal, Neil Olver, F. Bruce Shepherd: Dynamic vs. Oblivious Routing in Network Design. Algorithmica 61(1): 161-173 (2011)

Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong: Strategic network formation through peering and service agreements. Games and Economic Behavior 73(1): 17-38 (2011)

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

Loïc Seguin-Charbonneau, F. Bruce Shepherd: Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. FOCS 2011: 200-209

Neil Olver, F. Bruce Shepherd: Approximability of Robust Network Design. SODA 2010: 1097-1105

Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel: Flow-Cut Gaps for Integer and Fractional Multiflows. SODA 2010: 1198-1208

Friedrich Eisenbrand, F. Bruce Shepherd (Eds.): 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

Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel: Flow-Cut Gaps for Integer and Fractional Multiflows. CoRR abs/1008.2136 (2010)

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: A Note on Multiflows and Treewidth. Algorithmica 54(3): 400-412 (2009)

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

Navin Goyal, Neil Olver, F. Bruce Shepherd: Dynamic vs. Oblivious Routing in Network Design. ESA 2009: 277-288

Chandra Chekuri, F. Bruce Shepherd: Approximate Integer Decompositions for Undirected Network Design Problems. SIAM J. Discrete Math. 23(1): 163-177 (2008)

F. Bruce Shepherd: Single-Sink Multicommodity Flow with Side Constraints. Bonn Workshop of Combinatorial Optimization 2008: 429-450

Navin Goyal, Neil Olver, F. Bruce Shepherd: The vpn conjecture is true. STOC 2008: 443-450

F. Bruce Shepherd, Adrian Vetta: The Demand-Matching Problem. Math. Oper. Res. 32(3): 563-578 (2007)

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

Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd: Multicommodity demand flow in a tree and packing integer programs. ACM Transactions on Algorithms 3(3) (2007)

Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang: Buy-at-Bulk Network Design with Protection. FOCS 2007: 634-644

P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong: Degree-constrained network flows. STOC 2007: 681-688

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 Technical Journal 11(2): 129-143 (2006)

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. Theory of Computing 2(1): 137-146 (2006)

Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong: Strategic Network Formation through Peering and Service Agreements. FOCS 2006: 77-86

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-disjoint paths in Planar graphs with constant congestion. STOC 2006: 757-766

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Multicommodity flow, well-linked terminals, and routing problems. STOC 2005: 183-192

F. Bruce Shepherd, Adrian Vetta: Lighting fibers in a dark network. IEEE Journal on Selected Areas in Communications 22(9): 1583-1588 (2004)

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: Edge-Disjoint Paths in Planar Graphs. FOCS 2004: 71-80

Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd: The all-or-nothing multicommodity flow problem. STOC 2004: 156-165

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)

Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd: Reserving resilient capacity for a single commodity with upper-bound constraints. Networks 41(2): 87-96 (2003)

C. W. Ko, F. Bruce Shepherd: Bipartite Domination and Simultaneous Matroid Covers. SIAM J. Discrete Math. 16(4): 517-523 (2003)

Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd: Multicommodity Demand Flow in a Tree. ICALP 2003: 410-425

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

Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane: Clustering and Server Selection using Passive Monitoring. INFOCOM 2002

F. Bruce Shepherd, Adrian Vetta: The Demand Matching Problem. IPCO 2002: 457-474

Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong: Route oscillations in I-BGP with route reflection. SIGCOMM 2002: 235-247

F. Bruce Shepherd, Lisa Zhang: A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. Discrete Applied Mathematics 110(2-3): 301-315 (2001)

Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd: Reserving Resilient Capacity in a Network. SIAM J. Discrete Math. 14(4): 524-539 (2001)

Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd: Directed network design with orientation constraints. SODA 2000: 663-671

Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong: Policy Disputes in Path-Vector Protocols. ICNP 1999: 21-30

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

Kyriakos Kilakos, F. Bruce Shepherd: Face extensions in planar cubic graphs. Discrete Mathematics 181(1-3): 179-191 (1998)

A. M. H. Gerards, F. Bruce Shepherd: Strong orientations without even directed circuits. Discrete Mathematics 188(1-3): 111-125 (1998)

A. M. H. Gerards, F. Bruce Shepherd: The Graphs with All Subgraphs T-Perfect. SIAM J. Discrete Math. 11(4): 524-545 (1998)

Bruce A. Reed, F. Bruce Shepherd: The Gallai-Younger Conjecture for Planar Graphs. Combinatorica 16(4): 555-566 (1996)

Kyriakos Kilakos, F. Bruce Shepherd: Excluding Minors in Cubic Graphs. Combinatorics, Probability & Computing 5: 57-78 (1996)

Kyriakos Kilakos, F. Bruce Shepherd: Subdivisions and the chromatic index of r-graphs. Journal of Graph Theory 22(3): 203-212 (1996)

T. R. Jensen, F. Bruce Shepherd: Note on a Conjecture of Toft. Combinatorica 15(3): 373-377 (1995)

B. Gamble, William R. Pulleyblank, B. Reed, F. Bruce Shepherd: Right angle free subsets in the plane. Graphs and Combinatorics 11(2): 121-129 (1995)

F. Bruce Shepherd: Applying Lehman's theorems to packing problems. Math. Program. 71: 353-367 (1995)

Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd: Induced Circuits in Planar Graphs. J. Comb. Theory, Ser. B 60(2): 169-176 (1994)

F. Bruce Shepherd: Near-perfect matrices. Math. Program. 64: 295-323 (1994)

William R. Pulleyblank, F. Bruce Shepherd: Formulations for the stable set polytope of a claw-free graph. IPCO 1993: 267-279

Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd: Non-Interfering Network Flows. SWAT 1992: 245-257

F. Bruce Shepherd: Hamiltonicity in claw-free graphs. J. Comb. Theory, Ser. B 53(2): 173-194 (1991)

Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd: Domination parameters for the bishops graph. Discrete Mathematics 58(3): 221-227 (1986)