Author:
Cygan Marek,Marx Dániel,Pilipczuk Marcin,Pilipczuk Michał
Funder
Seventh Framework Programme
ERC
OTKA
Polish National Science Centre
Subject
Computational Theory and Mathematics,Computer Science Applications,Information Systems,Theoretical Computer Science
Reference18 articles.
1. Lower bounds based on the exponential time hypothesis;Lokshtanov;Bull. Eur. Assoc. Theor. Comput. Sci.,2011
2. Easy problems for tree-decomposable graphs;Arnborg;J. Algorithms,1991
3. The monadic second-order logic of graphs I: recognizable sets of finite graphs;Courcelle;Inf. Comput.,1990
4. Known algorithms on graphs on bounded treewidth are probably optimal;Lokshtanov,2011
5. Slightly superexponential parameterized problems;Lokshtanov,2011
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献