Subject
General Computer Science,Theoretical Computer Science
Reference45 articles.
1. “Fixed Parameter Tractability and Completeness IV: On Completeness for W[P] and PSPACE Analogs,”;Abrahamson;Annals of Pure and Applied Logic,1995
2. J. Alber, H. Fernau and R. Niedermeier, “Parameterized Complexity: Exponential Speed-Up for Planar Graph Problems,” in: Proceedings of ICALP 2001, Crete, Greece, Lecture Notes in Computer Science vol. 2076 (2001), 261–272.
3. “Faster Exact Algorithms for Hard Problems: A Parameterized Point of View,”;Alber;Discrete Mathematics,2001
4. S. Arora, “Polynomial Time Approximation Schemes for Euclidean TSP and Other Geometric Problems,” In: Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, 1996.
5. V. Arvind, “On the Parameterized Complexity of Counting Problems,” Workshop on Parameterized Complexity, Madras, India, Dec. 2000.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献