
Sparsification Lower Bounds for List HColoring
We investigate the List HColoring problem, the generalization of graph ...
read it

Approximate Turing Kernelization for Problems Parameterized by Treewidth
We extend the notion of lossy kernelization, introduced by Lokshtanov et...
read it

Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
The Vertex Cover problem plays an essential role in the study of polynom...
read it

Parameterized Complexity of Conflictfree Graph Coloring
Given a graph G, a qopen neighborhood conflictfree coloring or qONCF...
read it

Bestcase and Worstcase Sparsifiability of Boolean CSPs
We continue the investigation of polynomialtime sparsification for NPc...
read it

Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
We investigate polynomialtime preprocessing for the problem of hitting ...
read it

Optimal Data Reduction for Graph Coloring Using LowDegree Polynomials
The theory of kernelization can be used to rigorously analyze data reduc...
read it
Astrid Pieterse
is this you? claim profile