No. Title Author Year
1 Best-Case and Worst-Case Sparsifiability of Boolean CSPs Chen, Hubie et al. 2019
2 Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth van Geffen, Bas A. M. et al. 2019
3 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
4 Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2018
5 Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations Jansen, Bart M. P. et al. 2018
6 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
7 Lower Bounds for Protrusion Replacement by Counting Equivalence Classes Jansen, Bart M. P. et al. 2017
8 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
9 Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight Jansen, Bart M. P. 2016
10 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 16


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