Подписаться
Dennis Clemens
Dennis Clemens
Oberingenieur, Institut für Mathematik, Technische Universität Hamburg
Подтвержден адрес электронной почты в домене tuhh.de
Название
Процитировано
Процитировано
Год
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
222012
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
202019
An improved bound on the sizes of matchings guaranteeing a rainbow matching
D Clemens, J Ehrenmüller
arXiv preprint arXiv:1503.00438, 2015
172015
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
152015
Creating cycles in Walker–Breaker games
D Clemens, T Tran
Discrete Mathematics 339 (8), 2113-2126, 2016
112016
Colourings without monochromatic disjoint pairs
D Clemens, S Das, T Tran
European Journal of Combinatorics 70, 99-124, 2018
102018
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
102017
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
92021
Perfectly packing graphs with bounded degeneracy and many leaves
P Allen, J Böttcher, D Clemens, A Taraz
arXiv preprint arXiv:1906.11558, 2019
92019
Keeping Avoider's graph almost acyclic
D Clemens, J Ehrenmüller, Y Person, T Tran
arXiv preprint arXiv:1403.1482, 2014
92014
How fast can Maker win in fair biased games?
D Clemens, M Mikalački
Discrete Mathematics 341 (1), 51-66, 2018
72018
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
52020
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
32020
A Dirac-type theorem for Berge cycles in random hypergraphs
D Clemens, J Ehrenmüller, Y Person
arXiv preprint arXiv:1903.09057, 2019
32019
The random graph intuition for the tournament game
D Clemens, H Gebauer, A Liebenau
Combinatorics, Probability and Computing 25 (1), 76-88, 2016
32016
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
22021
Minimal Ramsey graphs with many vertices of small degree
S Boyadzhiyska, D Clemens, P Gupta
arXiv preprint arXiv:2009.04159, 2020
22020
A non-trivial upper bound on the threshold bias of the Oriented-cycle game
D Clemens, A Liebenau
Journal of Combinatorial Theory, Series B 122, 21-54, 2017
22017
A remark on the Tournament game
D Clemens, M Mikalački
arXiv preprint arXiv:1503.02885, 2015
22015
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
12021
В данный момент система не может выполнить эту операцию. Повторите попытку позднее.
Статьи 1–20