The SCEAS System
| |||||||

## Search the dblp DataBase
F. Bruce Shepherd:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Edge-Disjoint Paths in Planar Graphs.**[Citation Graph (0, 0)][DBLP] FOCS, 2004, pp:71-80 [Conf] - Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong
**Strategic Network Formation through Peering and Service Agreements.**[Citation Graph (0, 0)][DBLP] FOCS, 2006, pp:77-86 [Conf] - Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
**Multicommodity Demand Flow in a Tree.**[Citation Graph (0, 0)][DBLP] ICALP, 2003, pp:410-425 [Conf] - Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
**Policy Disputes in Path-Vector Protocols.**[Citation Graph (0, 0)][DBLP] ICNP, 1999, pp:21-30 [Conf] - Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane
**Clustering and Server Selection using Passive Monitoring.**[Citation Graph (0, 0)][DBLP] INFOCOM, 2002, pp:- [Conf] - William R. Pulleyblank, F. Bruce Shepherd
**Formulations for the stable set polytope of a claw-free graph.**[Citation Graph (0, 0)][DBLP] IPCO, 1993, pp:267-279 [Conf] - F. Bruce Shepherd, Adrian Vetta
**The Demand Matching Problem.**[Citation Graph (0, 0)][DBLP] IPCO, 2002, pp:457-474 [Conf] - Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong
**Route oscillations in I-BGP with route reflection.**[Citation Graph (0, 0)][DBLP] SIGCOMM, 2002, pp:235-247 [Conf] - Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd
**Directed network design with orientation constraints.**[Citation Graph (0, 0)][DBLP] SODA, 2000, pp:663-671 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**The all-or-nothing multicommodity flow problem.**[Citation Graph (0, 0)][DBLP] STOC, 2004, pp:156-165 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Multicommodity flow, well-linked terminals, and routing problems.**[Citation Graph (0, 0)][DBLP] STOC, 2005, pp:183-192 [Conf] - Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd
**Edge-disjoint paths in Planar graphs with constant congestion.**[Citation Graph (0, 0)][DBLP] STOC, 2006, pp:757-766 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] STOC, 1999, pp:19-28 [Conf] - Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, B. Shepherd
**Non-Interfering Network Flows.**[Citation Graph (0, 0)][DBLP] SWAT, 1992, pp:245-257 [Conf] - 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.**[Citation Graph (0, 0)][DBLP] Bell Labs Technical Journal, 2006, v:11, n:2, pp:129-143 [Journal] - T. R. Jensen, F. Bruce Shepherd
**Note on a Conjecture of Toft.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1995, v:15, n:3, pp:373-377 [Journal] - Bruce A. Reed, F. Bruce Shepherd
**The Gallai-Younger Conjecture for Planar Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorica, 1996, v:16, n:4, pp:555-566 [Journal] - Kyriakos Kilakos, B. Shepherd
**Excluding Minors in Cubic Graphs.**[Citation Graph (0, 0)][DBLP] Combinatorics, Probability & Computing, 1996, v:5, n:, pp:57-78 [Journal] - F. Bruce Shepherd, Lisa Zhang
**A cycle augmentation algorithm for minimum cost multicommodity flows on a ring.**[Citation Graph (0, 0)][DBLP] Discrete Applied Mathematics, 2001, v:110, n:2-3, pp:301-315 [Journal] - 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.**[Citation Graph (0, 0)][DBLP] J. Comput. Syst. Sci., 2003, v:67, n:3, pp:473-496 [Journal] - Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd
**Induced Circuits in Planar Graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1994, v:60, n:2, pp:169-176 [Journal] - F. Bruce Shepherd
**Hamiltonicity in claw-free graphs.**[Citation Graph (0, 0)][DBLP] J. Comb. Theory, Ser. B, 1991, v:53, n:2, pp:173-194 [Journal] - F. Bruce Shepherd
**Near-perfect matrices.**[Citation Graph (0, 0)][DBLP] Math. Program., 1994, v:64, n:, pp:295-323 [Journal] - F. Bruce Shepherd
**Applying Lehman's theorems to packing problems.**[Citation Graph (0, 0)][DBLP] Math. Program., 1995, v:71, n:, pp:353-367 [Journal] - G. Brightwell, G. Oriolo, F. Bruce Shepherd
**Reserving resilient capacity for a single commodity with upper-bound constraints.**[Citation Graph (0, 0)][DBLP] Networks, 2003, v:41, n:2, pp:87-96 [Journal] - G. Brightwell, G. Oriolo, F. Bruce Shepherd
**Reserving Resilient Capacity in a Network.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2001, v:14, n:4, pp:524-539 [Journal] - A. M. H. Gerards, F. Bruce Shepherd
**The Graphs with All Subgraphs T-Perfect.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 1998, v:11, n:4, pp:524-545 [Journal] - C. W. Ko, F. Bruce Shepherd
**Bipartite Domination and Simultaneous Matroid Covers.**[Citation Graph (0, 0)][DBLP] SIAM J. Discrete Math., 2003, v:16, n:4, pp:517-523 [Journal] - Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong
**The stable paths problem and interdomain routing.**[Citation Graph (0, 0)][DBLP] IEEE/ACM Trans. Netw., 2002, v:10, n:2, pp:232-243 [Journal] - P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong
**Degree-constrained network flows.**[Citation Graph (0, 0)][DBLP] STOC, 2007, pp:681-688 [Conf] - Ernest J. Cockayne, B. Gamble, B. Shepherd
**Domination parameters for the bishops graph.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1986, v:58, n:3, pp:221-227 [Journal] - Kyriakos Kilakos, F. Bruce Shepherd
**Face extensions in planar cubic graphs.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:181, n:1-3, pp:179-191 [Journal] - A. M. H. Gerards, F. Bruce Shepherd
**Strong orientations without even directed circuits.**[Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1998, v:188, n:1-3, pp:111-125 [Journal] - Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd
**Multicommodity demand flow in a tree and packing integer programs.**[Citation Graph (0, 0)][DBLP] ACM Transactions on Algorithms, 2007, v:3, n:3, pp:- [Journal] **Dynamic vs. Oblivious Routing in Network Design.**[Citation Graph (, )][DBLP]**Buy-at-Bulk Network Design with Protection.**[Citation Graph (, )][DBLP]**Approximability of Robust Network Design.**[Citation Graph (, )][DBLP]**Flow-Cut Gaps for Integer and Fractional Multiflows.**[Citation Graph (, )][DBLP]**The vpn conjecture is true.**[Citation Graph (, )][DBLP]**A Note on Multiflows and Treewidth.**[Citation Graph (, )][DBLP]**Flow-Cut Gaps for Integer and Fractional Multiflows**[Citation Graph (, )][DBLP]
Search in 0.004secs, Finished in 0.006secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |