We investigate the List H-Coloring problem, the generalization of graph
...
We extend the notion of lossy kernelization, introduced by Lokshtanov et...
The Vertex Cover problem plays an essential role in the study of polynom...
Given a graph G, a q-open neighborhood conflict-free coloring or
q-ONCF-...
We continue the investigation of polynomial-time sparsification for
NP-c...
We investigate polynomial-time preprocessing for the problem of hitting
...
The theory of kernelization can be used to rigorously analyze data reduc...