research
∙
07/10/2023
Tight Algorithmic Applications of Clique-Width Generalizations
In this work, we study two natural generalizations of clique-width intro...
share
research
∙
07/04/2023
Heuristic Algorithms for the Approximation of Mutual Coherence
Mutual coherence is a measure of similarity between two opinions. Althou...
research
∙
07/03/2023
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Dynamic programming on various graph decompositions is one of the most f...
research
∙
12/23/2022
Tight Bounds for Connectivity Problems Parameterized by Cutwidth
In this work we start the investigation of tight complexity bounds for c...
research
∙
12/06/2021
Polychromatic Colorings of Unions of Geometric Hypergraphs
We consider the polychromatic coloring problems for unions of two or mor...
research
∙
10/24/2020
