Pages that link to "Item:Q644808"
From MaRDI portal
The following pages link to Solving MAX-\(r\)-SAT above a tight lower bound (Q644808):
Displaying 41 items.
- Parameterizations of test cover with bounded test sizes (Q261370) (← links)
- Parameterized algorithms for finding square roots (Q262249) (← links)
- Preprocessing subgraph and minor problems: when does a small vertex cover help? (Q386050) (← links)
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- A new bound for 3-satisfiable MaxSat and its algorithmic application (Q393085) (← links)
- Fixed-parameter tractability of satisfying beyond the number of variables (Q528862) (← links)
- Hypercontractive inequality for pseudo-Boolean functions of bounded Fourier width (Q713329) (← links)
- Linear kernels and linear-time algorithms for finding large cuts (Q722541) (← links)
- The complexity of degree anonymization by vertex addition (Q897957) (← links)
- Parameterized complexity and approximation issues for the colorful components problems (Q1643155) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Algorithms for \((n,3)\)-MAXSAT and parameterization above the all-true assignment (Q2283027) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- A complete parameterized complexity analysis of bounded planning (Q2353405) (← links)
- Parameterized complexity of satisfying almost all linear equations over \(\mathbb F_2\) (Q2392244) (← links)
- Meta-kernelization using well-structured modulators (Q2413976) (← links)
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound (Q2453557) (← links)
- Satisfying more than half of a system of linear equations over GF(2): a multivariate approach (Q2637641) (← links)
- Improved Parameterized Algorithms for above Average Constraint Satisfaction (Q2891342) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- Basic Terminology, Notation and Results (Q3120433) (← links)
- Solving #SAT and MAXSAT by Dynamic Programming (Q3196312) (← links)
- Simultaneous Approximation of Constraint Satisfaction Problems (Q3448785) (← links)
- Exploiting Unit Propagation to Compute Lower Bounds in Branch and Bound Max-SAT Solvers (Q3524192) (← links)
- Finding Detours is Fixed-Parameter Tractable (Q4972756) (← links)
- (Q4993600) (← links)
- (Q5092402) (← links)
- (Q5116487) (← links)
- Large Independent Sets in Triangle-Free Planar Graphs (Q5270410) (← links)
- (Q5417644) (← links)
- Parameterized Traveling Salesman Problem: Beating the Average (Q5743554) (← links)
- Parameterized Pre-Coloring Extension and List Coloring Problems (Q5857010) (← links)
- (Q5874535) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
- Faster Existential FO Model Checking on Posets (Q5892117) (← links)
- On the parallel parameterized complexity of MaxSAT variants (Q6535422) (← links)
- Long directed detours: reduction to 2-disjoint paths (Q6551717) (← links)
- The shortest path reconfiguration problem based on relaxation of reconfiguration rules (Q6575398) (← links)
