2 papers
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…
math.CO2024
Matroid-reachability-based decomposition into arborescences
Florian Hörsch, Benjamin Peyrille, Zoltán Szigeti
The problem of matroid-reachability-based packing of arborescences was solved by Király. Here we solve the corresponding decomposition problem that turns out to be more complicate…