Author:
Chen Jianer,Huang Xiuzhen,Kanj Iyad A.,Xia Ge
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference26 articles.
1. Fixed-parameter tractability and completeness IV: On completeness for W[P] and PSPACE analogs;Abrahamson;Ann. Pure Appl. Logic,1995
2. Fixed parameter algorithms for dominating set and related problems on planar graphs;Alber;Algorithmica,2002
3. Complexity and Approximation – Combinatorial Optimization Problems and Their Approximability Properties;Ausiello,1999
4. R. Beigel, Finding maximum independent sets in sparse and general graphs, in: Proc. 10th Annual ACM–SIAM Symp. on Discrete Algorithms, SODA '99, 1999 pp. 856-857
5. Solving large FPT problems on coarse grained parallel machines;Cheetham;J. Comput. System Sci.,2003
Cited by
152 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献