Foucaud, Florent, and Ralf Klasing. “Parameterized and Approximation Complexity of the Detection Pair Problem in Graphs”. Journal of Graph Algorithms and Applications, vol. 21, no. 6, Oct. 2017, pp. 1039-56, doi:10.7155/jgaa.00449.