Publisher
Springer International Publishing
Reference27 articles.
1. Lecture Notes in Computer Science;M Belbasi,2019
2. Bergougnoux, B., Kanté, M.M.: Fast exact algorithms for some connectivity problems parameterized by clique-width. Theor. Comput. Sci. 782, 30–53 (2019)
3. Bergougnoux, B., Kanté, M.M.: More applications of the $$d$$-neighbor equivalence: connectivity and acyclicity constraints. In: 27th Annual European Symposium on Algorithms, ESA 2019. LIPIcs, vol. 144 , pp. 17:1–17:14. Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)
4. 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)
5. Cygan, M.: Parameterized Algorithms. Springer, Cham (2015). https://doi.org/10.1007/978-3-319-21275-3
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献