The following pages link to (Q5628150):
Displayed 10 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Margin of victory for tournament solutions (Q2060724) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863) (← links)
- On Algorithms Employing Treewidth for $L$-bounded Cut Problems (Q4637663) (← links)
- On Polynomial-Time Combinatorial Algorithms for Maximum $L$-Bounded Flow (Q5119381) (← links)
- A Flexible, Natural Formulation for the Network Design Problem with Vulnerability Constraints (Q5139851) (← links)
- (Q6084397) (← links)
- (Q6087208) (← links)