3 citations · 8 across the 25 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2025
Improved exploration of temporal graphs
Paul Bastide, Carla Groenland, Lukas Michel +2
A temporal graph is a sequence of graphs on the same vertex set of size . The \emph{temporal exploration problem} asks for the length of the shortest seque…
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…
cs.DS2021
Preference Swaps for the Stable Matching Problem
Eduard Eiben, Gregory Gutin, Philip R. Neary +3
An instance of the Stable Matching Problem (SMP) is given by a bipartite graph with a preference list of neighbors for every vertex. A swap in is the exchange of two consec…