| Publication | Date of Publication | Type |
|---|
Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph
European Journal of Combinatorics | 2021-02-08 | Paper |
| Large rainbow matchings in edge-colored graphs | 2020-11-08 | Paper |
Extremal graphs with local covering conditions
SIAM Journal on Discrete Mathematics | 2020-07-30 | Paper |
Distance-uniform graphs with large diameter
SIAM Journal on Discrete Mathematics | 2019-08-29 | Paper |
| Stochastic coalescence in logarithmic time | 2019-05-10 | Paper |
The random k-matching-free process
Random Structures & Algorithms | 2019-02-20 | Paper |
Anarchy is free in network creation
ACM Transactions on Algorithms | 2018-10-30 | Paper |
57<sup>Th</sup> International Mathematical Olympiad
Mathematics Magazine | 2018-10-25 | Paper |
Packing Hamilton cycles online
Combinatorics, Probability and Computing | 2018-07-24 | Paper |
Classifying unavoidable Tverberg partitions
(available as arXiv preprint) | 2018-06-05 | Paper |
Induced Turán numbers
Combinatorics, Probability and Computing | 2018-05-24 | Paper |
Cops and Robbers on Planar‐Directed Graphs
Journal of Graph Theory | 2017-12-01 | Paper |
Maximizing the number of independent sets of a fixed size
Combinatorics, Probability and Computing | 2017-10-04 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2017-09-29 | Paper |
The critical window for the classical Ramsey-Turán problem
Combinatorica | 2017-03-31 | Paper |
56<sup>th</sup> International Mathematical Olympiad
Mathematics Magazine | 2017-01-18 | Paper |
Increasing Hamiltonian paths in random edge orderings
Random Structures & Algorithms | 2016-06-10 | Paper |
Judicious partitions of directed graphs
Random Structures & Algorithms | 2016-02-03 | Paper |
Diameter critical graphs
Journal of Combinatorial Theory. Series B | 2016-01-28 | Paper |
55th International Mathematical Olympiad
Mathematics Magazine | 2015-11-23 | Paper |
| Directed paths: from Ramsey to Ruzsa and Szemer\'edi | 2015-05-27 | Paper |
Anarchy is free in network creation
Lecture Notes in Computer Science | 2015-01-13 | Paper |
Bisections of graphs
Journal of Combinatorial Theory. Series B | 2014-10-13 | Paper |
Computing with voting trees
SIAM Journal on Discrete Mathematics | 2014-09-26 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Packing tree factors in random and pseudo-random graphs
The Electronic Journal of Combinatorics | 2014-09-04 | Paper |
Thresholds for extreme orientability
Algorithmica | 2014-07-03 | Paper |
Rainbow Hamilton cycles in random graphs
Random Structures & Algorithms | 2014-05-13 | Paper |
On a problem of Erdős and Rothschild on edges in triangles
Combinatorica | 2014-05-05 | Paper |
On a problem of Erdős and Rothschild on edges in triangles
Combinatorica | 2014-05-05 | Paper |
| Hamiltonian increasing paths in random edge orderings | 2014-03-04 | Paper |
Self-similarity of graphs
SIAM Journal on Discrete Mathematics | 2013-09-26 | Paper |
Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs
The Electronic Journal of Combinatorics | 2013-06-07 | Paper |
Stochastic coalescence in logarithmic time
The Annals of Applied Probability | 2013-04-24 | Paper |
Stochastic coalescence in logarithmic time
The Annals of Applied Probability | 2013-04-24 | Paper |
Variations on cops and robbers
Journal of Graph Theory | 2012-06-13 | Paper |
The size of a hypergraph and its matching number
Combinatorics, Probability and Computing | 2012-06-04 | Paper |
Packing tight Hamilton cycles in 3-uniform hypergraphs
Random Structures & Algorithms | 2012-05-14 | Paper |
51st International Mathematical Olympiad
Mathematics Magazine | 2011-12-07 | Paper |
Ramsey games with giants
Random Structures & Algorithms | 2011-01-17 | Paper |
Maximizing the number of <i>q</i> -colorings
Proceedings of the London Mathematical Society | 2010-11-26 | Paper |
Constrained Ramsey numbers
Combinatorics, Probability and Computing | 2010-04-23 | Paper |
A note on embedding hypertrees
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
A note on embedding hypertrees
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
A note on embedding hypertrees
The Electronic Journal of Combinatorics | 2009-07-08 | Paper |
Large induced trees in \(K_r\)-free graphs
Journal of Combinatorial Theory. Series B | 2009-03-04 | Paper |
Avoiding small subgraphs in Achlioptas processes
Random Structures & Algorithms | 2009-03-04 | Paper |
On the strong chromatic number of random graphs
(available as arXiv preprint) | 2008-07-21 | Paper |
Constrained Ramsey Numbers
Electronic Notes in Discrete Mathematics | 2008-06-05 | Paper |
Independent transversals in locally sparse graphs
Journal of Combinatorial Theory. Series B | 2007-10-10 | Paper |
Bounding the number of edges in permutation graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
Bounding the number of edges in permutation graphs
The Electronic Journal of Combinatorics | 2006-08-30 | Paper |
Finding Shortest Paths With Computational Geometry
Journal of Graph Algorithms and Applications | 2005-05-25 | Paper |
| scientific article; zbMATH DE number 2159656 (Why is no real title available?) | 2005-04-20 | Paper |
| scientific article; zbMATH DE number 2159656 (Why is no real title available?) | 2005-04-20 | Paper |
