| Publication | Date of Publication | Type |
|---|
| \(d\)-connectivity of the random graph with restricted budget | 2025-01-06 | Paper |
| Sharp threshold for embedding balanced spanning trees in random geometric graphs | 2024-08-30 | Paper |
| On the \((6,4)\)-problem of Brown, Erdős, and Sós | 2024-06-27 | Paper |
| Annulus graphs in \(\mathbb{R}^d\) | 2024-06-21 | Paper |
| The maximal running time of hypergraph bootstrap percolation | 2024-05-22 | Paper |
| Conflict-free hypergraph matchings | 2024-05-14 | Paper |
| Percolation on dense random graphs with given degrees | 2024-05-10 | Paper |
| Large monochromatic components in colorings of complete hypergraphs | 2024-04-09 | Paper |
| Brownian snails with removal die out in one dimension | 2024-01-17 | Paper |
| Color-avoiding percolation of random graphs: between the subcritical and the intermediate regime | 2023-10-30 | Paper |
| The jump of the clique chromatic number of random graphs | 2023-10-23 | Paper |
| On the modularity of 3‐regular random graphs and random graphs with given degree sequences | 2023-10-17 | Paper |
| The giant component after percolation of product graphs | 2023-10-05 | Paper |
| On the first and second largest components in the percolated random geometric graph | 2023-09-15 | Paper |
| On the minimum bisection of random 3-regular graphs | 2023-06-27 | Paper |
| Local dimer dynamics in higher dimensions | 2023-04-21 | Paper |
| Sharp threshold for embedding balanced spanning trees in random geometric graphs | 2023-03-24 | Paper |
| On the boxicity of Kneser graphs and complements of line graphs | 2023-03-10 | Paper |
| Label propagation on binomial random graphs | 2023-02-07 | Paper |
| Lower bound on the running time of Pop-Stack Sorting on a random permutation | 2022-12-19 | Paper |
| Localization game for random geometric graphs | 2022-12-01 | Paper |
| Color-avoiding percolation on the Erd\H{o}s-R\'enyi random graph | 2022-11-29 | Paper |
| On the $(6,4)$-problem of Brown, Erd\H{o}s and S\'os | 2022-09-28 | Paper |
| On the Power of Choice for Boolean Functions | 2022-08-31 | Paper |
| Dynamic random graphs with vertex removal | 2022-07-11 | Paper |
| New constructions related to the polynomial sphere recognition problem | 2022-05-16 | Paper |
| Conflict-free hypergraph matchings | 2022-05-11 | Paper |
| The semi-random tree process | 2022-04-15 | Paper |
| Local boxicity | 2022-04-07 | Paper |
| Annulus graphs in $\mathbb R^d$ | 2021-12-17 | Paper |
| New results for the random nearest neighbor tree | 2021-08-30 | Paper |
| On the chromatic number of the preferential attachment graph | 2021-06-18 | Paper |
| A note on the Erdős-Szekeres theorem in two dimensions | 2021-06-07 | Paper |
| On the Boxicity of Kneser Graphs and Complements of Line Graphs | 2021-05-06 | Paper |
| New Constructions related to the Polynomial Sphere Recognition Problem | 2020-03-01 | Paper |
| On the Decycling Number of $4$-regular Random Graphs | 2020-03-01 | Paper |
| $d$-connectivity of the random graph with restricted budget | N/A | Paper |
| The maximal running time of hypergraph bootstrap percolation | N/A | Paper |
| Zero-sum Random Games on Directed Graphs | N/A | Paper |
| On the $(k+2,k)$-problem of Brown, Erd\H{o}s and S\'os for $k=5,6,7$ | N/A | Paper |
