No. Title Author Year
1 An FPT-Algorithm for Recognizing k-Apices of Minor-Closed Graph Classes Sau, Ignasi et al. 2020
2 A Complexity Dichotomy for Hitting Small Planar Minors Parameterized by Treewidth Baste, Julien et al. 2019
3 Clustering to Given Connectivities Golovach, Petr A. et al. 2019
4 Connected Search for a Lazy Robber Adler, Isolde et al. 2019
5 Lean Tree-Cut Decompositions: Obstructions and Algorithms Giannopoulou, Archontia C. et al. 2019
6 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
7 Contraction-Bidimensionality of Geometric Intersection Graphs Baste, Julien et al. 2018
8 Data-Compression for Parametrized Counting Problems on Sparse Graphs Kim, Eun Jung et al. 2018
9 Optimal Algorithms for Hitting (Topological) Minors on Graphs of Bounded Treewidth Baste, Julien et al. 2018
10 Parameterized Complexity of Finding a Spanning Tree with Minimum Reload Cost Diameter Baste, Julien et al. 2018
11 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
12 Cutwidth: Obstructions and Algorithmic Aspects Giannopoulou, Archontia C. et al. 2017
13 Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes Giannopoulou, Archontia C. et al. 2017
14 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
15 FPT Algorithms for Plane Completion Problems Chatzidimitriou, Dimitris et al. 2016
16 Bidimensionality and Parameterized Algorithms (Invited Talk) Thilikos, Dimitrios M. 2015
17 Parameterized Algorithms for Min-Max Multiway Cut and List Digraph Homomorphism Kim, Eun Jung et al. 2015
18 Variants of Plane Diameter Completion Golovach, Petr A. et al. 2015
19 Explicit Linear Kernels via Dynamic Programming Garnero, Valentin et al. 2014
20 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Demaine, Erik D. et al. 2013
21 Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs Fomin, Fedor V. et al. 2013
22 Contraction checking in graphs on surfaces Kaminski, Marcin et al. 2012
23 Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) Fomin, Fedor V. et al. 2011
24 Contraction Bidimensionality: the Accurate Picture Fomin, Fedor V. et al. 2010
25 Approximating Acyclicity Parameters of Sparse Hypergraphs Fomin, Fedor V. et al. 2009
Current Page :
Number of result pages: 1
Number of documents: 25


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