| Publication | Date of Publication | Type |
|---|
| Minimizing the numbers of cliques and cycles of fixed size in an \(F\)-saturated graph | 2021-02-08 | Paper |
| Large rainbow matchings in edge-colored graphs | 2020-11-08 | Paper |
| Extremal Graphs with Local Covering Conditions | 2020-07-30 | Paper |
| Distance-Uniform Graphs with Large Diameter | 2019-08-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5743419 | 2019-05-10 | Paper |
| The random k‐matching‐free process | 2019-02-20 | Paper |
| Anarchy Is Free in Network Creation | 2018-10-30 | Paper |
| 57Th International Mathematical Olympiad | 2018-10-25 | Paper |
| Packing Hamilton Cycles Online | 2018-07-24 | Paper |
| Classifying unavoidable Tverberg partitions | 2018-06-05 | Paper |
| Induced Turán Numbers | 2018-05-24 | Paper |
| Cops and Robbers on Planar‐Directed Graphs | 2017-12-01 | Paper |
| Maximizing the Number of Independent Sets of a Fixed Size | 2017-10-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5365090 | 2017-09-29 | Paper |
| The critical window for the classical Ramsey-Turán problem | 2017-03-31 | Paper |
| 56th International Mathematical Olympiad | 2017-01-18 | Paper |
| Increasing Hamiltonian paths in random edge orderings | 2016-06-10 | Paper |
| Judicious partitions of directed graphs | 2016-02-03 | Paper |
| Diameter critical graphs | 2016-01-28 | Paper |
| 55th International Mathematical Olympiad | 2015-11-23 | Paper |
| Directed paths: from Ramsey to Ruzsa and Szemer\'edi | 2015-05-27 | Paper |
| Anarchy Is Free in Network Creation | 2015-01-13 | Paper |
| Bisections of graphs | 2014-10-13 | Paper |
| Computing with Voting Trees | 2014-09-26 | Paper |
| Packing tree factors in random and pseudo-random graphs | 2014-09-04 | Paper |
| Thresholds for extreme orientability | 2014-07-03 | Paper |
| Rainbow hamilton cycles in random graphs | 2014-05-13 | Paper |
| On a problem of Erdős and Rothschild on edges in triangles | 2014-05-05 | Paper |
| Hamiltonian increasing paths in random edge orderings | 2014-03-04 | Paper |
| Self-similarity of graphs | 2013-09-26 | Paper |
| Optimal divisibility conditions for loose Hamilton cycles in random hypergraphs | 2013-06-07 | Paper |
| Stochastic coalescence in logarithmic time | 2013-04-24 | Paper |
| Variations on cops and robbers | 2012-06-13 | Paper |
| The size of a hypergraph and its matching number | 2012-06-04 | Paper |
| Packing tight Hamilton cycles in 3-uniform hypergraphs | 2012-05-14 | Paper |
| 51st International Mathematical Olympiad | 2011-12-07 | Paper |
| Ramsey games with giants | 2011-01-17 | Paper |
| Maximizing the number of q -colorings | 2010-11-26 | Paper |
| Constrained Ramsey Numbers | 2010-04-23 | Paper |
| A note on embedding hypertrees | 2009-07-08 | Paper |
| Avoiding small subgraphs in Achlioptas processes | 2009-03-04 | Paper |
| Large induced trees in \(K_r\)-free graphs | 2009-03-04 | Paper |
| On the strong chromatic number of random graphs | 2008-07-21 | Paper |
| Constrained Ramsey Numbers | 2008-06-05 | Paper |
| Independent transversals in locally sparse graphs | 2007-10-10 | Paper |
| Bounding the number of edges in permutation graphs | 2006-08-30 | Paper |
| Finding Shortest Paths With Computational Geometry | 2005-05-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4667622 | 2005-04-20 | Paper |
