On certain partition bijections related to Euler's partition problem

We give short elementary expositions of combinatorial proofs of some variants of Euler’s partitition problem that were first addressed analytically by George Andrews, and later combinatorially by others. Our methods, based on ideas from a previous paper by the author , enable us to state and prove new generalizations of two of these results.