Defines TEDSC with a poly-time algorithm plus FPT and hardness results for distance- and time-bounded variants on static networks.
ISBN 9781450374644
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
citation-role summary
background 1
citation-polarity summary
years
2026 2verdicts
CONDITIONAL 2roles
background 1polarities
background 1representative citing papers
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.
citing papers explorer
-
Temporal Routing in Static Networks: The Schedule Completion Problem
Defines TEDSC with a poly-time algorithm plus FPT and hardness results for distance- and time-bounded variants on static networks.
-
Improving SAT Solvers on Orthogonal Latin Square Problems
Augmenting SAT solvers with the Euler-Parker algorithm solves hard 10x10 orthogonal Latin square problems in a median of 5100 seconds instead of failing after seven days.