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