The last few years have seen the development and improvement of structural results in the area of sequence subsums over abelian groups. These results often have the flavor that either many elements can be represented as a sum of terms from a subsequence of the given sequence (possibly with length restrictions) or else the sequence must itself be highly structured. The Subsum Kneser's Theorem, giving the corresponding analog of the classical Kneser's Theorem for sumsets, is one such example. The statements of such results, particulary in their stronger forms, are often more challenging and technical in appearance, but they have been utilized to strong effect when searching for zero-sums in a variety of circumstances. In this talk, we will give an overview of several of these results, focussing on how they were successfully used in various concrete extremal problems involving zero-sums.