Pages that link to "Item:Q3656863"
From MaRDI portal
The following pages link to Paths of Bounded Length and Their Cuts: Parameterized Complexity and Algorithms (Q3656863):
Displaying 9 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of some optimization problems related to multiple-interval graphs (Q606990) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- Parameterized complexity of \textsc{bandwidth} of \textsc{caterpillars} and \textsc{weighted path emulation} (Q2672420) (← links)
- A Polynomial Time Algorithm for Bounded Directed Pathwidth (Q3104788) (← links)
- (Q3341926) (← links)
- On the length of simplex paths: The assignment case (Q3698637) (← links)