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 |
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges |
Fomin, Fedor V. et al. |
2023 |

4 |
Kernelization for Spreading Points |
Fomin, Fedor V. et al. |
2023 |

5 |
(Re)packing Equal Disks into Rectangle |
Fomin, Fedor V. et al. |
2022 |

6 |
Detours in Directed Graphs |
Fomin, Fedor V. et al. |
2022 |

7 |
Exact Exponential Algorithms for Clustering Problems |
Fomin, Fedor V. et al. |
2022 |

8 |
FPT Approximation for Fair Minimum-Load Clustering |
Bandyapadhyay, Sayan et al. |
2022 |

9 |
Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) |
Fomin, Fedor V. et al. |
2022 |

10 |
Longest Cycle Above Erdős-Gallai Bound |
Fomin, Fedor V. et al. |
2022 |

11 |
Diverse Collections in Matroids and Graphs |
Fomin, Fedor V. et al. |
2021 |

12 |
ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space |
Fomin, Fedor V. et al. |
2021 |

13 |
Front Matter, Table of Contents, Preface, Conference Organization |
Golovach, Petr A. et al. |
2021 |

14 |
LIPIcs, Volume 214, IPEC 2021, Complete Volume |
Golovach, Petr A. et al. |
2021 |

15 |
Parameterized Complexity of Feature Selection for Categorical Data Clustering |
Bandyapadhyay, Sayan et al. |
2021 |

16 |
Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration |
Golovach, Petr A. et al. |
2021 |

17 |
An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL |
Fomin, Fedor V. et al. |
2020 |

18 |
Diverse Pairs of Matchings |
Fomin, Fedor V. et al. |
2020 |

19 |
Kernelization of Whitney Switches |
Fomin, Fedor V. et al. |
2020 |

20 |
Low-Rank Binary Matrix Approximation in Column-Sum Norm |
Fomin, Fedor V. et al. |
2020 |

21 |
Parameterization Above a Multiplicative Guarantee |
Fomin, Fedor V. et al. |
2020 |

22 |
Parameterized Complexity of Directed Spanner Problems |
Fomin, Fedor V. et al. |
2020 |

23 |
Parameterized Complexity of PCA (Invited Talk) |
Fomin, Fedor V. et al. |
2020 |

24 |
Recognizing Proper Tree-Graphs |
Chaplick, Steven et al. |
2020 |

25 |
Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs |
Fomin, Fedor V. et al. |
2020 |

26 |
Clustering to Given Connectivities |
Golovach, Petr A. et al. |
2019 |

27 |
Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals |
Fomin, Fedor V. et al. |
2019 |

28 |
Cyclability in Graph Classes |
Crespelle, Christophe et al. |
2019 |

29 |
Going Far From Degeneracy |
Fomin, Fedor V. et al. |
2019 |

30 |
Modification to Planarity is Fixed Parameter Tractable |
Fomin, Fedor V. et al. |
2019 |

31 |
Parameterized k-Clustering: Tractability Island |
Fomin, Fedor V. et al. |
2019 |

32 |
Finding Connected Secluded Subgraphs |
Golovach, Petr A. et al. |
2018 |

33 |
On the Tractability of Optimization Problems on H-Graphs |
Fomin, Fedor V. et al. |
2018 |

34 |
Parameterized Aspects of Strong Subgraph Closure |
Golovach, Petr A. 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 |
Structured Connectivity Augmentation |
Fomin, Fedor V. et al. |
2017 |

39 |
A Linear Kernel for Finding Square Roots of Almost Planar Graphs |
Golovach, Petr A. et al. |
2016 |

40 |
Enumerating Minimal Connected Dominating Sets in Graphs of Bounded Chordality |
Golovach, Petr A. et al. |
2015 |

41 |
Parameterized Complexity of Secluded Connectivity Problems |
Fomin, Fedor V. et al. |
2015 |

42 |
Variants of Plane Diameter Completion |
Golovach, Petr A. et al. |
2015 |

43 |
Connecting Vertices by Independent Trees |
Basavaraju, Manu et al. |
2014 |

44 |
Editing to Eulerian Graphs |
Dabrowski, Konrad K. et al. |
2014 |

45 |
Parameterized Complexity of the Anchored k-Core Problem for Directed Graphs |
Chitnis, Rajesh et al. |
2013 |

46 |
Parameterized Complexity of Connected Even/Odd Subgraph Problems |
Fomin, Fedor V. et al. |
2012 |

47 |
Approximating Acyclicity Parameters of Sparse Hypergraphs |
Fomin, Fedor V. et al. |
2009 |