Abstract
We show that some natural problems that are XNLP-hard (hence $$\textrm{W}[t]$$ -hard for all t) when parameterized by pathwidth or treewidth, become FPT when parameterized by stable gonality, a novel graph parameter based on optimal maps from graphs to trees. The problems we consider are classical flow and orientation problems,
... read more