The following publications are possibly variants of this publication:
- An ::::O (n log n):::: algorithm for maximum ::::st::::-flow in a directed planar graphGlencora Borradaile, Philip N. Klein. soda 2006: 524-533 [doi]
- Shortest paths in directed planar graphs with negative lengths: a linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithmPhilip N. Klein, Shay Mozes, Oren Weimann. soda 2009: 236-245 [doi]
- Shortest paths in directed planar graphs with negative lengths: A linear-space ::::O::::(::::n:::: log:::2::: ::::n::::)-time algorithmPhilip N. Klein, Shay Mozes, Oren Weimann. TALG, 6(2), 2010. [doi]
- Multiple-Source Single-Sink Maximum Flow in Directed Planar Graphs in O(diameter ยท n log n) TimePhilip N. Klein, Shay Mozes. wads 2011: 571-582 [doi]
- An ::::O::::(::::n:::: log ::::n::::) approximation scheme for Steiner tree in planar graphsGlencora Borradaile, Philip N. Klein, Claire Mathieu. TALG, 5(3), 2009. [doi]
- Steiner Tree in Planar Graphs: An ::::O:::: ( ::::n:::: log ::::n:::: ) Approximation Scheme with Singly-Exponential Dependence on EpsilonGlencora Borradaile, Philip N. Klein, Claire Mathieu. wads 2007: 275-286 [doi]