21 citations · 30 across the 7 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2024
A simple quadratic kernel for Token Jumping on surfaces
Daniel W. Cranston, Moritz Mühlenthaler, Benjamin Peyrille
The problem \textsc{Token Jumping} asks whether, given a graph and two independent sets of \emph{tokens} and of , we can transform into by changing the posit…
cs.DS2021
Voting algorithms for unique games on complete graphs
Antoine Méot, Arnaud de Mesmay, Moritz Mühlenthaler +1
An approximation algorithm for a constraint satisfaction problem is called robust if it outputs an assignment satisfying a -fraction of the constraints on any -s…