1. Adamy, U., Erlebach, T.: Online coloring of intervals with bandwidth. In: Solis-Oba, R., Jansen, K. (eds.) Approximation and Online Algorithms, pp. 1–12. Springer, Berlin (2004)
2. Anagnostopoulos, A., Grandoni, F., Leonardi, S., Wiese, A.: A mazing 2+eps approximation for unsplittable flow on a path. CoRR arXiv:1211.2670 (2012)
3. Arkin, E.M., Silverberg, E.B.: Scheduling jobs with fixed start and end times. Discrete Appl. Math. 18(1), 1–8 (1987)
4. Asplund, E., Grünbaum, B.: On a coloring problem. Math. Scand. 8, 181–188 (1960)
5. Aumann, Y., Rabani, Y.: Improved bounds for all optical routing. In: Proceedings of the Sixth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA ’95, pp. 567–576. Society for Industrial and Applied Mathematics, Philadelphia, PA, USA (1995)