Work

Shortest paths in directed planar graphs with negative lengths: a linear-space O(n log2n)-time algorithm