Author:
Fluschnik Till,Hatzel Meike,Härtlein Steffen,Molter Hendrik,Seidler Henning
Publisher
Springer International Publishing
Reference19 articles.
1. Alanko, S., Crevals, S., Isopoussu, A., Östergård, P.R.J., Pettersson, V.: Computing the domination number of grid graphs. Electron. J. Comb. 18(1), 18 p. (2011).
http://www.combinatorics.org/ojs/index.php/eljc/article/view/v18i1p141
2. Aoki, Y., Halldórsson, B.V., Halldórsson, M.M., Ito, T., Konrad, C., Zhou, X.: The minimum vulnerability problem on specific graph classes. J. Comb. Optim. 32(4), 1288–1304 (2016)
3. Assadi, S., Emamjomeh-Zadeh, E., Norouzi-Fard, A., Yazdanbod, S., Zarrabi-Zadeh, H.: The minimum vulnerability problem. Algorithmica 70(4), 718–731 (2014)
4. Lecture Notes in Computer Science;D Bhatia,1993
5. Bodlaender, H.L., Jansen, B.M., Kratsch, S.: Kernelization lower bounds by cross-composition. SIAM J. Discrete Math. 28(1), 277–305 (2014)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献