Pages that link to "Item:Q3587416"
From MaRDI portal
The following pages link to Preprocessing of Min Ones Problems: A Dichotomy (Q3587416):
Displaying 13 items.
- Solving min ones 2-SAT as fast as vertex cover (Q393120) (← links)
- Lower bounds on kernelization (Q456702) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- A completeness theory for polynomial (Turing) kernelization (Q2343083) (← links)
- Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346) (← links)
- Parameterized Algorithms and Kernels for 3-Hitting Set with Parity Constraints (Q2947024) (← links)
- Constraint Satisfaction Parameterized by Solution Size (Q3012823) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- (Q5743378) (← links)
- (Q5743381) (← links)
- (Q5743382) (← links)
- (Q5874535) (← links)
- Parameterized complexity and kernelizability of max ones and exact ones problems (Q5890961) (← links)
