Pages that link to "Item:Q3499722"
From MaRDI portal
The following pages link to Parameterizing MAX SNP Problems Above Guaranteed Values (Q3499722):
Displaying 7 items.
- Parameterized complexity of MaxSat above average (Q392026) (← links)
- On the parameterized vertex cover problem for graphs with perfect matching (Q893740) (← links)
- Parameterizing above or below guaranteed values (Q1004602) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey (Q2908541) (← links)
- The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number (Q5387763) (← links)
- Exact Algorithms for Maximum Acyclic Subgraph on a Superclass of Cubic Graphs (Q5452161) (← links)
