Exploiting Symmetries in the Computation of Graver Bases
  Many challenging Graver bases computations, like for multi-way tables in statistics, have a highly symmetric problem structure that is not exploited so far computationally. In this paper we present a Graver basis algorithm for sublattices of $\Z^n$ that exploits existing symmetry. 
Raymond Hemmecke