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


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