Faster Deterministic Worst-Case Fully Dynamic All-Pairs Shortest Paths via Decremental Hop-Restricted Shortest Paths.

Shiri Chechik, Tianyi Zhang

Browse the full SODA paper archive.