1 citations · 1 across the 1 of their papers we have counts for
3 papers
cs.DS2023★ 1 cited
Tight Algorithms for Connectivity Problems Parameterized by Modular-Treewidth
Falko Hegerfeld, Stefan Kratsch
We study connectivity problems from a fine-grained parameterized perspective. Cygan et al. (TALG 2022) obtained algorithms with single-exponential running time fo…
cs.DS2023
Tight algorithms for connectivity problems parameterized by clique-width
Falko Hegerfeld, Stefan Kratsch
The complexity of problems involving global constraints is usually much more difficult to understand than the complexity of problems only involving local constraints. A natural for…
cs.DS2019
On adaptive algorithms for maximum matching
Falko Hegerfeld, Stefan Kratsch
In the fundamental Maximum Matching problem the task is to find a maximum cardinality set of pairwise disjoint edges in a given undirected graph. The fastest algorithm for this pro…