1. P.K. Agarwal, M. van Kreveld, ans S. Suri, “Label placement by maximum independent set in rectangles”, Computational Geometry: Theory and applications, 11(3–4): 209–218 (1998).
2. T. Asano, “Difficulty of the maximum independent set problem on intersection graphs of geometric objects”, Proceedings of the Sixth Internat. Conf. on the Theory and Applications of Graphs, Western Michigan University 1988.
3. E. Asplund, B. Grunbaum, “On a coloring problem”, Math. Scand. 8 (1960), 181–188.
4. B. Awerbuch, Y. Azar, and S. Plotkin, “Throughput-competitive online routing”, Proceedings of the 34th Annual Symposium on Foundations of Computer Science, 1993, pp. 32–40.
5. V. Bafna, P. Berman, and T. Fujito, “A 2-approximation algorithm for the undirected feedback vertex set problem”, SIAM J. on Disc. Mathematics, Vol. 12, pp. 289–297, 1999.