No. Title Author Year
1 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
2 Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2018
3 Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations Jansen, Bart M. P. et al. 2018
4 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
5 Lower Bounds for Protrusion Replacement by Counting Equivalence Classes Jansen, Bart M. P. et al. 2017
6 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
7 Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight Jansen, Bart M. P. 2016
8 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
9 Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes de Berg, Mark et al. 2016
10 Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 14


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