Author:
Bodlaender Hans,Brandstädt Andreas,Kratsch Dieter,Rao Michaël,Spinrad Jeremy
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms 12, 308–340 (1991)
2. Bodlaender, H.: Achromatic number is NP-complete for cographs and interval graphs. Inform. Process. Lett. 31, 135–138 (1989)
3. Lecture Notes in Computer Science;H.L. Bodlaender,2002
4. Bodlaender, H.L., Jansen, K.: On the complexity of the maximum cut problem. Nord. J. Comput. 7, 14–31 (2000)
5. Lecture Notes in Computer Science;H.L. Bodlaender,2002
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献