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 Diverse Collections in Matroids and Graphs Fomin, Fedor V. et al. 2021
4 ETH Tight Algorithms for Geometric Intersection Graphs: Now in Polynomial Space Fomin, Fedor V. et al. 2021
5 Front Matter, Table of Contents, Preface, Conference Organization Golovach, Petr A. et al. 2021
6 LIPIcs, Volume 214, IPEC 2021, Complete Volume Golovach, Petr A. et al. 2021
7 Parameterized Complexity of Feature Selection for Categorical Data Clustering Bandyapadhyay, Sayan et al. 2021
8 Refined Notions of Parameterized Enumeration Kernels with Applications to Matching Cut Enumeration Golovach, Petr A. et al. 2021
9 An Algorithmic Meta-Theorem for Graph Modification to Planarity and FOL Fomin, Fedor V. et al. 2020
10 Diverse Pairs of Matchings Fomin, Fedor V. et al. 2020
11 Kernelization of Whitney Switches Fomin, Fedor V. et al. 2020
12 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
13 Parameterization Above a Multiplicative Guarantee Fomin, Fedor V. et al. 2020
14 Parameterized Complexity of Directed Spanner Problems Fomin, Fedor V. et al. 2020
15 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
16 Recognizing Proper Tree-Graphs Chaplick, Steven et al. 2020
17 Subexponential Parameterized Algorithms and Kernelization on Almost Chordal Graphs Fomin, Fedor V. et al. 2020
18 Clustering to Given Connectivities Golovach, Petr A. et al. 2019
19 Covering Vectors by Spaces in Perturbed Graphic Matroids and Their Duals Fomin, Fedor V. et al. 2019
20 Cyclability in Graph Classes Crespelle, Christophe et al. 2019
21 Going Far From Degeneracy Fomin, Fedor V. et al. 2019
22 Modification to Planarity is Fixed Parameter Tractable Fomin, Fedor V. et al. 2019
23 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
24 Finding Connected Secluded Subgraphs Golovach, Petr A. et al. 2018
25 On the Tractability of Optimization Problems on H-Graphs Fomin, Fedor V. et al. 2018
26 Parameterized Aspects of Strong Subgraph Closure Golovach, Petr A. 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 Structured Connectivity Augmentation Fomin, Fedor V. et al. 2017
Current Page :
Number of result pages: 2
Number of documents: 39


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