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


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