Publisher
Springer International Publishing
Reference21 articles.
1. Baker, B.S., Coffman, E.G.: Mutual exclusion scheduling. Theoret. Comput. Sci. 162(2), 225–243 (1996)
2. Bodlaender, H.L., Fomin, F.V.: Equitable colorings of bounded treewidth graphs. Theoret. Comput. Sci. 349(1), 22–30 (2005)
3. Bodlaender, H.L., Jansen, K.: Restrictions of graph partition problems. Part I. Theoret. Comput. Sci. 148(1), 93–109 (1995)
4. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)
5. Boral, A., Cygan, M., Kociumaka, T., Pilipczuk, M.: Fast branching algorithm for cluster vertex deletion. arXiv e-prints p. 1306.3877 (2013)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献