No. Title Author Year
1 Coresets for Clustering in Geometric Intersection Graphs Bandyapadhyay, Sayan et al. 2023
2 (Re)packing Equal Disks into Rectangle Fomin, Fedor V. et al. 2022
3 Detours in Directed Graphs Fomin, Fedor V. et al. 2022
4 Exact Exponential Algorithms for Clustering Problems Fomin, Fedor V. et al. 2022
5 FPT Approximation for Fair Minimum-Load Clustering Bandyapadhyay, Sayan et al. 2022
6 Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) Fomin, Fedor V. et al. 2022
7 Longest Cycle Above Erdős-Gallai Bound Fomin, Fedor V. et al. 2022
8 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
9 ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space Fomin, Fedor V. et al. 2021
10 On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Bandyapadhyay, Sayan et al. 2021
11 Parameterized Complexity of Feature Selection for Categorical Data Clustering Bandyapadhyay, Sayan et al. 2021
12 An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fomin, Fedor V. et al. 2020
13 Building Large k-Cores from Sparse Graphs Fomin, Fedor V. et al. 2020
14 Computation of Hadwiger Number and Related Contraction Problems: Tight Lower Bounds Fomin, Fedor V. et al. 2020
15 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
16 ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs Fomin, Fedor V. et al. 2020
17 Kernelization of Whitney Switches Fomin, Fedor V. et al. 2020
18 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
19 On the Complexity of Recovering Incidence Matrices Fomin, Fedor V. et al. 2020
20 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
21 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
22 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
23 Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Fomin, Fedor V. et al. 2020
24 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
25 Decomposition of Map Graphs with Applications Fomin, Fedor V. et al. 2019
26 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
27 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
28 New Horizons in Parameterized Complexity (Dagstuhl Seminar 19041) Fomin, Fedor V. et al. 2019
29 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
30 Path Contraction Faster Than 2^n Agrawal, Akanksha et al. 2019
31 A Fixed-Parameter Perspective on #BIS Curticapean, Radu et al. 2018
32 Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces Carpenter, Timothy et al. 2018
33 On the Optimality of Pseudo-polynomial Algorithms for Integer Programming Fomin, Fedor V. et al. 2018
34 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
35 Parameterized Low-Rank Binary Matrix Approximation Fomin, Fedor V. et al. 2018
36 Partial Complementation of Graphs Fomin, Fedor V. et al. 2018
37 Covering Vectors by Spaces: Regular Matroids Fomin, Fedor V. et al. 2017
38 Exact Algorithms for Terrain Guarding Ashok, Pradeesha et al. 2017
39 Finding Detours is Fixed-Parameter Tractable Bezáková, Ivona et al. 2017
40 Finding, Hitting and Packing Cycles in Subexponential Time on Unit Disk Graphs Fomin, Fedor V. et al. 2017
41 Matrix Rigidity from the Viewpoint of Parameterized Complexity Fomin, Fedor V. et al. 2017
42 Randomization in Parameterized Complexity (Dagstuhl Seminar 17041) Cygan, Marek et al. 2017
43 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
44 Editing to Connected f-Degree Graph Fomin, Fedor V. et al. 2016
45 Graph Decompositions and Algorithms (Invited Talk) Fomin, Fedor V. 2016
46 Kernelization and Sparseness: the Case of Dominating Set Drange, Pål Grønås et al. 2016
47 Parameterized Complexity of Secluded Connectivity Problems Fomin, Fedor V. et al. 2015
48 Connecting Vertices by Independent Trees Basavaraju, Manu et al. 2014
49 Exploring Subexponential Parameterized Complexity of Completion Problems Drange, Pal Gronas et al. 2014
50 Bidimensional Structures: Algorithms, Combinatorics and Logic (Dagstuhl Seminar 13121) Demaine, Erik D. et al. 2013
51 Linear kernels for (connected) dominating set on graphs with excluded topological subgraphs Fomin, Fedor V. et al. 2013
52 Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs Chitnis, Rajesh et al. 2013
53 Searching for better fill-in Fomin, Fedor V. et al. 2013
54 Tight bounds for Parameterized Complexity of Cluster Editing Fomin, Fedor V. et al. 2013
55 Parameterized Complexity of Connected Even/Odd Subgraph Problems Fomin, Fedor V. et al. 2012
56 Hitting forbidden minors: Approximation and Kernelization Fomin, Fedor V. et al. 2011
57 Minimum Fill-in of Sparse Graphs: Kernelization and Approximation Fomin, Fedor V. et al. 2011
58 Theory and Applications of Graph Searching Problems (GRASTA 2011) (Dagstuhl Seminar 11071) Fomin, Fedor V. et al. 2011
59 Beyond Bidimensionality: Parameterized Subexponential Algorithms on Directed Graphs Dorn, Frederic et al. 2010
60 Contraction Bidimensionality: the Accurate Picture Fomin, Fedor V. et al. 2010
61 Finding Induced Subgraphs via Minimal Triangulations Fomin, Fedor V. et al. 2010
62 Approximating Acyclicity Parameters of Sparse Hypergraphs Fomin, Fedor V. et al. 2009
63 Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves Fernau, Henning et al. 2009
64 Kernels for Feedback Arc Set In Tournaments Bessy, Stéphane et al. 2009
65 Subexponential Algorithms for Partial Cover Problems Fomin, Fedor V. et al. 2009
66 08431 Abstracts Collection -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
67 08431 Executive Summary -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
68 08431 Open Problems -- Moderately Exponential Time Algorithms Fomin, Fedor V. et al. 2008
Current Page :
Number of result pages: 1
Number of documents: 68


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