No. |
Title |
Author |
Year |
---|

1 |
An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes |
Sau, Ignasi et al. |
2020 |

2 |
Bridge-Depth Characterizes Which Structural Parameterizations of Vertex Cover Admit a Polynomial Kernel |
Bougeret, Marin et al. |
2020 |

3 |
A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth |
Baste, Julien et al. |
2019 |

4 |
Dual Parameterization of Weighted Coloring |
Araújo, Júlio et al. |
2019 |

5 |
Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization |
C. M. Gomes, Guilherme et al. |
2019 |

6 |
How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? |
Bougeret, Marin et al. |
2018 |

7 |
Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth |
Baste, Julien et al. |
2018 |

8 |
Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter |
Baste, Julien et al. |
2018 |

9 |
Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism |
Kim, Eun Jung et al. |
2015 |

10 |
Explicit Linear Kernels via Dynamic Programming |
Garnero, Valentin et al. |
2014 |

11 |
The Recognition of Tolerance and Bounded Tolerance Graphs |
Mertzios, George B. et al. |
2010 |