No. Title Author Year
1 An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fomin, Fedor V. et al. 2020
2 Building Large k-Cores from Sparse Graphs Fomin, Fedor V. et al. 2020
3 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
4 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
5 Kernelization of Whitney Switches Fomin, Fedor V. et al. 2020
6 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
7 On the Complexity of Recovering Incidence Matrices Fomin, Fedor V. et al. 2020
8 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
9 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
10 Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Fomin, Fedor V. et al. 2020
11 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
12 Decomposition of Map Graphs with Applications Fomin, Fedor V. 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 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
16 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
17 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
18 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
19 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
20 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
21 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. 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 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
26 Finding Detours is Fixed-Parameter Tractable Bezáková, Ivona et al. 2017
27 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
28 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
29 Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) Cygan, Marek et al. 2017
30 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 55


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