| No. |
Title |
Author |
Year |
| 1 |
Approximate Turing Kernelization for Problems Parameterized by Treewidth |
Hols, Eva-Maria C. et al. |
2020 |
| 2 |
Elimination Distances, Blocking Sets, and Kernels for Vertex Cover |
Hols, Eva-Maria C. et al. |
2020 |
| 3 |
Sparsification Lower Bounds for List H-Coloring |
Chen, Hubie et al. |
2020 |
| 4 |
Best-Case and Worst-Case Sparsifiability of Boolean CSPs |
Chen, Hubie et al. |
2019 |
| 5 |
Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials |
Jansen, Bart M. P. et al. |
2018 |
| 6 |
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations |
Jansen, Bart M. P. et al. |
2018 |
| 7 |
Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials |
Jansen, Bart M. P. et al. |
2016 |
| 8 |
Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT |
Jansen, Bart M. P. et al. |
2015 |
