M. Ahmed and A. Lubiw, Shortest paths avoiding forbidden subpaths, STACS '09: Proceedings of 26th International Symposium on Theoretical Aspects of Computer Science Schloss Dagstuhl -Leibniz-Zentrum fuer Informatik, pp.63-74, 2009.
DOI : 10.1002/net.21490
URL : https://hal.archives-ouvertes.fr/inria-00359710

S. Baswana and T. Kavitha, Faster Algorithms for Approximate Distance Oracles and All-Pairs Small Stretch Paths, 2006 47th Annual IEEE Symposium on Foundations of Computer Science (FOCS'06), pp.591-602, 2006.
DOI : 10.1109/FOCS.2006.29

M. A. Bender and M. Farach-colton, The LCA Problem Revisited, LATIN '00: Proceedings of the 4th Latin American Symposium on Theoretical Informatics, pp.88-94, 2000.
DOI : 10.1007/10719839_9

A. Bernstein and D. Karger, A nearly optimal oracle for avoiding failed vertices and edges, Proceedings of the 41st annual ACM symposium on Symposium on theory of computing, STOC '09, pp.101-110, 2009.
DOI : 10.1145/1536414.1536431

S. Chechik, M. Langberg, D. Peleg, and L. Roditty, Fault-tolerant spanners for general graphs, STOC '09: Proceedings of the 41st annual ACM symposium on Theory of computing, pp.435-444, 2009.

C. Demetrescu and G. F. Italiano, A new approach to dynamic all pairs shortest paths, Journal of the ACM, vol.51, issue.6, pp.968-992, 2004.
DOI : 10.1145/1039488.1039492

C. Demetrescu, M. Thorup, R. A. Chowdhury, and V. Ramachandran, Oracles for Distances Avoiding a Failed Node or Link, SIAM Journal on Computing, vol.37, issue.5, pp.1299-1318, 2008.
DOI : 10.1137/S0097539705429847

R. Duan and S. Pettie, Dual-Failure Distance and Connectivity Oracles, SODA '09: Proceedings of the Nineteenth Annual ACM -SIAM Symposium on Discrete Algorithms, pp.506-515, 2009.
DOI : 10.1137/1.9781611973068.56

J. Hershberger and S. Suri, Vickrey prices and shortest paths: what is an edge worth?, Proceedings 2001 IEEE International Conference on Cluster Computing, p.252, 2001.
DOI : 10.1109/SFCS.2001.959899

N. Khanna and S. Baswana, Approximate shortest paths avoiding a failed vertex : optimal data structures for unweighted graphs

E. Nardelli, G. Proietti, and P. Widmayer, Finding the most vital node of a shortest path, Theoretical Computer Science, vol.296, issue.1, pp.167-177, 2003.
DOI : 10.1016/S0304-3975(02)00438-3

L. Roditty, Shortest Simple Paths Problem in Weighted Directed Graphs, SODA '07: Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms, pp.920-928, 2007.
DOI : 10.1137/080730950

M. Thorup and U. Zwick, Approximate distance oracles, Journal of the ACM, vol.52, issue.1, pp.1-24, 2005.
DOI : 10.1145/1044731.1044732
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.295.4480