Bijective proofs of the hook formula for rooted trees. - Beáta Bényi (Ars Comb., 2012)

Combinatorial Properties of Poly-Bernoulli Relatives. - Beáta Bényi; Péter Hajnal (Integers, 2017)

Bijective enumerations of Γ-free 0-1 matrices. - Beáta Bényi; Gábor V. Nagy (Adv. Appl. Math., 2018)

Poly-Bernoulli Numbers and Eulerian Numbers. - Beáta Bényi; Péter Hajnal (J. Integer Seq., 2018)

Restricted r-Stirling numbers and their combinatorial applications. - Beáta Bényi; Miguel Méndez; José Luis Ramírez; Tanay V. Wakhare (Appl. Math. Comput., 2019)

Some applications of S-restricted set partitions. - Beáta Bényi; José Luis Ramírez (Period. Math. Hung., 2019)

Generalized ordered set partitions. - Beáta Bényi; José Luis Ramírez; Miguel Méndez (Australas. J Comb., 2020)

A combinatorial analysis of higher order generalised geometric polynomials: A generalisation of barred preferential arrangements. - Sithembele Nkonkobe; Beáta Bényi; Roberto B. Corcino; Cristina B. Corcino (Discret. Math., 2020)

Lonesum and Γ-free 0-1 fillings of Ferrers shapes. - Beáta Bényi; Gábor V. Nagy (Eur. J. Comb., 2020)

Toppling on Permutations with an Extra Chip. - Arvind Ayyer; Beáta Bényi (Electron. J. Comb., 2021)

On the Combinatorics of Symmetrized Poly-Bernoulli Numbers. - Beáta Bényi; Toshiki Matsusaka (Electron. J. Comb., 2021)

A Bijection for the Boolean Numbers of Ferrers Graphs. - Beáta Bényi (Graphs Comb., 2022)

Pattern Avoidance in Weak Ascent Sequences. - Beáta Bényi; Toufik Mansour; José Luis Ramírez (Discret. Math. Theor. Comput. Sci., 2023)

Weak ascent sequences and related combinatorial structures. - Beáta Bényi; Anders Claesson; Mark Dukes (Eur. J. Comb., 2023)

Combinatorial approach of unified Apostol-type polynomials using α-distanced words. - Beáta Bényi; Sithembele Nkonkobe (Discret. Appl. Math., 2024)