1. A note on two problems in connection with graphs;Dijkstra;Numerische Mathematik,1959
2. M. Futtersack and P. Perny. BCA*, une généralisation d'A* pour la recherche de solutions de compromis dans des problèmes de recherche multiobjectifs. In Actes de la conférence RFIA'2000, vol. 3, pages 377–386, 2000
3. L. Galand and P. Perny. Search for compromise solutions in multiobjective state space graphs. In In 17th European Conference on Artificial Intelligence, pages 93–97, 2006
4. Computing the shortest path: A* meets graph theory;Goldberg,2005
5. G. Sauvanet and E. Néron. Improvements of labeling methods on bi-objective shortest path problem: application to security/distance trade-off. submitted to European Journal of Operational Research, 2009