No. Title Author Year
1 Algorithmic Enumeration: Output-sensitive, Input-Sensitive, Parameterized, Approximative (Dagstuhl Seminar 18421) Fernau, Henning et al. 2019
2 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
3 Finding Connected Secluded Subgraphs Golovach, Petr A. et al. 2018
4 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
5 Parameterized Aspects of Strong Subgraph Closure Golovach, Petr A. et al. 2018
6 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
7 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
8 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
9 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
10 A Linear Kernel for Finding Square Roots of Almost Planar Graphs Golovach, Petr A. et al. 2016
Current Page :
Number of result pages: 2
Number of documents: 20


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