Author:
Gajarský Jakub,Hliněný Petr,Obdržálek Jan,Ordyniak Sebastian,Reidl Felix,Rossmanith Peter,Sánchez Villaamil Fernando,Sikdar Somnath
Publisher
Springer Berlin Heidelberg
Reference28 articles.
1. IPEC 2011. LNCS, vol. 7112. Springer (2011)
2. Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for Dominating Set. J. ACM 51, 363–384 (2004)
3. Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. Journal of Computer and System Sciences 75(8), 423–434 (2009)
4. Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: Proc. of 50th FOCS, pp. 629–638. IEEE Computer Society (2009)
5. Bodlaender, H.L., Jansen, B.M.P., Kratsch, S.: Kernel bounds for path and cycle problems. In: IPEC 2011 [1], pp. 145–158
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献