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


DROPS-Home | Fulltext Search | Imprint Published by LZI