No. Title Author Year
1 Lower Bounds for Protrusion Replacement by Counting Equivalence Classes Jansen, Bart M. P. et al. 2017
2 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
3 Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight Jansen, Bart M. P. 2016
4 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
5 Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes de Berg, Mark et al. 2016
6 Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2016
7 Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT Jansen, Bart M. P. et al. 2015
8 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
9 Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter Jansen, Bart M. P. et al. 2011
10 Determining the Winner of a Dodgson Election is Hard Fellows, Michael et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 10


DROPS-Home | Fulltext Search | Imprint Published by LZI