Author:
Fellows Michael R.,Gaspers Serge,Rosamond Frances
Reference82 articles.
1. K. Abrahamson, J. Ellis, M. Fellows and M. Mata (1989). On the complexity of fixed-parameter problems. FOCS 1989, 210–215.
2. S. Arnborg, A. Proskurowski, D. Seese (1990). Monadic Second Order Logic, Tree Automata and Forbidden Minors. CSL 1990,1–16.
3. C. Bessiere, E. Hebrard, B. Hnich, Z. Kiziltan, C.-G. Quimper, and T. Walsh (2008). The parameterized complexity of global constraints. AAAI 2008, 235–240.
4. N. Betzler, M. R. Fellows, J. Guo, R. Niedermeier, and F. A. Rosamond (2009). Fixed-parameter algorithms for Kemeny rankings. Theoretical Computer Science 410(45), 4554–4570.
5. H. L. Bodlaender (1988). Dynamic programming on graphs with bounded treewidth. ICALP 1988, 105–118.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献