Fast Strategies In Maker-Breaker Games Played on Random Boards. - Dennis Clemens; Asaf Ferber; Michael Krivelevich; Anita Liebenau (Comb. Probab. Comput., 2012)

What is Ramsey-equivalent to a clique? - Jacob Fox; Andrey Grinshpun; Anita Liebenau; Yury Person; Tibor Szabó (J. Comb. Theory B, 2014)

Building Spanning Trees Quickly in Maker-Breaker Games. - Dennis Clemens; Asaf Ferber; Roman Glebov; Dan Hefetz; Anita Liebenau (SIAM J. Discret. Math., 2015)

On the Concentration of the Domination Number of the Random Graph. - Roman Glebov; Anita Liebenau; Tibor Szabó (SIAM J. Discret. Math., 2015)

The Random Graph Intuition for the Tournament Game. - Dennis Clemens; Heidi Gebauer; Anita Liebenau (Comb. Probab. Comput., 2016)

On the minimum degree of minimal Ramsey graphs for multiple colours. - Jacob Fox; Andrey Grinshpun; Anita Liebenau; Yury Person; Tibor Szabó (J. Comb. Theory B, 2016)

The Erdős-Hajnal conjecture for caterpillars and their complements. - Anita Liebenau; Marcin Pilipczuk (CoRR, 2017)

First order convergence of matroids. - Frantisek Kardos; Daniel Král'; Anita Liebenau; Lukás Mach (Eur. J. Comb., 2017)

A non-trivial upper bound on the threshold bias of the Oriented-cycle game. - Dennis Clemens; Anita Liebenau (J. Comb. Theory B, 2017)

Ramsey equivalence of Kn and Kn+Kn-1. - Thomas F. Bloom; Anita Liebenau (Electron. J. Comb., 2018)

Excluding Hooks and their Complements. - Krzysztof Choromanski; Dvir Falik; Anita Liebenau; Viresh Patel; Marcin Pilipczuk (Electron. J. Comb., 2018)

The size Ramsey number of graphs with bounded treewidth. - Nina Kamcev; Anita Liebenau; David Wood; Liana Yepremyan (CoRR, 2019)

Caterpillars in Erdős-Hajnal. - Anita Liebenau; Marcin Pilipczuk; Paul D. Seymour; Sophie Spirkl (J. Comb. Theory B, 2019)

On minimal Ramsey graphs and Ramsey equivalence in multiple colours. - Dennis Clemens; Anita Liebenau; Damian Reding (Comb. Probab. Comput., 2020)

An approximate version of Jackson's conjecture. - Anita Liebenau; Yanitsa Pehova (Comb. Probab. Comput., 2020)

Most binary matrices have no small defining set. - Carly Bodkin; Anita Liebenau; Ian M. Wanless (Discret. Math., 2020)

The Size Ramsey Number of Graphs with Bounded Treewidth. - Nina Kamcev; Anita Liebenau; David R. Wood; Liana Yepremyan (SIAM J. Discret. Math., 2021)

The threshold bias of the clique-factor game. - Anita Liebenau; Rajko Nenadov (J. Comb. Theory B, 2022)

Asymptotic enumeration of digraphs and bipartite graphs by degree sequence. - Anita Liebenau; Nick Wormald (Random Struct. Algorithms, 2023)

On the Minimum Degree of Minimal Ramsey Graphs for Cliques Versus Cycles. - Anurag Bishnoi; Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta; Thomas Lesgourgues; Anita Liebenau (SIAM J. Discret. Math., 2023)

Asymmetric Ramsey properties of random graphs involving cliques and cycles. - Anita Liebenau; Letícia Mattos; Walner Mendonça; Jozef Skokan (Random Struct. Algorithms, 2023)

On Multicolor Turán Numbers. - József Balogh; Anita Liebenau; Letícia Mattos; Natasha Morrison (SIAM J. Discret. Math., 2024)