Publisher
Springer International Publishing
Reference12 articles.
1. Lecture Notes in Computer Science;EM Arkin,2015
2. Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015).
https://doi.org/10.1007/978-3-319-21275-3
3. Cygan, M., Pilipczuk, M., Pilipczuk, M., Wojtaszczyk, J.O.: An improved FPT algorithm and a quadratic kernel for pathwidth one vertex deletion. Algorithmica 64(1), 170–188 (2012)
4. Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 4th edn. Springer, New York (2012)
5. Ganian, R., Klute, F., Ordyniak, S.: On structural parameterizations of the bounded-degree vertex deletion problem. In: 35th Symposium on Theoretical Aspects of Computer Science, STACS, pp. 33:1–33:14 (2018)
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Fair Division Is Hard Even for Amicable Agents;SOFSEM 2021: Theory and Practice of Computer Science;2021