In their seminal work, Diaconis and Shahshahani proved that shuffling a deck of $n$ cards sufficiently well via random transpositions takes $1/2 n log n$ steps. Their argument was algebraic and relied on the combinatorics of the symmetric group. In this talk, I will focus on two other shuffles, generalizing random transpositions and I will discuss the underlying combinatorics for understanding their mixing behavior and indeed proving cutoff. The talk will be based on joint works with A. Yan and S. Arfaee.