Pages that link to "Item:Q1034100"
From MaRDI portal
The following pages link to Almost 2-SAT is fixed-parameter tractable (Q1034100):
Displaying 39 items.
- Backdoors to q-Horn (Q261394) (← links)
- On group feedback vertex set parameterized by the size of the cutset (Q262251) (← links)
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter (Q372970) (← links)
- Tradeoffs in the complexity of backdoors to satisfiability: dynamic sub-solvers and learning during search (Q457253) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- List H-coloring a graph by removing few vertices (Q527415) (← links)
- The complexity of König subgraph problems and above-guarantee vertex cover (Q652520) (← links)
- Kernels for below-upper-bound parameterizations of the hitting set and directed dominating set problems (Q719315) (← links)
- Multi-budgeted directed cuts (Q786027) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A kernel of order \(2k-c\log k\) for vertex cover (Q1944208) (← links)
- Graph modification for edge-coloured and signed graph homomorphism problems: parameterized and classical complexity (Q2134740) (← links)
- List-coloring -- parameterizing from triviality (Q2173305) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- Faster graph bipartization (Q2301359) (← links)
- Tractability of König edge deletion problems (Q2333799) (← links)
- Backdoors to tractable answer set programming (Q2341833) (← links)
- Linear kernels for separating a graph into components of bounded size (Q2361357) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- On Multiway Cut Parameterized above Lower Bounds (Q2891333) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Clique Cover and Graph Separation (Q2943572) (← 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)
- Linear Time Parameterized Algorithms for Subset Feedback Vertex Set (Q3448850) (← links)
- Fixed-Parameter Algorithms in Analysis of Heuristics for Extracting Networks in Linear Programs (Q3656864) (← links)
- (Q4993600) (← links)
- Multi-Budgeted Directed Cuts (Q5009480) (← 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)
- Hitting Selected (Odd) Cycles (Q5348214) (← links)
- (Q5743380) (← links)
- (Q5743512) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- Disentangling the computational complexity of network untangling (Q6151149) (← links)
- Efficiently recognizing graphs with equal independence and annihilation numbers (Q6161447) (← links)
- On Weighted Graph Separation Problems and Flow Augmentation (Q6187079) (← links)
