No. Title Author Year
1 An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fomin, Fedor V. et al. 2020
2 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
3 Kernelization of Whitney Switches Fomin, Fedor V. et al. 2020
4 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
5 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
6 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
7 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
8 Recognizing Proper Tree-Graphs Chaplick, Steven et al. 2020
9 Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Fomin, Fedor V. et al. 2020
10 Clustering to Given Connectivities Golovach, Petr A. et al. 2019
11 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
12 Cyclability in Graph Classes Crespelle, Christophe et al. 2019
13 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
14 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
15 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
16 Finding Connected Secluded Subgraphs Golovach, Petr A. et al. 2018
17 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
18 Parameterized Aspects of Strong Subgraph Closure Golovach, Petr A. et al. 2018
19 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
20 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
21 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
22 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
23 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
24 Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality Golovach, Petr A. et al. 2015
25 Parameterized Complexity of Secluded Connectivity Problems Fomin, Fedor V. et al. 2015
26 Variants of Plane Diameter Completion Golovach, Petr A. et al. 2015
27 Connecting Vertices by Independent Trees Basavaraju, Manu et al. 2014
28 Editing to Eulerian Graphs Dabrowski, Konrad K. et al. 2014
29 Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs Chitnis, Rajesh et al. 2013
30 Parameterized Complexity of Connected Even/Odd Subgraph Problems Fomin, Fedor V. et al. 2012
Current Page :
Number of result pages: 2
Number of documents: 31


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