pith. machine review for the scientific record. sign in

Title resolution pending

Avin, Chen, Kouck · DOI 10.1007/978-3-540-70575-8_11

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
open at publisher browse 1 citing papers

Title metadata for this work has not finished resolving. The hub is built from the citation graph; the title resolver retries DOI and OpenAlex on its next pass.

fields

cs.DS 1

years

2026 1

verdicts

UNVERDICTED 1

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.

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

    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.