No. Title Author Year
1 Tight Algorithmic Applications of Clique-Width Generalizations Chekan, Vera et al. 2023
2 Tight Algorithms for Connectivity Problems Parameterized by Clique-Width Hegerfeld, Falko et al. 2023
3 Tight Bounds for Connectivity Problems Parameterized by Cutwidth Bojikian, Narek et al. 2023
4 Towards Exact Structural Thresholds for Parameterized Complexity Hegerfeld, Falko et al. 2022
5 Approximate Turing Kernelization for Problems Parameterized by Treewidth Hols, Eva-Maria C. et al. 2020
6 Efficient Parameterized Algorithms for Computing All-Pairs Shortest Paths Kratsch, Stefan et al. 2020
7 Elimination Distances, Blocking Sets, and Kernels for Vertex Cover Hols, Eva-Maria C. et al. 2020
8 Solving Connectivity Problems Parameterized by Treedepth in Single-Exponential Time and Polynomial Space Hegerfeld, Falko et al. 2020
9 Multi-Budgeted Directed Cuts Kratsch, Stefan et al. 2019
10 On Adaptive Algorithms for Maximum Matching Hegerfeld, Falko et al. 2019
11 On Kernelization for Edge Dominating Set under Structural Parameters Hols, Eva-Maria C. et al. 2019
12 Parameterized Approximation Schemes for Independent Set of Rectangles and Geometric Knapsack Grandoni, Fabrizio et al. 2019
13 Synergies between Adaptive Analysis of Algorithms, Parameterized Complexity, Compressed Data Structures and Compressed Indices (Dagstuhl Seminar 18281) Barbay, Jérémy et al. 2019
14 Efficient and Adaptive Parameterized Algorithms on Modular Decompositions Kratsch, Stefan et al. 2018
15 Smaller Parameters for Vertex Cover Kernelization Hols, Eva-Maria C. et al. 2018
16 Revenue Maximization in Stackelberg Pricing Games: Beyond the Combinatorial Setting Böhnlein, Toni et al. 2017
17 Robust and Adaptive Search Disser, Yann et al. 2017
18 The Parameterized Complexity of Finding a 2-Sphere in a Simplicial Complex Burton, Benjamin et al. 2017
19 A Randomized Polynomial Kernel for Subset Feedback Vertex Set Hols, Eva-Maria C. et al. 2016
20 A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter Kratsch, Stefan 2016
21 Preprocessing Under Uncertainty Fafianie, Stefan et al. 2016
22 Preprocessing Under Uncertainty: Matroid Intersection Fafianie, Stefan et al. 2016
23 On Kernelization and Approximation for the Vector Connectivity Problem Kratsch, Stefan et al. 2015
24 Optimality and tight results in parameterized complexity (Dagstuhl Seminar 14451) Kratsch, Stefan et al. 2015
25 The Parameterized Complexity of the Minimum Shared Edges Problem Fluschnik, Till et al. 2015
26 On Polynomial Kernels for Sparse Integer Linear Programs Kratsch, Stefan 2013
27 Tight bounds for Parameterized Complexity of Cluster Editing Fomin, Fedor V. et al. 2013
28 Cross-Composition: A New Technique for Kernelization Lower Bounds Bodlaender, Hans L. et al. 2011
29 Polynomial Kernelizations for MIN F^+Pi_1 and MAX NP Kratsch, Stefan 2009
Current Page :
Number of result pages: 1
Number of documents: 29

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