Funder
Science and Engineering Research Board
Indo-French Centre for Applied Mathematics
Publisher
Springer Science and Business Media LLC
Subject
Applied Mathematics,Computer Science Applications,General Computer Science
Reference21 articles.
1. Antony, D., Garchar, J., Pal, S., Sandeep, R.B., Sen, S., Subashini, R.: On subgraph complementation to H-free graphs. In: Kowalik, L., Pilipczuk, M., Rzazewski, P. (eds.), Graph-Theoretic Concepts in Computer Science—47th International Workshop, WG 2021, Warsaw, Poland, June 23–25, 2021, Revised Selected Papers. Lecture Notes in Computer Science, vol. 12911, pp. 118–129. Springer, (2021). https://doi.org/10.1007/978-3-030-86838-3_9
2. Aravind, N.R., Sandeep, R.B., Sivadasan, N.: Dichotomy results on the hardness of H-free edge modification problems. SIAM J. Discrete Math. 31(1), 542–561 (2017). https://doi.org/10.1137/16M1055797
3. Cai, L., Cai, Y.: Incompressibility of H-free edge modification problems. Algorithmica 71(3), 731–757 (2015). https://doi.org/10.1007/s00453-014-9937-x
4. Cai, Y.: Polynomial kernelisation of H-free edge modification problems. M.Phil. Thesis, Department of Computer Science and Engineering, The Chinese University of Hong Kong, Hong Kong SAR, China (2012)
5. Guo, J.: A more effective linear kernelization for cluster editing. Theor. Comput. Sci. 410(8–10), 718–726 (2009). https://doi.org/10.1016/j.tcs.2008.10.021
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献