1. On a routing problem;Bellman;Quart. Appl. Math.,1958
2. Two-Levels-Greedy: a generalization of Dijkstraʼs shortest path algorithm;Cantone;Electron. Notes Discrete Math.,2004
3. A faster algorithm for the single source shortest path problem in the presence of few sources or destinations of negative arcs;Cantone,2008
4. All-pairs shortest paths with real weights in O(n3/logn) time;Chan,2005
5. More algorithms for all-pairs shortest paths in weighted graphs;Chan,2007