No. Title Author Year
1 Finding Connected Secluded Subgraphs Golovach, Petr A. et al. 2018
2 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
3 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
4 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
5 Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality Golovach, Petr A. et al. 2015
6 Parameterized Complexity of Secluded Connectivity Problems Fomin, Fedor V. et al. 2015
7 Variants of Plane Diameter Completion Golovach, Petr A. et al. 2015
8 Connecting Vertices by Independent Trees Basavaraju, Manu et al. 2014
9 Editing to Eulerian Graphs Dabrowski, Konrad K. et al. 2014
10 Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs Chitnis, Rajesh et al. 2013
Current Page :
Number of result pages: 2
Number of documents: 12


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