Publisher
Springer International Publishing
Reference30 articles.
1. Lecture Notes in Computer Science;Y Asahiro,2020
2. Blum, J.: Hierarchy of transportation network parameters and hardness results. In: International Symposium on Parameterized and Exact Computation (IPEC 2019), vol. 148, pp. 4:1–4:15 (2019)
3. Bodlaender, H.L., Drange, P.G., Dregi, M.S., Fomin, F.V., Lokshtanov, D., Pilipczuk, M.: A $$c^k n$$$$5$$-approximation algorithm for treewidth. SIAM J. Comput. 45(2), 317–378 (2016)
4. Bodlaender, H.L., Kloks, T., Tan, R.B., Van Leeuwen, J.: Approximations for $$\lambda $$-colorings of graphs. Comput. J. 47(2), 193–204 (2004)
5. Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, New york (2008)