The following pages link to F. Bruce Shepherd (Q634683):
Displaying 44 items.
- Dynamic vs. oblivious routing in network design (Q634684) (← links)
- (Q719869) (redirect page) (← links)
- Strategic network formation through peering and service agreements (Q719870) (← links)
- A note on multiflows and treewidth (Q834591) (← links)
- Hamiltonicity in claw-free graphs (Q1186134) (← links)
- Near-perfect matrices (Q1332310) (← links)
- A note on clutter partitions (Q1332941) (← links)
- The Gallai-Younger conjecture for planar graphs (Q1375627) (← links)
- Face extensions in planar cubic graphs (Q1381856) (← links)
- Strong orientations without even directed circuits (Q1584319) (← links)
- Note on a conjecture of Toft (Q1900186) (← links)
- Applying Lehman's theorems to packing problems (Q1919808) (← links)
- Flow-cut gaps for integer and fractional multiflows (Q1945997) (← links)
- Maximum edge-disjoint paths in planar graphs with congestion 2 (Q2039241) (← links)
- (Q2758341) (← links)
- The All-or-Nothing Multicommodity Flow Problem (Q2862199) (← links)
- Edge-disjoint paths in Planar graphs with constant congestion (Q2931436) (← links)
- Single-Sink Multicommodity Flow with Side Constraints (Q2971620) (← links)
- (Q3002769) (← links)
- Topology-Aware VM Migration in Bandwidth Oversubscribed Datacenter Networks (Q3167046) (← links)
- (Q3549729) (← links)
- Multicommodity demand flow in a tree and packing integer programs (Q3580938) (← links)
- The all-or-nothing multicommodity flow problem (Q3580965) (← links)
- Multicommodity flow, well-linked terminals, and routing problems (Q3581391) (← links)
- The Graphs with All Subgraphs T-Perfect (Q4210222) (← links)
- (Q4234148) (← links)
- (Q4449192) (← links)
- (Q4602397) (← links)
- Subdivisions and the chromatic index ofr-graphs (Q4888113) (← links)
- (Q4952683) (← links)
- (Q5009516) (← links)
- Approximability of Robust Network Design (Q5169714) (← links)
- Approximate Integer Decompositions for Undirected Network Design Problems (Q5189506) (← links)
- Edge-Disjoint Paths in Planar Graphs with Constant Congestion (Q5189546) (← links)
- Directed Network Design with Orientation Constraints (Q5317612) (← links)
- Maximum Edge-Disjoint Paths in k-Sums of Graphs (Q5326572) (← links)
- The Demand-Matching Problem (Q5388047) (← links)
- The VPN Conjecture Is True (Q5395715) (← links)
- (Q5417693) (← links)
- (Q5417700) (← links)
- Maximum Edge-Disjoint Paths in Planar Graphs with Congestion 2 (Q5495017) (← links)
- (Q5717957) (← links)
- Maximum weight disjoint paths in outerplanar graphs via single-tree cut approximators (Q5925650) (← links)
- A knapsack intersection hierarchy (Q6161286) (← links)
