research
∙
08/29/2023
FPT Approximation and Subexponential Algorithms for Covering Few or Many Edges
We study the α-Fixed Cardinality Graph Partitioning (α-FCGP) problem, th...
share
research
∙
05/03/2023
Approximating Long Cycle Above Dirac's Guarantee
Parameterization above (or below) a guarantee is a successful concept in...
research
∙
11/09/2022
Shortest Cycles With Monotone Submodular Costs
We introduce the following submodular generalization of the Shortest Cyc...
research
∙
07/20/2022
Computing Tree Decompositions with Small Independence Number
The independence number of a tree decomposition is the maximum of the in...
research
∙
11/06/2020
Algorithmic Extensions of Dirac's Theorem
In 1952, Dirac proved the following theorem about long cycles in graphs ...
research
∙
10/19/2020
EPTAS for k-means Clustering of Affine Subspaces
We consider a generalization of the fundamental k-means clustering for d...
research
∙
06/24/2020
