No. Title Author Year
1 A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth Baste, Julien et al. 2019
2 Lean Tree-Cut Decompositions: Obstructions and Algorithms Giannopoulou, Archontia C. et al. 2019
3 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
4 Contraction-Bidimensionality of Geometric Intersection Graphs Baste, Julien et al. 2018
5 Data-Compression for Parametrized Counting Problems on Sparse Graphs Kim, Eun Jung et al. 2018
6 Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth Baste, Julien et al. 2018
7 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
8 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
9 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
10 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
Current Page :
Number of result pages: 3
Number of documents: 22


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