| Publication | Date of Publication | Type |
|---|
| Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees | 2024-11-12 | Paper |
| Fragmentation processes derived from conditioned stable Galton-Watson trees | 2024-05-14 | Paper |
| Fringe trees for random trees with given vertex degrees | 2023-12-07 | Paper |
| Approximation of Subgraph Counts in the Uniform Attachment Model | 2023-11-07 | Paper |
| The asymptotic distribution of cluster sizes for supercritical percolation on random split trees | 2023-10-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6161818 | 2023-06-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5874403 | 2023-02-07 | Paper |
| Largest Clusters for Supercritical Percolation on Split Trees | 2023-02-07 | Paper |
| The fluctuations of the giant cluster for percolation on random split trees | 2022-08-02 | Paper |
| Split trees -- a unifying model for many important random trees of logarithmic height: a brief survey | 2021-12-21 | Paper |
| Convergence of trees with a given degree sequence and of their associated laminations | 2021-11-15 | Paper |
| Embedding small digraphs and permutations in binary trees and split trees | 2021-06-15 | Paper |
| Inversions in split trees and conditional Galton--Watson trees | 2021-06-15 | Paper |
| A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees | 2021-02-01 | Paper |
| The \(k\)-cut model in deterministic and random trees | 2021-01-29 | Paper |
| Invariance principle for fragmentation processes derived from conditioned stable Galton-Watson trees | 2020-10-15 | Paper |
| Normal limit laws for vertex degrees in randomly grown hooking networks and bipolar networks | 2020-06-15 | Paper |
| Inversions in Split Trees and Conditional Galton–Watson Trees | 2020-04-06 | Paper |
| Embedding small digraphs and permutations in binary trees and split trees | 2020-02-06 | Paper |
| \(k\)-cuts on a path | 2020-02-06 | Paper |
| Cutting resilient networks -- complete binary trees | 2019-12-09 | Paper |
| Limit laws for self-loops and multiple edges in the configuration model | 2019-11-20 | Paper |
| A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees | 2019-09-27 | Paper |
| Degree distributions of generalized hooking networks | 2019-09-18 | Paper |
| \(k\)-cut on paths and some trees | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4632487 | 2019-04-29 | Paper |
| Heavy subtrees of Galton-Watson trees with an application to Apollonian networks | 2019-02-14 | Paper |
| Multivariate normal limit laws for the numbers of fringe subtrees in \(m\)-ary search trees and preferential attachment trees | 2017-07-13 | Paper |
| Fringe trees, Crump-Mode-Jagers branching processes and \(m\)-ary search trees | 2017-04-07 | Paper |
| Majority bootstrap percolation on \(G(n,p)\) | 2017-02-17 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2959868 | 2017-02-10 | Paper |
| Using Stein's method to show Poisson and normal limit laws for fringe subtrees | 2016-03-01 | Paper |
| On percolation in one-dimensional stable Poisson graphs | 2015-08-17 | Paper |
| Asymptotic distribution of two-protected nodes in ternary search trees | 2015-08-07 | Paper |
| Limit laws for functions of fringe trees for binary search trees and random recursive trees | 2015-02-03 | Paper |
| Cutting down trees with a Markov chainsaw | 2014-11-21 | Paper |
| The time of bootstrap percolation with dense initial sets | 2014-08-22 | Paper |
| Bootstrap percolation on Galton-Watson trees | 2014-02-14 | Paper |
| The total path length of split trees | 2012-11-29 | Paper |
| Counterexamples to a monotonicity conjecture for the threshold pebbling number | 2012-08-10 | Paper |
| Novel characteristics of split trees by use of renewal theory | 2012-06-22 | Paper |
| A weakly 1-stable distribution for the number of random records and cuttings in split trees | 2011-05-03 | Paper |
| Random Records and Cuttings in Binary Search Trees | 2010-11-19 | Paper |
