We show that some natural problems that are XNLP-hard (which implies
W[t...
In this paper, we consider the parameterized complexity of the following...
Given a vertex-colored graph, we say a path is a rainbow vertex path if ...
Divisorial gonality and stable divisorial gonality are graph parameters,...
Stable gonality is a multigraph parameter that measures the complexity o...