Author:
Abu-Khzam Faisal N.,Fernau Henning,Langston Michael A.
Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference14 articles.
1. A direct algorithm for the parameterized face cover problem;Abu-Khzam,2004
2. Deeply asymmetric planar graphs;Aksionov;J. Combin. Theory Ser. B,2005
3. A refined search tree techniques for dominating set on planar graphs;Alber;J. Comput. System Sci.,2005
4. On the complexity of covering vertices by faces in a planar graph;Bienstock;SIAM J. Sci. Comput.,1988
5. Refined memorization for vertex cover;Sunil Chandran;Inform. Process. Lett.,2005
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献