Author:
Arora Pranav,Banik Aritra,Paliwal Vijay Kumar,Raman Venkatesh
Publisher
Springer International Publishing
Reference16 articles.
1. Aspvall, B., Plass, M.F., Tarjan, R.E.: A linear-time algorithm for testing the truth of certain quantified boolean formulas. Inf. Process. Lett. 8(3), 121–123 (1979)
2. Cai, L.: Parameterized complexity of vertex colouring. Discrete Appl. Math. 127(3), 415–429 (2003)
3. Chudnovsky, M.: Coloring graphs with forbidden induced subgraphs. Proc. ICM 4, 291–302 (2014)
4. Cygan, M., Fomin, F.V., Kowalik, Ł., Lokshtanov, D., Marx, D., Pilipczuk, M., Pilipczuk, M., Saurabh, S.: Parameterized Algorithms. Springer, Cham (2015).
https://doi.org/10.1007/978-3-319-21275-3
5. Lecture Notes in Computer Science;KK Dabrowski,2016
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献