1. and Efficient routing and scheduling algorithms for optical networks [Proc. 5th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 1994], ACM Press, pp. 412-423.
2. and Improved bounds for all optical routing [Proc. 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), Jan. 1995], ACM Press, pp. 567-576.
3. and Graph problems arising from wavelength-routing in all-optical networks [Proc. 2nd Workshop on Optics and Computer Science (WOCS), part of IPPS, Genève, April 1997].
4. Graphs and hypergraphs, North-Holland, Amsterdam, 1973.
5. Lecture Notes;Bermond,1996