Author:
Even Guy,Halldórsson Magnús M.,Kaplan Lotem,Ron Dana
Publisher
Springer Science and Business Media LLC
Subject
Artificial Intelligence,Management Science and Operations Research,General Engineering,Software
Reference28 articles.
1. Alon, N. (1983). A note on the decomposition of graphs into isomorphic matchings. Acta Mathematica Hungarica, 42, 221–223.
2. Baker, B. S., & Coffman, Jr., E. G. (1996). Mutual exclusion scheduling. Theoretical Computer Science, 162(2), 225–243.
3. Bar-Noy, A., Halldórsson, M. M., Kortsarz, G., Salman, R., & Shachnai, H. (2000). Sum multicoloring of graphs. Journal of Algorithms, 37, 422–450.
4. Bodlaender, H. L., & Jansen, K. (1993). On the complexity of scheduling incompatible jobs with unit-times. In MFCS’93: Proceedings of the 18th international symposium on mathematical foundations of computer science (pp. 291–300). London, UK, 1993. Berlin: Springer.
5. Bodlaender, H. L., & Jansen, K. (1995). Restrictions of graph partition problems. Part I. Theoretical Computer Science, 148, 93–109.
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献