Near-Optimal (1+ε)-Approximate Fully-Dynamic All-Pairs Shortest Paths in Planar Graphs.

Arnold Filtser, Gramoz Goranci, Neel Patel, Maximilian Probst Gutenberg

Browse the full FOCS paper archive.