Algorithmic detectability of iwip automorphisms
  We produce an algorithm that, given $\phi\in Out(F_N)$, where $N\ge 2$, decides wether or not $\phi$ is an iwip ("fully irreducible") automorphism. 
Ilya Kapovich
math.GR math.GT