1. Agrawal, A., Kolay, S., Lokshtanov, D., Saket S.A.: Faster FPT algorithm and a smaller kernel for block graph vertex deletion, LATIN: Theoretical Informatics, Lecture Notes in Comput. Sci., vol. 9644. pp. 1–13. Springer, Berlin (2016)
2. Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Polylogarithmic approximation algorithms for weighted-$$\cal{F}$$-deletion problems, Approximation, randomization, and combinatorial optimization. Algorithms and techniques, LIPIcs. Leibniz Int. Proc. Inform., vol. 116, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, pp. 1–15 (2018)
3. Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Feedback vertex set inspired kernel for chordal vertex deletion. ACM Trans. Algorithms 15(1), 28 (2019)
4. Agrawal, A., Misra, P., Saurabh, S., Zehavi, M.: Interval vertex deletion admits a polynomial kernel, Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms, SIAM, Philadelphia, PA, pp. 1711–1730 (2019)
5. Ahn, J., Eiben, E., Kwon, O., Oum, S.: A polynomial kernel for $$3$$-leaf power deletion. In 45th International Symposium on Mathematical Foundations of Computer Science, LIPIcs. Leibniz Int. Proc. Inform., vol. 170, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, pp. 5:1–5:14 (2020)