No. Title Author Year
1 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
2 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
3 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
4 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
5 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
6 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
7 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
8 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
9 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
10 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
11 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
12 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
13 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
14 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
15 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
16 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
17 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
18 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
19 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
20 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
21 Finding Detours is Fixed-Parameter Tractable Bezáková, Ivona et al. 2017
22 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
23 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
24 Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) Cygan, Marek et al. 2017
25 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
26 Editing to Connected f-Degree Graph Fomin, Fedor V. et al. 2016
27 Graph Decompositions and Algorithms (Invited Talk) Fomin, Fedor V. 2016
28 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
29 Parameterized Complexity of Secluded Connectivity Problems Fomin, Fedor V. et al. 2015
30 Connecting Vertices by Independent Trees Basavaraju, Manu et al. 2014
Current Page :
Number of result pages: 2
Number of documents: 50


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