Author:
Bampis Evripidis,Kononov Alexander,Lucarelli Giorgio,Milis Ioannis
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Alon, N.: A note on the decomposition of graphs into isomorphic matchings. Acta Mathematica Hungarica 42, 221–223 (1983)
2. Baker, B.S., Coffman Jr., E.G.: Mutual exclusion scheduling. Theoretical Computer Science 162, 225–243 (1996)
3. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoretical Computer Science 148, 93–109 (1995)
4. Bongiovanni, G., Coppersmith, D., Wong, C.K.: An optimum time slot assignment algorithm for an SS/TDMA system with variable number of transponders. IEEE Trans. on Communications 29, 721–726 (1981)
5. Boudhar, M., Finke, G.: Scheduling on a batch machine with job compatibilities. Belgian Journal of Oper. Res., Statistics and Computer Science 40, 69–80 (2000)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献