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


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