1. Awerbuch, B., Azar, Y., Fiat, A., Leonardi, S., Rosén, A.: On-line competitive algorithms for call admission in optical networks. Algorithmica 31(1), 29–43 (2001)
2. Awerbuch, B., Bartal, Y., Fiat, A., Rosén, A.: Competitive non-preemptive call control. In: Proceedings of the 5th Annual ACM–SIAM Symposium on Discrete Algorithms (SODA 1994), pp. 312–320 (1994)
3. Beauquier, B., Bermond, J.-C., Gargano, L., Hell, P., Perennes, S., Vaccaro, U.: Graph problems arising fromwavelength-routing in all-optical networks. In: Proceedings of IPPS 1997, Second Workshop on Optics and Computer Science, WOCS (1997)
4. Lecture Notes in Computer Science;C. Chekuri,2003
5. Cole, R., Ost, K., Schirra, S.: Edge-coloring bipartite multigraphs in O(E logD) time. Combinatorica 21(1), 5–12 (2001)