S. Saunders

Solving Shortest Paths Eciently on Nearly

T. Takaoka, S. Saunders, 2006 .

A Comparison of Data Structures for Dijkstra's Single Source Shortest Path Algorithm

Shane Saunders, S. Saunders, 1999 .

Solving shortest paths efficiently on nearly acyclic directed graphs

Tadao Takaoka, Shane Saunders, T. Takaoka, 2007, Theor. Comput. Sci..

Improved shortest path algorithms for nearly acyclic graphs

Tadao Takaoka, Shane Saunders, T. Takaoka, 2003, Theor. Comput. Sci..