No. Title Author Year
1 A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth Baste, Julien et al. 2019
2 Dual Parameterization of Weighted Coloring Araújo, Júlio et al. 2019
3 Finding Cuts of Bounded Degree: Complexity, FPT and Exact Algorithms, and Kernelization C. M. Gomes, Guilherme et al. 2019
4 How Much Does a Treedepth Modulator Help to Obtain Polynomial Kernels Beyond Sparse Graphs? Bougeret, Marin et al. 2018
5 Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth Baste, Julien et al. 2018
6 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
7 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
8 Explicit Linear Kernels via Dynamic Programming Garnero, Valentin et al. 2014
9 The Recognition of Tolerance and Bounded Tolerance Graphs Mertzios, George B. et al. 2010
Current Page :
Number of result pages: 1
Number of documents: 9

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