Pages that link to "Item:Q2891333"
From MaRDI portal
The following pages link to On Multiway Cut Parameterized above Lower Bounds (Q2891333):
Displaying 50 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- On the parameterized complexity of vertex cover and edge cover with connectivity constraints (Q482281) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- Edge bipartization faster than \(2^k\) (Q666655) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Branch-and-reduce exponential/FPT algorithms in practice: a case study of vertex cover (Q897878) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Parameterized complexity of length-bounded cuts and multicuts (Q1799212) (← links)
- A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
- The complexity of finding small separators in temporal graphs (Q2009634) (← links)
- Improved analysis of highest-degree branching for feedback vertex set (Q2041981) (← links)
- Structural parameterizations with modulator oblivion (Q2161010) (← links)
- Subset feedback vertex set on graphs of bounded independent set size (Q2304562) (← links)
- Faster exact algorithms for some terminal set problems (Q2361353) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- Parameterized algorithms for min-max multiway cut and list digraph homomorphism (Q2396830) (← links)
- The vertex \(k\)-cut problem (Q2419357) (← links)
- An \(O^\ast(1.84^k)\) parameterized algorithm for the multiterminal cut problem (Q2445900) (← links)
- Odd cycle transversal in mixed graphs (Q2672431) (← links)
- Large Independent Sets in Subquartic Planar Graphs (Q2803824) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- The Multi-terminal Vertex Separator Problem: Polytope Characterization and TDI-ness (Q2835687) (← links)
- FPT Suspects and Tough Customers: Open Problems of Downey and Fellows (Q2908547) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- (Q2947575) (redirect page) (← links)
- Multidimensional Binary Vector Assignment Problem: Standard, Structural and Above Guarantee Parameterizations (Q2947879) (← links)
- Important Separators and Parameterized Algorithms (Q3104759) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- A Faster Parameterized Algorithm for Group Feedback Edge Set (Q3181064) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- Multicut Is FPT (Q4605273) (← links)
- (Q4993600) (← links)
- The Complexity of Finding Small Separators in Temporal Graphs (Q5005147) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← links)
- (Q5009483) (← links)
- Parameterized Algorithms for Power-Efficiently Connecting Wireless Sensor Networks: Theory and Experiments (Q5084628) (← links)
- (Q5089231) (← links)
- Quick separation in chordal and split graphs (Q5089243) (← links)
- (Q5090486) (← links)
- A deterministic polynomial kernel for odd cycle transversal and vertex multiway cut in planar graphs (Q5090489) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- (Q5092402) (← links)
- A Linear-Time Parameterized Algorithm for Node Unique Label Cover (Q5111746) (← links)
- A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs (Q5163509) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)