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

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