No. |
Title |
Author |
Year |
1 |
(Re)packing Equal Disks into Rectangle |
Fomin, Fedor V. et al. |
2022 |
2 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |
3 |
Exact Exponential Algorithms for Clustering Problems |
Fomin, Fedor V. et al. |
2022 |
4 |
FPT Approximation for Fair Minimum-Load Clustering |
Bandyapadhyay, Sayan et al. |
2022 |
5 |
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) |
Fomin, Fedor V. et al. |
2022 |
6 |
Longest Cycle Above Erdős-Gallai Bound |
Fomin, Fedor V. et al. |
2022 |
7 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |
8 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |
9 |
Front Matter, Table of Contents, Preface, Conference Organization |
Golovach, Petr A. et al. |
2021 |
10 |
LIPIcs, Volume 214, IPEC 2021, Complete Volume |
Golovach, Petr A. et al. |
2021 |
11 |
Parameterized Complexity of Feature Selection for Categorical Data Clustering |
Bandyapadhyay, Sayan et al. |
2021 |
12 |
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration |
Golovach, Petr A. et al. |
2021 |
13 |
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL |
Fomin, Fedor V. et al. |
2020 |
14 |
Diverse Pairs of Matchings |
Fomin, Fedor V. et al. |
2020 |
15 |
Kernelization of Whitney Switches |
Fomin, Fedor V. et al. |
2020 |
16 |
Low-Rank Binary Matrix Approximation in Column-Sum Norm |
Fomin, Fedor V. et al. |
2020 |
17 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |
18 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |
19 |
Parameterized Complexity of PCA (Invited Talk) |
Fomin, Fedor V. et al. |
2020 |
20 |
Recognizing Proper Tree-Graphs |
Chaplick, Steven et al. |
2020 |
21 |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs |
Fomin, Fedor V. et al. |
2020 |
22 |
Clustering to Given Connectivities |
Golovach, Petr A. et al. |
2019 |
23 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |
24 |
Cyclability in Graph Classes |
Crespelle, Christophe et al. |
2019 |
25 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |
26 |
Modification to Planarity is Fixed Parameter Tractable |
Fomin, Fedor V. et al. |
2019 |
27 |
Parameterized k-Clustering: Tractability Island |
Fomin, Fedor V. et al. |
2019 |
28 |
Finding Connected Secluded Subgraphs |
Golovach, Petr A. et al. |
2018 |
29 |
On the Tractability of Optimization Problems on H-Graphs |
Fomin, Fedor V. et al. |
2018 |
30 |
Parameterized Aspects of Strong Subgraph Closure |
Golovach, Petr A. et al. |
2018 |