No. Title Author Year
1 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
2 On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Bandyapadhyay, Sayan et al. 2021
3 Parameterized Complexity of Feature Selection for Categorical Data Clustering Bandyapadhyay, Sayan et al. 2021
4 An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fomin, Fedor V. et al. 2020
5 Building Large k-Cores from Sparse Graphs Fomin, Fedor V. et al. 2020
6 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
7 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
8 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
9 Kernelization of Whitney Switches Fomin, Fedor V. et al. 2020
10 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
11 On the Complexity of Recovering Incidence Matrices Fomin, Fedor V. et al. 2020
12 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
13 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
14 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
15 Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Fomin, Fedor V. et al. 2020
16 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
17 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
18 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
19 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
20 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
21 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
22 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
23 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
24 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
25 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
26 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
27 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
28 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
29 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
30 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 60


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