1. Efficient routing and scheduling algorithms for optical networks;Aggarwal;J. ACM,1996
2. Eigenvalues and expanders;Alon;Combinatorica,1986
3. V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, Bandwidth allocation algorithms on tree-shaped all-optical networks with wavelength converters, Proc. 4th Internat. Colloq. on Structural Information and Communication Complexity (SIROCCO ’97), July 1997, pp. 13–27.
4. V. Auletta, I. Caragiannis, C. Kaklamanis, P. Persiano, On the complexity of wavelength converters, Proc. 23rd Internat. Symp. on Mathematical Foundations of Computer Science (MFCS ’98), Lecture Notes in Computer Science, vol. 1450, Springer, Berlin, August 1998, pp. 771–779.
5. Y. Aumann, Y. Rabani, Improved bounds for all optical routing, Proc. 6th Ann. ACM-SIAM Symp. on Discrete Algorithms (SODA ’95), January 1995, pp. 567–576.