1 citations · 1 across the 5 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.DS2023
Tight Algorithmic Applications of Clique-Width Generalizations
Vera Chekan, Stefan Kratsch
In this work, we study two natural generalizations of clique-width introduced by Martin Fürer. Multi-clique-width (mcw) allows every vertex to hold multiple labels [ITCS 2017], whi…
cs.AI2023★ 1 cited
Heuristic Algorithms for the Approximation of Mutual Coherence
Gregor Betz, Vera Chekan, Tamara Mchedlidze
Mutual coherence is a measure of similarity between two opinions. Although the notion comes from philosophy, it is essential for a wide range of technologies, e.g., the Wahl-O-Mat…
cs.DS2023
Space-Efficient Parameterized Algorithms on Graphs of Low Shrubdepth
Benjamin Bergougnoux, Vera Chekan, Robert Ganian +5
Dynamic programming on various graph decompositions is one of the most fundamental techniques used in parameterized complexity. Unfortunately, even if we consider concepts as simpl…