1. B.S. Baker, E.G. Coffmann Jr., Mutual exclusion scheduling. Theor. Comput. Sci. 162, 225–243 (1996)
2. E. Bampis, A. Kononov, G. Lucarelli, I. Milis, Bounded max-colorings of graphs, in Proceedings of the 21st International Symposium on Algorithms and Computation (Springer, 2010), pp. 353–365
3. H.L. Bodlaender, K. Jansen, Restrictions of graph partition problems. Part I. Theor. Comput. Sci. 148(1), 93–109 (1995)
4. N. Bourgeois, G. Lucarelli, I. Milis, V.Th. Paschos, Approximating the max-edge-coloring problem. Theor. Comput. Sci. 411(34–36), 3055–3067 (2010)
5. D.G. Corneil, S. Olariu, L. Stewart, The ultimate interval graph recognition algorithm? (extended abstract), in Proceedings of the 9th ACM-SIAM Symposium on Discrete Algorithms (SIAM, 1998), pp. 175–180