|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 28 occurrences of 19 keywords
|
|
|
|
|
Results
Found 53 publication records. Showing 53 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design.  |
Algorithmica  |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong |
Strategic network formation through peering and service agreements. |
Games and Economic Behavior |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang |
Buy-at-Bulk Network Design with Protection. |
Math. Oper. Res. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Loïc Seguin-Charbonneau, F. Bruce Shepherd |
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2. |
FOCS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel |
Flow-Cut Gaps for Integer and Fractional Multiflows |
CoRR |
2010 |
DBLP BibTeX RDF |
|
| 1 | Neil Olver, F. Bruce Shepherd |
Approximability of Robust Network Design. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Chandra Chekuri, F. Bruce Shepherd, Christophe Weibel |
Flow-Cut Gaps for Integer and Fractional Multiflows. |
SODA |
2010 |
DBLP BibTeX RDF |
|
| 1 | Friedrich Eisenbrand, F. Bruce Shepherd (eds.) |
Integer Programming and Combinatorial Optimization, 14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010. Proceedings |
IPCO |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
A Note on Multiflows and Treewidth. |
Algorithmica |
2009 |
DBLP DOI BibTeX RDF |
Product multicommodity flow, Treewidth, Edge-disjoint paths |
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs with Constant Congestion. |
SIAM J. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
Dynamic vs. Oblivious Routing in Network Design. |
ESA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, F. Bruce Shepherd |
Approximate Integer Decompositions for Undirected Network Design Problems. |
SIAM J. Discrete Math. |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Navin Goyal, Neil Olver, F. Bruce Shepherd |
The vpn conjecture is true. |
STOC |
2008 |
DBLP DOI BibTeX RDF |
network design, robust optimization, oblivious routing |
| 1 | Chandra Chekuri, F. Bruce Shepherd, Gianpaolo Oriolo, Maria Grazia Scutellà |
Hardness of robust network design. |
Networks |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity demand flow in a tree and packing integer programs. |
ACM Transactions on Algorithms |
2007 |
DBLP DOI BibTeX RDF |
Integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
| 1 | F. Bruce Shepherd, Adrian Vetta |
The Demand-Matching Problem. |
Math. Oper. Res. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Spyridon Antonakopoulos, Chandra Chekuri, F. Bruce Shepherd, Lisa Zhang |
Buy-at-Bulk Network Design with Protection. |
FOCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | P. Donovan, F. Bruce Shepherd, Adrian Vetta, Gordon T. Wilfong |
Degree-constrained network flows. |
STOC |
2007 |
DBLP DOI BibTeX RDF |
congestion, network flow |
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
An O(sqrt(n)) Approximation and Integrality Gap for Disjoint Paths and Unsplittable Flow. |
Theory of Computing |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elliot Anshelevich, F. Bruce Shepherd, Gordon T. Wilfong |
Strategic Network Formation through Peering and Service Agreements. |
FOCS |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-disjoint paths in Planar graphs with constant congestion. |
STOC |
2006 |
DBLP DOI BibTeX RDF |
Planar graphs, multicommodity flow, edge-disjoint paths |
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Multicommodity flow, well-linked terminals, and routing problems. |
STOC |
2005 |
DBLP DOI BibTeX RDF |
all-or-nothing flow, flow-cut gaps, network routing, multicommodity flow, disjoint paths |
| 1 | F. Bruce Shepherd, Adrian Vetta |
Lighting fibers in a dark network. |
IEEE Journal on Selected Areas in Communications |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
Edge-Disjoint Paths in Planar Graphs. |
FOCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Sanjeev Khanna, F. Bruce Shepherd |
The all-or-nothing multicommodity flow problem. |
STOC |
2004 |
DBLP DOI BibTeX RDF |
all-or-nothing multicommodity flow, approximation algorithms, online algorithms, multicommodity flow, oblivious routing, edge disjoint paths |
| 1 | Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd |
Reserving resilient capacity for a single commodity with upper-bound constraints. |
Networks |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | C. W. Ko, F. Bruce Shepherd |
Bipartite Domination and Simultaneous Matroid Covers. |
SIAM J. Discrete Math. |
2003 |
DBLP BibTeX RDF |
|
| 1 | 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. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Chandra Chekuri, Marcelo Mydlarz, F. Bruce Shepherd |
Multicommodity Demand Flow in a Tree. |
ICALP |
2003 |
DBLP DOI BibTeX RDF |
integer multicommodity flow, packing integer program, approximation algorithm, tree, integrality gap |
| 1 | Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong |
The stable paths problem and interdomain routing. |
IEEE/ACM Trans. Netw. |
2002 |
DBLP BibTeX RDF |
path vector protocols, stable routing, BGP, Border Gateway Protocol, interdomain routing, internet routing |
| 1 | Anindya Basu, C.-H. Luke Ong, April Rasala, F. Bruce Shepherd, Gordon T. Wilfong |
Route oscillations in I-BGP with route reflection. |
SIGCOMM |
2002 |
DBLP DOI BibTeX RDF |
I-BGP, route oscillations, route reflection, stability |
| 1 | Matthew Andrews, F. Bruce Shepherd, Aravind Srinivasan, Peter Winkler, Francis Zane |
Clustering and Server Selection using Passive Monitoring. |
INFOCOM |
2002 |
DBLP BibTeX RDF |
|
| 1 | F. Bruce Shepherd, Adrian Vetta |
The Demand Matching Problem. |
IPCO |
2002 |
DBLP BibTeX RDF |
|
| 1 | Graham Brightwell, Gianpaolo Oriolo, F. Bruce Shepherd |
Reserving Resilient Capacity in a Network. |
SIAM J. Discrete Math. |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Bruce Shepherd, Lisa Zhang |
A cycle augmentation algorithm for minimum cost multicommodity flows on a ring. |
Discrete Applied Mathematics |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Sanjeev Khanna, Joseph Naor, F. Bruce Shepherd |
Directed network design with orientation constraints. |
SODA |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Timothy Griffin, F. Bruce Shepherd, Gordon T. Wilfong |
Policy Disputes in Path-Vector Protocols. (PDF / PS) |
ICNP |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | 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 |
DBLP DOI BibTeX RDF |
|
| 1 | A. M. H. Gerards, F. Bruce Shepherd |
Strong orientations without even directed circuits. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriakos Kilakos, F. Bruce Shepherd |
Face extensions in planar cubic graphs. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | A. M. H. Gerards, F. Bruce Shepherd |
The Graphs with All Subgraphs T-Perfect. |
SIAM J. Discrete Math. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Kyriakos Kilakos, F. Bruce Shepherd |
Excluding Minors in Cubic Graphs. |
Combinatorics, Probability & Computing |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Bruce A. Reed, F. Bruce Shepherd |
The Gallai-Younger Conjecture for Planar Graphs. |
Combinatorica |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | B. Gamble, William R. Pulleyblank, B. Reed, F. Bruce Shepherd |
Right angle free subsets in the plane. |
Graphs and Combinatorics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | T. R. Jensen, F. Bruce Shepherd |
Note on a Conjecture of Toft. |
Combinatorica |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Bruce Shepherd |
Applying Lehman's theorems to packing problems. |
Math. Program. |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Colin J. H. McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd |
Induced Circuits in Planar Graphs. |
J. Comb. Theory, Ser. B |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Bruce Shepherd |
Near-perfect matrices. |
Math. Program. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | William R. Pulleyblank, F. Bruce Shepherd |
Formulations for the stable set polytope of a claw-free graph. |
IPCO |
1993 |
DBLP BibTeX RDF |
|
| 1 | Colin McDiarmid, Bruce A. Reed, Alexander Schrijver, F. Bruce Shepherd |
Non-Interfering Network Flows. |
SWAT |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | F. Bruce Shepherd |
Hamiltonicity in claw-free graphs. |
J. Comb. Theory, Ser. B |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, B. Gamble, F. Bruce Shepherd |
Domination parameters for the bishops graph. |
Discrete Mathematics |
1986 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #53 of 53 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")