Counting involutory, unimodal, and alternating signed permutations

In this work we count the number of involutory, unimodal, and alternating elements of the group of signed permutations BnBn, and the group of even-signed permutations DnDn. Recurrence relations, generating functions, and explicit formulas of the enumerating sequences are given.