No. Title Author Year
1 Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel Bougeret, Marin et al. 2020
2 Optimal Polynomial-Time Compression for Boolean Max CSP Jansen, Bart M. P. et al. 2020
3 Preprocessing Vertex-Deletion Problems: Characterizing Graph Properties by Low-Rank Adjacencies Jansen, Bart M. P. et al. 2020
4 A Deterministic Polynomial Kernel for Odd Cycle Transversal and Vertex Multiway Cut in Planar Graphs Jansen, Bart M. P. et al. 2019
5 Best-Case and Worst-Case Sparsifiability of Boolean CSPs Chen, Hubie et al. 2019
6 Fine-Grained Complexity of k-OPT in Bounded-Degree Graphs for Solving TSP Bonnet, Édouard et al. 2019
7 Front Matter, Table of Contents, Preface, Conference Organization Jansen, Bart M. P. et al. 2019
8 LIPIcs, Volume 148, IPEC'19, Complete Volume Jansen, Bart M. P. et al. 2019
9 Lower Bounds for Dynamic Programming on Planar Graphs of Bounded Cutwidth van Geffen, Bas A. M. et al. 2019
10 Computing the Chromatic Number Using Graph Decompositions via Matrix Rank Jansen, Bart M. P. et al. 2018
11 Optimal Data Reduction for Graph Coloring Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2018
12 Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations Jansen, Bart M. P. et al. 2018
13 Turing Kernelization for Finding Long Paths in Graphs Excluding a Topological Minor Jansen, Bart M. P. et al. 2018
14 Lower Bounds for Protrusion Replacement by Counting Equivalence Classes Jansen, Bart M. P. et al. 2017
15 The First Parameterized Algorithms and Computational Experiments Challenge Dell, Holger et al. 2017
16 Constrained Bipartite Vertex Cover: The Easy Kernel is Essentially Tight Jansen, Bart M. P. 2016
17 Fine-Grained Complexity Analysis of Two Classic TSP Variants de Berg, Mark et al. 2016
18 Independent-Set Reconfiguration Thresholds of Hereditary Graph Classes de Berg, Mark et al. 2016
19 Optimal Sparsification for Some Binary CSPs Using Low-Degree Polynomials Jansen, Bart M. P. et al. 2016
20 Sparsification Upper and Lower Bounds for Graphs Problems and Not-All-Equal SAT Jansen, Bart M. P. et al. 2015
21 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
22 Vertex Cover Kernelization Revisited: Upper and Lower Bounds for a Refined Parameter Jansen, Bart M. P. et al. 2011
23 Determining the Winner of a Dodgson Election is Hard Fellows, Michael et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 23


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