1. Aggarwal, A., Bar-Noy, A., Coppersmith, D., Ramaswami, R., Schieber, B., Sudan, M.: Efficient Routing and Scheduling Algorithms for Optical Networks. Journal of the ACM 43(6), 973–1001 (1996)
2. Auletta, V., Caragiannis, I., Kaklamanis, C., Persiano, P.: Randomized Path Coloring on Binary Trees. Theoretical Computer Science 289(1), 355–399 (2002)
3. Aumann, Y., Rabani, Y.: Improved Bounds for All Optical Routing. In: Proc. of the 6th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 1995), pp. 567–576 (1995)
4. Bartal, Y., Leonardi, S.: On-Line Routing in All-Optical Networks. Theoretical Computer Science 221(1-2), 19–39 (1999)
5. Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph Problems Arising from Wavelength-Routing in All-Optical Networks. In: 2nd Workshop on Optics and Computer Science (WOCS 1997) (1997)