| Fast strategies in Maker–Breaker games played on random boards D Clemens, A Ferber, M Krivelevich, A Liebenau Combinatorics, Probability and Computing 21 (6), 897-915, 2012 | 30 | 2012 |
| The size‐Ramsey number of powers of paths D Clemens, M Jenssen, Y Kohayakawa, N Morrison, GO Mota, D Reding, ... Journal of graph theory 91 (3), 290-299, 2019 | 28 | 2019 |
| An improved bound on the sizes of matchings guaranteeing a rainbow matching D Clemens, J Ehrenmüller arXiv preprint arXiv:1503.00438, 2015 | 22 | 2015 |
| Building spanning trees quickly in Maker-Breaker games D Clemens, A Ferber, R Glebov, D Hefetz, A Liebenau SIAM journal on discrete mathematics 29 (3), 1683-1705, 2015 | 20 | 2015 |
| Creating cycles in Walker–Breaker games D Clemens, T Tran Discrete mathematics 339 (8), 2113-2126, 2016 | 14 | 2016 |
| On the size-Ramsey number of grid graphs D Clemens, M Miralaei, D Reding, M Schacht, A Taraz Combinatorics, Probability and Computing 30 (5), 670-685, 2021 | 13 | 2021 |
| Perfectly packing graphs with bounded degeneracy and many leaves P Allen, J Böttcher, D Clemens, A Taraz Israel journal of mathematics 255 (2), 501-579, 2023 | 12 | 2023 |
| A Dirac-type theorem for Berge cycles in random hypergraphs D Clemens, J Ehrenmüller, Y Person arXiv preprint arXiv:1903.09057, 2019 | 12 | 2019 |
| On sets not belonging to algebras and rainbow matchings in graphs D Clemens, J Ehrenmüller, A Pokrovskiy Journal of Combinatorial Theory, Series B 122, 109-120, 2017 | 12 | 2017 |
| The tree packing conjecture for trees of almost linear maximum degree P Allen, J Böttcher, D Clemens, J Hladký, D Piguet, A Taraz arXiv preprint arXiv:2106.11720, 2021 | 11 | 2021 |
| Colourings without monochromatic disjoint pairs D Clemens, S Das, T Tran European journal of combinatorics 70, 99-124, 2018 | 11 | 2018 |
| Fast Strategies in Waiter-Client Games on D Clemens, P Gupta, F Hamann, AM Haupt, M Mikalački, Y Mogge arXiv preprint arXiv:2003.09247, 2020 | 10 | 2020 |
| Keeping Avoider's graph almost acyclic D Clemens, J Ehrenmüller, Y Person, T Tran arXiv preprint arXiv:1403.1482, 2014 | 9 | 2014 |
| On minimal Ramsey graphs and Ramsey equivalence in multiple colours D Clemens, A Liebenau, D Reding Combinatorics, Probability and Computing 29 (4), 537-554, 2020 | 8 | 2020 |
| How fast can Maker win in fair biased games? D Clemens, M Mikalački Discrete mathematics 341 (1), 51-66, 2018 | 8 | 2018 |
| On the minimum degree of minimal Ramsey graphs for cliques versus cycles A Bishnoi, S Boyadzhiyska, D Clemens, P Gupta, T Lesgourgues, ... SIAM journal on discrete mathematics 37 (1), 25-50, 2023 | 5 | 2023 |
| Minimal Ramsey graphs with many vertices of small degree S Boyadzhiyska, D Clemens, P Gupta SIAM journal on discrete mathematics 36 (3), 1503-1528, 2022 | 4 | 2022 |
| Maker-Breaker games on randomly perturbed graphs D Clemens, F Hamann, Y Mogge, O Parczyk SIAM journal on discrete mathematics 35 (4), 2723-2748, 2021 | 4 | 2021 |
| The random graph intuition for the tournament game D Clemens, H Gebauer, A Liebenau Combinatorics, Probability and Computing 25 (1), 76-88, 2016 | 4 | 2016 |
| Multistage positional games J Barkey, D Clemens, F Hamann, M Mikalački, A Sgueglia Discrete mathematics 346 (9), 113478, 2023 | 3 | 2023 |
Anita LiebenauUNSW Sydney在 unsw.edu.au 的電子郵件地址已通過驗證
