Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference13 articles.
1. Fixed parameter tractability and completeness IV;Abrahamson;Ann. Pure Appl. Logic,1995
2. H.L. Bodlaender, B. de Fluiter, Intervalizing k-colored graphs, in: Proceedings of the 22th International Colloquium on Automata, Languages, and Programming (ICALP’95), Lecture Notes in Computer Science, Vol. 944, Springer, Berlin, 1995, 87–98.
3. H.L. Bodlaender, D. Kratsch, Private communication, 1994.
4. The parameterized complexity of short computation and factorization;Cai;Arch. Math. Logic,1997
5. Perfect Code is W[1]-complete;Cesati;Inform. Process. Lett.,2002
Cited by
46 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献