Foucaud, F., & Klasing, R. (2017). Parameterized and approximation complexity of the detection pair problem in graphs. Journal of Graph Algorithms and Applications, 21(6), 1039–1056. https://doi.org/10.7155/jgaa.00449