Pages that link to "Item:Q1799212"
From MaRDI portal
The following pages link to Parameterized complexity of length-bounded cuts and multicuts (Q1799212):
Displaying 20 items.
- Paths of bounded length and their cuts: parameterized complexity and algorithms (Q456699) (← links)
- Simple and improved parameterized algorithms for multiterminal cuts (Q987378) (← links)
- Fine-grained parameterized complexity analysis of graph coloring problems (Q2112649) (← links)
- Length-bounded cuts: proper interval graphs and structural parameters (Q2119399) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On the Parameterized Complexity of Cutting a Few Vertices from a Graph (Q2849930) (← links)
- Parametrized Complexity of Length-Bounded Cuts and Multi-cuts (Q2948489) (← links)
- Length-bounded cuts and flows (Q3188986) (← links)
- Length-Bounded Cuts and Flows (Q3613800) (← links)
- Linear-Time Parameterized Algorithms via Skew-Symmetric Multicuts (Q4554936) (← links)
- As Time Goes By: Reflections on Treewidth for Temporal Graphs (Q5042450) (← links)
- Grundy Distinguishes Treewidth from Pathwidth (Q5096586) (← links)
- Minimum Violation Vertex Maps and Their Applications to Cut Problems (Q5138968) (← links)
- Fixed-parameter tractability of multicut parameterized by the size of the cutset (Q5419117) (← links)
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset (Q5494921) (← links)
- (Q5874480) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5918674) (← links)
- Exploring the gap between treedepth and vertex cover through vertex integrity (Q5925679) (← links)
- (Q6087208) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
