The k-defensive domination problem, a variant of the classical problem on graphs, seeks minimum cardinality vertex set providing surjective defense against any attack vertices bounded by parameter k, where every under is defended distinct defender (which can be itself). has been shown to NP-complete for fixed k; if k part input, unlikely in co-NP. We present efficient algorithms solving this pr...