Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications
Reference27 articles.
1. Agrawal A, Saurabh S, Sharma R, Zehavi M (2018a) Kernels for deletion to classes of acyclic digraphs. J Comput Syst Sci 92:9–21
2. Agrawal A, Saurabh S, Sharma R, Zehavi M (2018b) Parameterised algorithms for deletion to classes of DAGs. Theory Comput Syst 1–30
3. Aoike Y, Gima T, Hanaka T, Kiyomi M, Kobayashi Y, Kobayashi Y, Kurita K, Otachi Y (2020) An improved deterministic parameterized algorithm for cactus vertex deletion. arXiv preprint arXiv:2012.04910
4. Betzler N, Bredereck R, Niedermeier R, Uhlmann J (2012) On bounded-degree vertex deletion parameterized by treewidth. Discret Appl Math 160(1–2):53–60
5. Bonnet É, Brettell N, Kwon O-j, Marx D (2016) Parameterized vertex deletion problems for hereditary graph classes with a block property. In: Proceedings of 42nd workshop on graph-theoretic concepts in computer science (WG), pp 233–244