Bruce Shepherd - Publications
-
Policy Disputes in Path-Vector Protocols,
with T.G. Griffin, G.T. Wilfong.
International Conference on Network Protocols, ICNP '99.
-
Reserving Resilient Capacity with Upper Bound Constraints,
with G. Brightwell, G. Oriolo, August 1999.
-
Directed Network Design Problems with Orientation
Constraints,
with S. Khanna, S. Naor, August 1999.
-
An Augmentation Algorithm for Mincost Multicommodity Flow on a Ring,
with Lisa Zhang,
Globecomm '99, High Speed Networks, Dec. 1999.
-
Near-Optimal Hardness Results and Approximation Algorithms for
Edge-Disjoint Paths and Related Problems,
with
Venkat Guruswami,
Sanjeev Khanna,
Raj Rajaraman,
Mihalis Yannakakis,
Proc. 31st Annual ACM Symposium on Theory of Computing (STOC),
pp. 19-28, 1999.
-
Some strategies for reserving resilient capacity,
with G. Brightwell, G. Oriolo, 1998.
-
Node-capacitated multicommodity routing for a ring,
with V. Tandon, A. Frank, Z. Vegh, 1998.
-
The graphs with all subgraphs t-perfect, with A.M.H. Gerards,
Siam Journal of Discrete Mathematics,
vol. 11, No. 4, 1998, 524-545.
-
Strong orientations without even directed circuits,
with A.M.H. Gerards,
Discrete Mathematics,
vol. 188,
1998, 111-125.
-
Face extensions in planar cubic graphs,
with K. Kilakos,
Discrete Mathematics, vol. 181,
1998, 179-191.
-
The Gallai-Younger Conjecture holds for planar graphs,
with B. Reed,
Combinatorica, vol. 16, 1996, 555-566.
-
Routing and configuration of static path optical transport networks,
with E. Lowe, N. Walker,
IEE Electronic Letters, vol. 32, 1996, 1913-1914.
-
Excluding minors in cubic graphs,
with K. Kilakos,
Combinatorics, Computing and Probability, vol. 3, 1996, 57-58.
-
Applying Lehman's theorem to packing problems,
Mathematical Programming, vol. 71,
1995, 353-366.
-
Subdivisions and the chromatic index of r-graphs,
with K. Kilakos,
Journal of Graph Theory Theory,
vol 22, 1996, 203-211.
-
Right angle free subsets in the plane,
with A. Gamble, W. Pulleyblank, B. Reed,
Graphs and Combinatorics, vol. 11, 1995, 121-129.
-
A note on a conjecture of Toft
, with T.R. Jensen,
Combinatorica, vol. 15, 1995, 373-377.
-
Adding an identity to a totally unimodular matrix,
with C.W. Ko,
LSE Op. Res. Working Paper LSEOR.94.14, May, 1994,
submitted to SIAM Journal Discrete Mathematics.
-
A note on clutter partitions, Operations Research
Letters, vol. 15, 1994, 127-131.
-
Near-perfect matrices,
Mathematical Programming, vol. 64, 1994, 295-323.
-
Induced circuits in planar graphs,
with C. McDiarmid, B. Reed, A. Schrijver,
Journal of Combinatorial Theory (B), vol. 60, 1994, 169-176.
-
Formulations for the stable set polytope,
with W. Pulleyblank,
Proceedings of Integer Programming and Combinatorial Optimization
'93, Erice, Italy, 1993.
-
Preselecting homotopies for the weighted disjoint paths problem,
with A.M.H. Gerards,
manuscript, 1993.
-
On splitable sets,
with W. Pulleyblank, B. Reed,
Graph Theory Notes of New York XXIII,
Eds. J.W. Kennedy, Louis V. Quintas,
New York Academy of Sciences 1992, 11-20.
-
Non-interfering network flows,
with C. McDiarmid, B. Reed, A. Schrijver,
Scandinavian Workshop on Algorithm
Theory (SWAT 92), Helsink, July 8-10, 1992.
-
Hamiltonicity in claw-free graphs,
Journal of Combinatorial Theory (B), vol. 53, 1991, 173-194.
-
Domination in graphs with minimum degree two,
with W. McCuaig,
Journal of Graph Theory,
vol. 13,
1989, 749-762.
-
Domination parameters for the bishops graph,
with E.J. Cockayne and A.B. Gamble,
Discrete Mathematics,
vol. 58,
1986, 221-227.
-
An upper bound for the k-domination number of a graph,
with E.J. Cockayne and A.B. Gamble,
Journal of Graph Theory,
vol. 9,
1985, 533-534.
-
Domination of chessboards by queens on a column,
with E.J. Cockayne and A.B. Gamble,
Ars Combinatoria,
vol. 19,
1985, 105-118.