A Near-Optimal Offline Algorithm for Dynamic All-Pairs Shortest Paths in Planar Digraphs.

Debarati Das, Maximilian Probst Gutenberg, Christian Wulff-Nilsen

Browse the full SODA paper archive.