1. , , A scaling technique for better network design, Proc 5th Annual ACM-SIAM Symposium on Discrete Algorithms, 1994, pp. 233-23340.
2. When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
3. , , , Network flows: Theory, algorithms, and applications, Prentice-Hall, Englewood Cliffs, NJ, 1993.
4. , , , Capacity and survivability models for telecommunication networks, Technical Report SC 97-24 ( 1997), ZIP, Berlin, Germany.
5. , Le problème du sous-graphe Steiner 2-arête connexe: Approche polyédrale, Ph.D. Dissertation, Université de Rennes 1, Rennes, France, 1996.