Follow
Dennis Clemens
Dennis Clemens
Oberingenieur, Institut für Mathematik, Technische Universität Hamburg
Verified email at tuhh.de
Title
Cited by
Cited by
Year
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
302012
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
252019
An improved bound on the sizes of matchings guaranteeing a rainbow matching
D Clemens, J Ehrenmüller
arXiv preprint arXiv:1503.00438, 2015
202015
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
192015
Creating cycles in Walker–Breaker games
D Clemens, T Tran
Discrete mathematics 339 (8), 2113-2126, 2016
132016
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
122021
A Dirac-type theorem for Berge cycles in random hypergraphs
D Clemens, J Ehrenmüller, Y Person
arXiv preprint arXiv:1903.09057, 2019
112019
Colourings without monochromatic disjoint pairs
D Clemens, S Das, T Tran
European journal of combinatorics 70, 99-124, 2018
112018
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
112017
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
102023
Keeping Avoider's graph almost acyclic
D Clemens, J Ehrenmüller, Y Person, T Tran
arXiv preprint arXiv:1403.1482, 2014
92014
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
82020
How fast can Maker win in fair biased games?
D Clemens, M Mikalački
Discrete mathematics 341 (1), 51-66, 2018
82018
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
72021
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
72020
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
52023
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
42022
The random graph intuition for the tournament game
D Clemens, H Gebauer, A Liebenau
Combinatorics, Probability and Computing 25 (1), 76-88, 2016
42016
Ramsey equivalence for asymmetric pairs of graphs
S Boyadzhiyska, D Clemens, P Gupta, J Rollin
SIAM Journal on Discrete Mathematics 38 (1), 55-74, 2024
22024
Multistage positional games
J Barkey, D Clemens, F Hamann, M Mikalački, A Sgueglia
Discrete mathematics 346 (9), 113478, 2023
22023
The system can't perform the operation now. Try again later.
Articles 1–20