1 paper
Matthias Bentert, Leon Kellerhals, Rolf Niedermeier
We study the parameterized complexity of finding shortest s-t-paths with an additional fairness requirement. The task is to compute a shortest path in a vertex-colored graph where…