2 citations · 5 across the 8 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
From Data Completion to Problems on Hypercubes: A Parameterized Analysis of the Independent Set Problem
Eduard Eiben, Robert Ganian, Iyad Kanj +2
Several works have recently investigated the parameterized complexity of data completion problems, motivated by their applications in machine learning, and clustering in particular…
cs.DS2022★ 1 cited
On the parameterized complexity of symmetric directed multicut
Eduard Eiben, Clément Rambaud, Magnus Wahlström
We study the problem Symmetric Directed Multicut from a parameterized complexity perspective. In this problem, the input is a digraph , a set of cut requests $C=\{(s_1,t_1),\ldo…