The following pages link to Multicut is FPT (Q5419116):
Displayed 29 items.
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- The complexity of multicut and mixed multicut problems in (di)graphs (Q391767) (← links)
- Multicut in trees viewed through the eyes of vertex cover (Q440014) (← links)
- Restricted vertex multicut on permutation graphs (Q444445) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- On the parameterized complexity of finding separators with non-hereditary properties (Q494799) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- An FPT algorithm for planar multicuts with sources and sinks on the outer face (Q1755788) (← links)
- Complexity of the multicut problem, in its vanilla, partial and generalized versions, in graphs of bounded treewidth (Q2290633) (← links)
- On the parameterized complexity of separating certain sources from the target (Q2330108) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Multicuts in planar and bounded-genus graphs with bounded number of terminals (Q2408168) (← links)
- On the generalized multiway cut in trees problem (Q2436662) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- On Polynomial Kernels for Structural Parameterizations of Odd Cycle Transversal (Q2891343) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Multicut Is FPT (Q4605273) (← links)
- A Near-Linear Approximation Scheme for Multicuts of Embedded Graphs With a Fixed Number of Terminals (Q5149755) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Cluster Editing (Q5326357) (← links)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)