No. Title Author Year
1 Contraction-Bidimensionality of Geometric Intersection Graphs Baste, Julien et al. 2018
2 Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth Baste, Julien et al. 2018
3 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
4 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
5 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
6 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
7 FPT Algorithms for Plane Completion Problems Chatzidimitriou, Dimitris et al. 2016
8 Bidimensionality and Parameterized Algorithms (Invited Talk) Thilikos, Dimitrios M. 2015
9 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
10 Variants of Plane Diameter Completion Golovach, Petr A. et al. 2015
Current Page :
Number of result pages: 2
Number of documents: 17


DROPS-Home | Fulltext Search | Imprint Published by LZI