Author:
Demaine Erik D.,Fomin Fedor V.,Hajiaghayi Mohammad Taghi,Thilikos Dimitrios M.
Publisher
Springer Berlin Heidelberg
Reference26 articles.
1. Alber, J., Bodlaender, H.L., Fernau, H., Kloks, T., Niedermeier, R.: Fixed parameter algorithms for dominating set and related problems on planar graphs. Algorithmica 33, 461–493 (2002)
2. Lecture Notes in Computer Science;J. Alber,2001
3. Amir, E.: Efficient approximation for triangulation of minimum treewidth. In: Uncertainty in Artificial Intelligence: Proceedings of the Seventeenth Conference (UAI 2001), pp. 7–15. Morgan Kaufmann Publishers, San Francisco (2001)
4. Baker, B.S.: Approximation algorithms for NP-complete problems on planar graphs. J. Assoc. Comput. Mach. 41, 153–180 (1994)
5. Bodlaender, H.L.: A tourist guide through treewidth. Acta Cybernetica 11, 1–23 (1993)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献