“…Secondly, following the ideas introduced by Benardete, Gutierrez and Nitecki [1,2], connections between the reducibility problem and the Garside structures of braid groups have been used for detecting reducibility [1,2,28,27,12,10]. Our work fits in this approach and builds mainly on the last algorithm by González-Meneses and Wiest [27]. However Garside tools are not the only ones needed in the paper: we bring into play a very deep property of Mapping Class Groups: the so-called linearly bounded conjugator property [29,31], see Theorem 16.…”