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