%0 Journal Article
%A Florent Foucaud
%A Ralf Klasing
%T Parameterized and approximation complexity of the detection pair problem in graphs
%J Journal of Graph Algorithms and Applications
%D 2017
%P 1039-1056
%V 21
%N 6
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.7155/jgaa.00449/
%R 10.7155/jgaa.00449
%G en
%F JGAA_2017_21_6_a3