8 problems

Carbonnel's conjecture. The non-redundancy of any CSP is approximately an upper bound on the kernelization of that CSP.

Kernelization characterization conjecture. $K_t$-Subgraph Hitting admits a polynomial kernel under this parameterization if and only if the graphs in $\mathcal{C}_{\Delta}$ have bo…

Let $\mathsf{WK[1]}$ be the class introduced by Hermelin et al., and let a problem be $\mathsf{WK[1]}$-hard under polynomial parameter transformations. A polynomial Turing kernel i…

DVBP kernel conjecture. DVBP has no $alpha$-approximate problem kernels of size polynomial in $mc+numflavors$, for any $alpha<600/599$.

Cao et al.'s conjecture. All of these $H$-free edge modification problems admit polynomial kernels.

RPP PSAKS conjecture. RPP has a PSAKS with respect to the parameter $c$.

The nowhere-dense domination-set kernelization dichotomy. If $\mathcal{C}$ is nowhere dense, then for each $r\in\mathbb{N}$, the textsc{Distance-$r$ Dominating Set} problem admits…

Let $G$ be a graph with a given rotation system, and let $k\geq 1$ be an integer. A drawing of $G$ respecting the prescribed rotation system is one in which the clockwise order of…