No. Title Author Year
1 Detours in Directed Graphs Fomin, Fedor V. et al. 2022
2 Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk) Fomin, Fedor V. et al. 2022
3 Longest Cycle Above Erdős-Gallai Bound Fomin, Fedor V. et al. 2022
4 Parameterized Algorithms for Upward Planarity Chaplick, Steven et al. 2022
5 The Fine-Grained Complexity of Graph Homomorphism Parameterized by Clique-Width Ganian, Robert et al. 2022
6 Weighted Model Counting with Twin-Width Ganian, Robert et al. 2022
7 On Coresets for Fair Clustering in Metric and Euclidean Spaces and Their Applications Bandyapadhyay, Sayan et al. 2021
8 Parameterized Complexity of Feature Selection for Categorical Data Clustering Bandyapadhyay, Sayan et al. 2021
9 Building Large k-Cores from Sparse Graphs Fomin, Fedor V. et al. 2020
10 Low-Rank Binary Matrix Approximation in Column-Sum Norm Fomin, Fedor V. et al. 2020
11 Parameterized Complexity of PCA (Invited Talk) Fomin, Fedor V. et al. 2020
12 Parameterized k-Clustering: Tractability Island Fomin, Fedor V. et al. 2019
Current Page :
Number of result pages: 1
Number of documents: 12


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