[1]
F. Foucaud and R. Klasing, “Parameterized and approximation complexity of the detection pair problem in graphs”, JGAA, vol. 21, no. 6, pp. 1039–1056, Oct. 2017.