Random-Player Maker-Breaker games. - Michael Krivelevich; Gal Kronenberg (Electron. J. Comb., 2015)

Packing, Counting and Covering Hamilton cycles in random directed graphs. - Asaf Ferber; Gal Kronenberg; Eoin Long (Electron. Notes Discret. Math., 2015)

Efficient Winning Strategies in Random-Turn Maker-Breaker Games. - Asaf Ferber; Michael Krivelevich; Gal Kronenberg (J. Graph Theory, 2017)

Ramsey-nice families of graphs. - Ron Aharoni; Noga Alon; Michal Amir; Penny Haxell; Dan Hefetz; Zilin Jiang; Gal Kronenberg; Alon Naor (Eur. J. Comb., 2018)

On MAXCUT in strictly supercritical random graphs, and coloring of random graphs and random tournaments. - Lior Gishboliner; Michael Krivelevich; Gal Kronenberg (Random Struct. Algorithms, 2018)

A note on the minimum number of edges in hypergraphs with property O. - Gal Kronenberg; Christopher Kusch; Ander Lamaison; Piotr Micek; Tuan Tran (Eur. J. Comb., 2019)

Goldberg's conjecture is true for random multigraphs. - Penny Haxell; Michael Krivelevich; Gal Kronenberg (J. Comb. Theory B, 2019)

Semi-random graph process. - Omri Ben-Eliezer; Dan Hefetz; Gal Kronenberg; Olaf Parczyk; Clara Shikhelman; Milos Stojakovic (Random Struct. Algorithms, 2020)

Weak saturation numbers of complete bipartite graphs in the clique. - Gal Kronenberg; Taísa Martins; Natasha Morrison (J. Comb. Theory A, 2021)

A multidimensional Ramsey Theorem. - António Girão; Gal Kronenberg; Alex Scott 001 (CoRR, 2022)

Shotgun assembly of random graphs. - Tom Johnston; Gal Kronenberg; Alexander Roberts; Alex Scott 001 (CoRR, 2022)

( boldsymbol{H} )-Games Played on Vertex Sets of Random Graphs. - Gal Kronenberg; Adva Mond; Alon Naor (SIAM J. Discret. Math., 2023)

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

Seymour's second neighbourhood conjecture: random graphs and reductions. - Alberto Espuny Díaz; António Girão; Bertille Granet; Gal Kronenberg (Random Struct. Algorithms, 2025)