The following pages link to (Q5417644):
Displaying 23 items.
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- Every ternary permutation constraint satisfaction problem parameterized above average has a kernel with a quadratic number of variables (Q414863) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- A probabilistic approach to problems parameterized above or below tight bounds (Q632807) (← links)
- Solving MAX-\(r\)-SAT above a tight lower bound (Q644808) (← links)
- Note on Max Lin-2 above average (Q656604) (← links)
- Solving sparse instances of Max SAT via width reduction and greedy restriction (Q905695) (← links)
- Note on maximal bisection above tight lower bound (Q1675768) (← links)
- Betweenness parameterized above tight lower bound (Q1959433) (← links)
- Hitting forbidden minors: approximation and kernelization (Q2790404) (← links)
- Fixed-Parameter Tractability of Satisfying beyond the Number of Variables (Q2843339) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Solving #SAT and MAXSAT by Dynamic Programming (Q3196312) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- (Q5075790) (← links)
- Going Far from Degeneracy (Q5130907) (← links)
- (Q5743380) (← links)
- (Q5743381) (← links)
- Detours in directed graphs (Q6113279) (← links)
- Approximating long cycle above Dirac's guarantee (Q6586667) (← links)
