Pages that link to "Item:Q2429346"
From MaRDI portal
The following pages link to Polynomial kernelizations for MIN \(F^{+}\Pi _{1}\) and MAX NP (Q2429346):
Displaying 7 items.
- Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space (Q2203595) (← links)
- Solving Partition Problems Almost Always Requires Pushing Many Vertices Around (Q5220192) (← links)
- Tree Deletion Set Has a Polynomial Kernel but No $\text{OPT}^\mathcal{O}(1)$ Approximation) (Q5741082) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
