| No. |
Title |
Author |
Year |
| 1 |
Reducing the Vertex Cover Number via Edge Contractions |
Lima, Paloma T. et al. |
2022 |
| 2 |
A New Framework for Kernelization Lower Bounds: The Case of Maximum Minimal Vertex Cover |
Araújo, Júlio et al. |
2021 |
| 3 |
A Relaxation of the Directed Disjoint Paths Problem: A Global Congestion Metric Helps |
Lopes, Raul et al. |
2020 |
| 4 |
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes |
Sau, Ignasi et al. |
2020 |
| 5 |
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel |
Bougeret, Marin et al. |
2020 |
| 6 |
Hitting Forbidden Induced Subgraphs on Bounded Treewidth Graphs |
Sau, Ignasi et al. |
2020 |
| 7 |
Reducing Graph Transversals via Edge Contractions |
Lima, Paloma T. et al. |
2020 |
| 8 |
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth |
Baste, Julien et al. |
2019 |
| 9 |
Dual Parameterization of Weighted Coloring |
Araújo, Júlio et al. |
2019 |
| 10 |
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization |
C. M. Gomes, Guilherme et al. |
2019 |
| 11 |
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? |
Bougeret, Marin et al. |
2018 |
| 12 |
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth |
Baste, Julien et al. |
2018 |
| 13 |
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter |
Baste, Julien et al. |
2018 |
| 14 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |
| 15 |
Explicit Linear Kernels via Dynamic Programming |
Garnero, Valentin et al. |
2014 |
| 16 |
The Recognition of Tolerance and Bounded Tolerance Graphs |
Mertzios, George B. et al. |
2010 |
