research
∙
09/17/2020
Sparsification Lower Bounds for List H-Coloring
We investigate the List H-Coloring problem, the generalization of graph ...
share
research
∙
04/27/2020
Approximate Turing Kernelization for Problems Parameterized by Treewidth
We extend the notion of lossy kernelization, introduced by Lokshtanov et...
research
∙
05/09/2019
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
The Vertex Cover problem plays an essential role in the study of polynom...
research
∙
05/01/2019
Parameterized Complexity of Conflict-free Graph Coloring
Given a graph G, a q-open neighborhood conflict-free coloring or q-ONCF-...
research
∙
09/17/2018
Best-case and Worst-case Sparsifiability of Boolean CSPs
We continue the investigation of polynomial-time sparsification for NP-c...
research
∙
04/24/2018
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations
We investigate polynomial-time preprocessing for the problem of hitting ...
research
∙
02/06/2018
