1. A. Aggarwal, A. Bar-Noy, D. Coppersmith, R. Ramaswami, B. Schieber, M. Sudan, “Efficient Routing and Scheduling Algorithms for Optical Networks”, in: SODA'94, (1994), 412–423.
2. N. Alon and V. D. Milman, “λ1, Isoperimetric Inequalities for Graphs, and Superconcentrators”, J. Combinatorial Theory, Series B, vol. 38, (1985), 73–88.
3. Y. Aumann and Y. Rabani, “Improved Bounds for All Optical Routing”, in: SODA'95, (1995), 567–576.
4. R. A. Barry and P. A. Humblet, “Bounds on the Number of Wavelengths Needed in WDM Networks”, in: LEOS '92 Summer Topical Mtg. Digest, (1992), 21–22.
5. R. A. Barry and P. A. Humblet, “On the Number of Wavelengths and Switches in All-Optical Networks”, to appear in: IEEE Trans, on Communications.