Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
6 Markus Brill and Felix Fischer
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2verdicts
UNVERDICTED 2representative citing papers
Parameterized complexity analysis of Possible President and Necessary President problems for Schulze voting yields dichotomies with respect to the number of voters.
citing papers explorer
-
Maximizing Reachability via Shifting of Temporal Paths
Maximizing reachability in k-path temporal graphs via budgeted shifts is FPT when parameterized by k and b together or by k alone, but intractable in most other parameterizations with matching XP algorithms.
-
Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
Parameterized complexity analysis of Possible President and Necessary President problems for Schulze voting yields dichotomies with respect to the number of voters.