Pages that link to "Item:Q3521946"
From MaRDI portal
The following pages link to Almost 2-SAT Is Fixed-Parameter Tractable (Extended Abstract) (Q3521946):
Displaying 10 items.
- Separator-based data reduction for signed graph balancing (Q613659) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- Data reductions, fixed parameter tractability, and random weighted \(d\)-CNF satisfiability (Q840834) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Constant ratio fixed-parameter approximation of the edge multicut problem (Q990949) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Almost 2-SAT is fixed-parameter tractable (Q1034100) (← links)
- On the Approximability of Splitting-SAT in 2-CNF Horn Formulas (Q2870016) (← links)
- Clustering with Local Restrictions (Q3012850) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)