Pages that link to "Item:Q5419117"
From MaRDI portal
The following pages link to Fixed-parameter tractability of multicut parameterized by the size of the cutset (Q5419117):
Displaying 34 items.
- Randomized fixed-parameter algorithms for the closest string problem (Q261382) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← 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)
- Improved parameterized and exact algorithms for cut problems on trees (Q896125) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← 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)
- Randomized parameterized algorithms for \(P_2\)-packing and co-path packing problems (Q2354298) (← links)
- A logical approach to multicut problems (Q2379958) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Dealing with several parameterized problems by random methods (Q2636503) (← links)
- Fixed-parameter tractability of directed multiway cut parameterized by the size of the cutset (Q2862207) (← 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)
- Parameterized complexity dichotomy for Steiner Multicut (Q2954992) (← links)
- Subset Feedback Vertex Set Is Fixed-Parameter Tractable (Q3012825) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- Improved Algorithms for Several Parameterized Problems Based on Random Methods (Q4632170) (← links)
- (Q5002797) (← links)
- Fixed-Parameter Algorithms for Finding Agreement Supertrees (Q5252691) (← links)
- Cluster Editing (Q5326357) (← links)
- Fixed-Parameter Tractability of Multicut Parameterized by the Size of the Cutset (Q5494921) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)
- On the Parameterized Complexity of Counting Small-Sized Minimum \(\boldsymbol{(S,T)}\)-Cuts (Q6157971) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
