We study the enumeration of set partitions, according to their length, number of parts, cyclic type, and genus. We introduce genus-dependent Bell, Stirling numbers, and Faà di Bruno coefficients. Besides attempting to summarize what is already known on the subject, we obtain new generic results (in particular for partitions into two parts, for arbitrary genus), and present computer generated new data extending the number of terms known for sequences or families of such coefficients; this also leads to new conjectures.