Kirill Simonov

J. Comput. Syst. Sci., 2024

Subexponential Algorithms for Clique Cover on Unit Disk and Unit Ball Graphs.

[BibT_eX]

[DOI]

Tomohiro Koana

Nidhi Purohit

CoRR, 2024

Combining Crown Structures for Vulnerability Measures.

[BibT_eX]

[DOI]

Katrin Casel

Tobias Friedrich

Aikaterini Niklanovits

Ziena Zeif

CoRR, 2024

Hamiltonicity, Path Cover, and Independence Number: An FPT Perspective.

[BibT_eX]

[DOI]

CoRR, 2024

Tree Containment Above Minimum Degree is FPT.

[BibT_eX]

[DOI]

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

A Contraction Tree SAT Encoding for Computing Twin-Width.

[BibT_eX]

[DOI]

Aikaterini Niklanovits

Proceedings of the Advances in Knowledge Discovery and Data Mining, 2024

2023

Detours in directed graphs.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., November, 2023

How to find a good explanation for clustering?

[BibT_eX]

[DOI]

Artif. Intell., September, 2023

Lossy Kernelization of Same-Size Clustering.

[BibT_eX]

[DOI]

Theory Comput. Syst., August, 2023

Parameterized Complexity of Feature Selection for Categorical Data Clustering.

[BibT_eX]

[DOI]

ACM Trans. Comput. Theory, 2023

Building large k-cores from sparse graphs.

[BibT_eX]

[DOI]

Danil Sagunov

J. Comput. Syst. Sci., 2023

Turán's Theorem Through Algorithmic Lens.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Proportionally Fair Matching with Multiple Groups.

[BibT_eX]

[DOI]

Proceedings of the Graph-Theoretic Concepts in Computer Science, 2023

Socially Fair Matching: Exact and Approximation Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Data Structures - 18th International Symposium, 2023

Consistency Checking Problems: A Gateway to Parameterized Sample Complexity.

[BibT_eX]

[DOI]

Robert Ganian

Liana Khazaliya

Proceedings of the 18th International Symposium on Parameterized and Exact Computation, 2023

The st-Planar Edge Completion Problem Is Fixed-Parameter Tractable.

[BibT_eX]

[DOI]

Liana Khazaliya

Philipp Kindermann

Giuseppe Liotta

Fabrizio Montecchiani

Proceedings of the 34th International Symposium on Algorithms and Computation, 2023

Upward and Orthogonal Planarity are W[1]-Hard Parameterized by Treewidth.

[BibT_eX]

[DOI]

Fabrizio Montecchiani

Proceedings of the Graph Drawing and Network Visualization - 31st International Symposium, 2023

Beyond Following: Augmenting Bot Detection with the Integration of Behavioral Patterns.

[BibT_eX]

[DOI]

Proceedings of the Complex Networks & Their Applications XII, 2023

A Parameterized Theory of PAC Learning.

[BibT_eX]

[DOI]

Cornelius Brand

Robert Ganian

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

The Parameterized Complexity of Network Microaggregation.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022

Weighted Model Counting with Twin-Width: Experimental Results.

[BibT_eX]

[DOI]

Dataset, June, 2022

Algorithmic Extensions of Dirac's Theorem.

[BibT_eX]

[DOI]

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

Weighted Model Counting with Twin-Width.

[BibT_eX]

[DOI]

Proceedings of the 25th International Conference on Theory and Applications of Satisfiability Testing, 2022

Long Cycles in Graphs: Extremal Combinatorics Meets Parameterized Algorithms (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 47th International Symposium on Mathematical Foundations of Computer Science, 2022

FPT Approximation for Fair Minimum-Load Clustering.

[BibT_eX]

[DOI]

Proceedings of the 17th International Symposium on Parameterized and Exact Computation, 2022

Fine-grained Complexity of Partial Minimum Satisfiability.

[BibT_eX]

[DOI]

Ivan Bliznets

Danil Sagunov

Chrysanthi N. Raftopoulou

Proceedings of the Thirty-First International Joint Conference on Artificial Intelligence, 2022

The Complexity of k-Means Clustering when Little is Known.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Machine Learning, 2022

Testing Upward Planarity of Partial 2-Trees.

[BibT_eX]

[DOI]

Chrysanthi N. Raftopoulou

Proceedings of the Graph Drawing and Network Visualization - 30th International Symposium, 2022

Longest Cycle Above Erdős-Gallai Bound.

[BibT_eX]

[DOI]

Proceedings of the 30th Annual European Symposium on Algorithms, 2022

Parameterized Algorithms for Upward Planarity.

[BibT_eX]

[DOI]

Proceedings of the 38th International Symposium on Computational Geometry, 2022

2021

Parameterized k-Clustering: Tractability island.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2021

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

Proceedings of the 2021 ACM-SIAM Symposium on Discrete Algorithms, 2021

Fixed-Parameter and Approximation Algorithms for PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 38th International Conference on Machine Learning, 2021

2020

EPTAS for k-means Clustering of Affine Subspaces.

[BibT_eX]

[DOI]

CoRR, 2020

Parameterized Complexity of PCA (Invited Talk).

[BibT_eX]

[DOI]

Proceedings of the 17th Scandinavian Symposium and Workshops on Algorithm Theory, 2020

Building Large k-Cores from Sparse Graphs.

[BibT_eX]

[DOI]

Danil Sagunov

Proceedings of the 45th International Symposium on Mathematical Foundations of Computer Science, 2020

Low-Rank Binary Matrix Approximation in Column-Sum Norm.

[BibT_eX]

[DOI]

Proceedings of the Approximation, 2020

Manipulating Districts to Win Elections: Fine-Grained Complexity.

[BibT_eX]

[DOI]

Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019

Parameterized k-Clustering: The distance matters!

[BibT_eX]

[DOI]

CoRR, 2019

Refined Complexity of PCA with Outliers.

[BibT_eX]

[DOI]

Proceedings of the 36th International Conference on Machine Learning, 2019

Parameterized k-Clustering: Tractability Island.

[BibT_eX]

[DOI]