Pages that link to "Item:Q2904774"
From MaRDI portal
The following pages link to LP can be a cure for parameterized problems (Q2904774):
Displaying 17 items.
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← 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)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Data reductions and combinatorial bounds for improved approximation algorithms (Q899583) (← links)
- Parameterized algorithms and complexity for the traveling purchaser problem and its variants (Q2084609) (← links)
- Above guarantee parameterization for vertex cover on graphs with maximum degree 4 (Q2111076) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Half-integrality, LP-branching, and FPT algorithms (Q2816829) (← links)
- A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter (Q3177162) (← links)
- Designing FPT Algorithms for Cut Problems Using Randomized Contractions (Q3187169) (← links)
- New Algorithms for Edge Induced König-Egerváry Subgraph Based on Gallai-Edmonds Decomposition (Q5091022) (← links)
- Rank Vertex Cover as a Natural Problem for Algebraic Compression (Q5232153) (← links)
- (Q5875482) (← links)
- Reducing the vertex cover number via edge contractions (Q6098145) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
