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

Keeping Avoider's Graph Almost Acyclic. - Dennis Clemens; Julia Ehrenmüller; Yury Person; Tuan Tran (Electron. J. Comb., 2015)

A Remark on the Tournament Game. - Dennis Clemens; Mirjana Mikalacki (Electron. J. Comb., 2015)

Winning fast in fair biased Maker-Breaker games. - Dennis Clemens; Mirjana Mikalacki (Electron. Notes Discret. Math., 2015)

Minimum degrees and codegrees of minimal Ramsey 3-uniform hypergraphs. - Dennis Clemens; Yury Person (Electron. Notes Discret. Math., 2015)

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

An Improved Bound on the Sizes of Matchings Guaranteeing a Rainbow Matching. - Dennis Clemens; Julia Ehrenmüller (Electron. J. Comb., 2016)

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

Minimum Degrees and Codegrees of Ramsey-Minimal 3-Uniform Hypergraphs. - Dennis Clemens; Yury Person (Comb. Probab. Comput., 2016)

Creating cycles in Walker-Breaker games. - Dennis Clemens; Tuan Tran (Discret. Math., 2016)

A Dirac-type theorem for Hamilton Berge cycles in random hypergraphs. - Dennis Clemens; Julia Ehrenmüller; Yury Person (Electron. Notes Discret. Math., 2016)

On sets not belonging to algebras and rainbow matchings in graphs. - Dennis Clemens; Julia Ehrenmüller; Alexey Pokrovskiy (J. Comb. Theory B, 2017)

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

How fast can Maker win in fair biased games? - Dennis Clemens; Mirjana Mikalacki (Discret. Math., 2018)

Colourings without monochromatic disjoint pairs. - Dennis Clemens; Shagnik Das; Tuan Tran (Eur. J. Comb., 2018)

The size?Ramsey number of powers of paths. - Dennis Clemens; Matthew Jenssen; Yoshiharu Kohayakawa; Natasha Morrison; Guilherme Oliveira Mota; Damian Reding; Barnaby Roberts (J. Graph Theory, 2019)

A Dirac-type Theorem for Berge Cycles in Random Hypergraphs. - Dennis Clemens; Julia Ehrenmüller; Yury Person (Electron. J. Comb., 2020)

Fast Strategies in Waiter-Client Games. - Dennis Clemens; Pranshu Gupta; Fabian Hamann; Alexander Haupt; Mirjana Mikalacki; Yannick Mogge (Electron. J. Comb., 2020)

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

Connector-Breaker Games on Random Boards. - Dennis Clemens; Laurin Kirsch; Yannick Mogge (Electron. J. Comb., 2021)

On the size-Ramsey number of grid graphs. - Dennis Clemens; Meysam Miralaei; Damian Reding; Mathias Schacht; Anusch Taraz (Comb. Probab. Comput., 2021)

Maker-Breaker Games on Randomly Perturbed Graphs. - Dennis Clemens; Fabian Hamann; Yannick Mogge; Olaf Parczyk (SIAM J. Discret. Math., 2021)

Minimal Ramsey Graphs with Many Vertices of Small Degree. - Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta (SIAM J. Discret. Math., 2022)

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)

Multistage positional games. - Juri Barkey; Dennis Clemens; Fabian Hamann; Mirjana Mikalacki; Amedeo Sgueglia (Discret. Math., 2023)

Walker-Breaker Games on $G_{n,p}$. - Dennis Clemens; Pranshu Gupta; Yannick Mogge (Electron. J. Comb., 2024)

Ramsey Equivalence for Asymmetric Pairs of Graphs. - Simona Boyadzhiyska; Dennis Clemens; Pranshu Gupta; Jonathan Rollin (SIAM J. Discret. Math., 2024)

Tree universality in positional games. - Grzegorz Adamski; Sylwia Antoniuk; Malgorzata Bednarska-Bzdega; Dennis Clemens; Fabian Hamann; Yannick Mogge (Comb. Probab. Comput., 2025)

Ramsey simplicity of random graphs. - Simona Boyadzhiyska; Dennis Clemens; Shagnik Das; Pranshu Gupta (Comb. Probab. Comput., 2025)