The following pages link to Multicut Is FPT (Q4605273):
Displaying 9 items.
- Adapting the directed grid theorem into an \textsf{FPT} algorithm (Q2132350) (← links)
- Colourful components in \(k\)-caterpillars and planar graphs (Q2664941) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- Adapting the Directed Grid Theorem into an FPT Algorithm (Q5099098) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Single-exponential FPT algorithms for enumerating secluded \(\mathcal{F}\)-free subgraphs and deleting to scattered graph classes (Q6655669) (← links)
