pith. sign in

Boccaletti , author G

3 Pith papers cite this work. Polarity classification is still indexing.

3 Pith papers citing it

years

2026 3

verdicts

UNVERDICTED 3

clear filters

representative citing papers

Maximizing Reachability via Shifting of Temporal Paths

cs.DS · 2026-05-12 · unverdicted · novelty 6.0

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.

citing papers explorer

Showing 1 of 1 citing paper after filters.

  • Maximizing Reachability via Shifting of Temporal Paths cs.DS · 2026-05-12 · unverdicted · none · ref 122

    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.