F. Bruce Shepherd

From MaRDI portal
Person:634683

Available identifiers

zbMath Open shepherd.f-bruceMaRDI QIDQ634683

List of research outcomes

PublicationDate of PublicationType
Cut-sufficient directed 2-commodity multiflow topologies2023-11-09Paper
A knapsack intersection hierarchy2023-06-27Paper
Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators2023-03-14Paper
https://portal.mardi4nfdi.de/entity/Q50095162021-08-04Paper
Maximum edge-disjoint paths in planar graphs with congestion 22021-07-02Paper
https://portal.mardi4nfdi.de/entity/Q46023972018-01-10Paper
Single-Sink Multicommodity Flow with Side Constraints2017-04-07Paper
Edge-disjoint paths in Planar graphs with constant congestion2014-11-25Paper
Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 22014-07-30Paper
Approximability of Robust Network Design2014-07-11Paper
https://portal.mardi4nfdi.de/entity/Q54176932014-05-22Paper
https://portal.mardi4nfdi.de/entity/Q54177002014-05-22Paper
The VPN Conjecture Is True2014-02-17Paper
The All-or-Nothing Multicommodity Flow Problem2013-11-14Paper
Maximum Edge-Disjoint Paths in k-Sums of Graphs2013-08-06Paper
Flow-cut gaps for integer and fractional multiflows2013-04-17Paper
Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks2012-11-01Paper
Strategic network formation through peering and service agreements2011-10-12Paper
Dynamic vs. oblivious routing in network design2011-08-16Paper
https://portal.mardi4nfdi.de/entity/Q30027692011-05-24Paper
Multicommodity flow, well-linked terminals, and routing problems2010-08-16Paper
The all-or-nothing multicommodity flow problem2010-08-15Paper
Multicommodity demand flow in a tree and packing integer programs2010-08-14Paper
Approximate Integer Decompositions for Undirected Network Design Problems2010-03-17Paper
Edge-Disjoint Paths in Planar Graphs with Constant Congestion2010-03-17Paper
Dynamic vs. oblivious routing in network design2009-10-29Paper
A note on multiflows and treewidth2009-08-27Paper
https://portal.mardi4nfdi.de/entity/Q35497292009-01-05Paper
The Demand-Matching Problem2008-05-27Paper
https://portal.mardi4nfdi.de/entity/Q57179572006-01-13Paper
Directed Network Design with Orientation Constraints2005-09-16Paper
https://portal.mardi4nfdi.de/entity/Q44491922004-02-08Paper
https://portal.mardi4nfdi.de/entity/Q27583412001-01-01Paper
Strong orientations without even directed circuits2000-11-02Paper
https://portal.mardi4nfdi.de/entity/Q49526832000-10-23Paper
https://portal.mardi4nfdi.de/entity/Q42341482000-10-10Paper
The Graphs with All Subgraphs T-Perfect1998-09-21Paper
Face extensions in planar cubic graphs1998-04-01Paper
The Gallai-Younger conjecture for planar graphs1998-01-07Paper
Applying Lehman's theorems to packing problems1996-09-18Paper
https://portal.mardi4nfdi.de/entity/Q48881131996-07-23Paper
Note on a conjecture of Toft1996-02-08Paper
Near-perfect matrices1994-10-10Paper
A note on clutter partitions1994-09-05Paper
Hamiltonicity in claw-free graphs1992-06-28Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: F. Bruce Shepherd