A New Upper Bound for Cancellative Pairs. - Barnabás Janzer (Electron. J. Comb., 2018)

Projections of Antichains. - Barnabás Janzer (Electron. J. Comb., 2020)

On Query-efficient Planning in MDPs under Linear Realizability of the Optimal State-value Function. - Gellért Weisz; Philip Amortila; Barnabás Janzer; Yasin Abbasi-Yadkori; Nan Jiang 008; Csaba Szepesvári (COLT, 2021)

Large hypergraphs without tight cycles. - Barnabás Janzer (Comb. Theory, 2021)

Generalizations of the Ruzsa-Szemerédi and rainbow Turán problems for cliques. - W. T. Gowers 001; Barnabás Janzer (Comb. Probab. Comput., 2021)

A note on the orientation covering number. - Barnabás Janzer (Discret. Appl. Math., 2021)

A note on saturation for $k$-wise intersecting families. - Barnabás Janzer (Comb. Theory, 2022)

The Generalized Rainbow Turán Problem for Cycles. - Barnabás Janzer (SIAM J. Discret. Math., 2022)

Partial Shuffles by Lazy Swaps. - Barnabás Janzer; J. Robert Johnson; Imre Leader (SIAM J. Discret. Math., 2023)

On locally rainbow colourings. - Barnabás Janzer; Oliver Janzer (J. Comb. Theory B, 2024)

Long running times for hypergraph bootstrap percolation. - Alberto Espuny Díaz; Barnabás Janzer; Gal Kronenberg; Joanna Lada (Eur. J. Comb., 2024)

Rotation Inside Convex Kakeya Sets. - Barnabás Janzer (Discret. Comput. Geom., 2025)

Sunflowers and Ramsey problems for restricted intersections. - Barnabás Janzer; Zhihan Jin; Benny Sudakov; Kewen Wu 001 (CoRR, 2025)