Fernau, Henning; Fomin, Fedor V.; Philip, Geevarghese; Saurabh, Saket On the parameterized complexity of vertex cover and edge cover with connectivity constraints. (English) Zbl 1315.68150 Theor. Comput. Sci. 565, 1-15 (2015). MSC: 68Q25 05C40 05C70 PDFBibTeX XMLCite \textit{H. Fernau} et al., Theor. Comput. Sci. 565, 1--15 (2015; Zbl 1315.68150) Full Text: DOI
Misra, Neeldhara; Philip, Geevarghese; Raman, Venkatesh; Saurabh, Saket The kernelization complexity of connected domination in graphs with (no) small cycles. (English) Zbl 1318.68096 Algorithmica 68, No. 2, 504-530 (2014). MSC: 68Q25 05C12 05C69 PDFBibTeX XMLCite \textit{N. Misra} et al., Algorithmica 68, No. 2, 504--530 (2014; Zbl 1318.68096) Full Text: DOI