Author:
Krithika R.,Sahu Abhishek,Tale Prafullkumar
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference27 articles.
1. Abu-Khzam, F.N., Cai, S., Egan, J., Shaw, P., Wang. K.: Turbo-charging cominating set with an FPT subroutine: Further Improvements and Experimental Analysis. In: Proceedings of the 14th International Conference on Theory and Applications of Models of Computation pp. 59–70. Springer (2017)
2. Abu-Khzam, F.N., Egan, J., Fellows, M.R., Rosamond, F.A.: Shaw. P.: on the parameterized complexity of dynamic problems. Theor. Comput. Sci. 607(3), 426–434 (2015)
3. Bodlaender, H.L., Cygan, M., Kratsch, S., Nederlof, J.: Deterministic single exponential time algorithms for connectivity problems parameterized by treewidth. Inf. Comput. 243, 86–111 (2015)
4. Beigel, R.: Finding maximum independent sets in sparse and general graphs. In: Proceedings of the $$10th$$ 10 t h Annual ACM-SIAM Symposium on Discrete Algorithms SODA ’99, pp. 856–857. SIAM (1999)
5. Bonsma, P., Lokshtanov, D.: Feedback vertex set in mixed graphs. In: Proceedings of the 12th International Conference on Algorithms and Data Structures WADS ’11, pp. 122–133. Springer (2011)
Cited by
5 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献