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


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI