| Publication | Date of Publication | Type |
|---|
| Ramsey properties of randomly perturbed hypergraphs | 2025-10-06 | Paper |
Minors, connectivity, and diameter in randomly perturbed sparse graphs
European Journal of Combinatorics | 2025-06-02 | Paper |
Smoothed analysis of the Komlós conjecture: Rademacher noise
The Electronic Journal of Combinatorics | 2025-05-06 | Paper |
Coloring graphs from random lists
Random Structures & Algorithms | 2025-02-14 | Paper |
| Semi-random process without replacement | 2024-09-13 | Paper |
| Rainbow cliques in randomly perturbed dense graphs | 2024-09-13 | Paper |
Cycle lengths in randomly perturbed graphs
Random Structures & Algorithms | 2023-11-07 | Paper |
| Ramsey properties of randomly perturbed hypergraphs | 2023-11-03 | Paper |
Rainbow trees in uniformly edge‐colored graphs
Random Structures & Algorithms | 2023-10-19 | Paper |
| Smoothed Analysis of the Koml\'os Conjecture: Rademacher Noise | 2023-07-12 | Paper |
Semi-random process without replacement
Journal of Combinatorics | 2023-01-11 | Paper |
| Minors, connectivity, and diameter in randomly perturbed sparse graphs | 2022-12-14 | Paper |
Large Rainbow Cliques in Randomly Perturbed Dense Graphs
SIAM Journal on Discrete Mathematics | 2022-12-09 | Paper |
On the local structure of oriented graphs -- a case study in flag algebras
The Electronic Journal of Combinatorics | 2022-09-06 | Paper |
Small rainbow cliques in randomly perturbed dense graphs
European Journal of Combinatorics | 2022-01-13 | Paper |
| Spanning-tree games | 2021-08-04 | Paper |
Rainbow Hamilton cycles in randomly colored randomly perturbed dense graphs
SIAM Journal on Discrete Mathematics | 2021-07-23 | Paper |
Edge-statistics on large graphs
Combinatorics, Probability and Computing | 2021-06-15 | Paper |
Very fast construction of bounded-degree spanning graphs via the semi-random graph process
Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms | 2021-02-02 | Paper |
Very fast construction of bounded‐degree spanning graphs via the semi‐random graph process
Random Structures & Algorithms | 2021-01-05 | Paper |
Semi-random graph process
Random Structures & Algorithms | 2020-06-19 | Paper |
On the inducibility of cycles
Journal of Combinatorial Theory. Series B | 2018-10-11 | Paper |
Polynomial lower bound for distributed graph coloring in a weak LOCAL model
(available as arXiv preprint) | 2018-08-16 | Paper |
Ramsey-nice families of graphs
European Journal of Combinatorics | 2018-06-28 | Paper |
On the inducibility of cycles
Electronic Notes in Discrete Mathematics | 2018-01-18 | Paper |
Manipulative waiters with probabilistic intuition
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
Universality of graphs with few triangles and anti-triangles
Combinatorics, Probability and Computing | 2017-10-10 | Paper |
| Hitting time results for maker-breaker games (extended abstract) | 2017-09-29 | Paper |
Waiter-client and client-waiter Hamiltonicity games on random graphs
European Journal of Combinatorics | 2017-06-19 | Paper |
Strong Ramsey games: drawing on an infinite board
Journal of Combinatorial Theory. Series A | 2017-05-29 | Paper |
Strong Ramsey games: drawing on an infinite board
Journal of Combinatorial Theory. Series A | 2017-05-29 | Paper |
On degree anti-Ramsey numbers
European Journal of Combinatorics | 2016-11-07 | Paper |
Random directed graphs are robustly Hamiltonian
Random Structures & Algorithms | 2016-09-15 | Paper |
Picker-chooser fixed graph games
Journal of Combinatorial Theory. Series B | 2016-04-21 | Paper |
Waiter-Client and Client-Waiter planarity, colorability and minor games
Discrete Mathematics | 2016-04-07 | Paper |
On saturation games
European Journal of Combinatorics | 2015-09-30 | Paper |
Building spanning trees quickly in maker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Building spanning trees quickly in maker-breaker games
SIAM Journal on Discrete Mathematics | 2015-09-23 | Paper |
Optimal covers with Hamilton cycles in random graphs
Combinatorica | 2015-01-07 | Paper |
Weak and strong \(k\)-connectivity games
European Journal of Combinatorics | 2014-07-29 | Paper |
| scientific article; zbMATH DE number 6303013 (Why is no real title available?) | 2014-06-11 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families
The Seventh European Conference on Combinatorics, Graph Theory and Applications | 2014-06-11 | Paper |
Positional games
Oberwolfach Seminars | 2014-03-05 | Paper |
A hypergraph Turán theorem via Lagrangians of intersecting families
Journal of Combinatorial Theory. Series A | 2014-01-06 | Paper |
| Fast embedding of spanning trees in biased maker-breaker games | 2013-11-01 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
(available as arXiv preprint) | 2013-11-01 | Paper |
Avoider-Enforcer: the rules of the game
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Playing to retain the advantage
Electronic Notes in Discrete Mathematics | 2013-10-10 | Paper |
Sharp threshold for the appearance of certain spanning trees in random graphs
Random Structures & Algorithms | 2012-12-14 | Paper |
Hitting time results for maker-breaker games
Random Structures & Algorithms | 2012-08-30 | Paper |
Fast embedding of spanning trees in biased maker-breaker games
European Journal of Combinatorics | 2012-06-18 | Paper |
Doubly biased maker-breaker connectivity game
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
Doubly biased maker-breaker connectivity game
The Electronic Journal of Combinatorics | 2012-06-12 | Paper |
On two generalizations of the Alon-Tarsi polynomial method
Journal of Combinatorial Theory. Series B | 2011-12-08 | Paper |
Winning strong games through fast strategies for weak games
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Winning strong games through fast strategies for weak games
The Electronic Journal of Combinatorics | 2011-07-29 | Paper |
Hamilton cycles in highly connected and expanding graphs
Combinatorica | 2011-02-08 | Paper |
Hamilton cycles in highly connected and expanding graphs
Combinatorica | 2011-02-08 | Paper |
Global maker-breaker games on sparse graphs
European Journal of Combinatorics | 2011-01-07 | Paper |
An application of the combinatorial nullstellensatz to a graph labelling problem
Journal of Graph Theory | 2010-11-10 | Paper |
On antimagic directed graphs
Journal of Graph Theory | 2010-11-10 | Paper |
Playing to retain the advantage
Combinatorics, Probability and Computing | 2010-10-14 | Paper |
Avoider-enforcer: the rules of the game
Journal of Combinatorial Theory. Series A | 2010-04-27 | Paper |
Fast winning strategies in avoider-enforcer games
Graphs and Combinatorics | 2010-01-18 | Paper |
On two problems regarding the Hamiltonian cycle game
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
On two problems regarding the Hamiltonian cycle game
The Electronic Journal of Combinatorics | 2009-04-07 | Paper |
Planarity, Colorability, and Minor Games
SIAM Journal on Discrete Mathematics | 2009-03-16 | Paper |
A sharp threshold for the Hamilton cycle Maker–Breaker game
Random Structures & Algorithms | 2009-03-04 | Paper |
Fast winning strategies in maker-breaker games
Journal of Combinatorial Theory. Series B | 2009-01-21 | Paper |
Fast winning strategies in positional games
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Avoider-Enforcer games
Journal of Combinatorial Theory. Series A | 2007-07-04 | Paper |
Bart--Moe games, JumbleG and discrepancy
European Journal of Combinatorics | 2007-04-10 | Paper |
Anti‐magic graphs via the Combinatorial NullStellenSatz
Journal of Graph Theory | 2005-12-08 | Paper |
Colouring graphs from random lists
(available as arXiv preprint) | N/A | Paper |
