Author:
Derbisz Jan,Kanesh Lawqueen,Madathil Jayakrishnan,Sahu Abhishek,Saurabh Saket,Verma Shaily
Funder
Infosys Foundation
H2020 European Research Council
Department of Science and Technology, Ministry of Science and Technology
Defence Service Organisation Singapore
NRF Fellowshhip for AI Grant
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference34 articles.
1. Agrawal, A., Lokshtanov, D., Misra, P., Saurabh, S., Zehavi, M.: Feedback vertex set inspired kernel for chordal vertex deletion. In: Proceedings of the 28th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1383–1398 (2017)
2. Agrawal, A., Misra, P., Saurabh, S., Zehavi, M.: Interval vertex deletion admits a polynomial kernel. In: Chan, T.M. (ed.) Proceedings of the 30th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 1711–1730 (2019)
3. Bodlaender, Hans L., Downey, Rodney G., Fellows, Michael R., Hermelin, Danny: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423–434 (2009)
4. Bozyk, L., Derbisz, J., Krawczyk, T., Novotná, J., Okrasa, K.: Vertex deletion into bipartite permutation graphs. In: Cao, Y., Marcin, P. (eds.) 15th International Symposium on Parameterized and Exact Computation (IPEC), vol. 180 LIPIcs, pp. 1–16 (2020)
5. Brandstädt, A., Van Bang, L., Spinrad, J.P.: Graph Classes: A Survey. SIAM, Philadelphia (1999)