Local Limits of Large Galton-Watson Trees Rerooted at a Random Vertex. - Benedikt Stufler (AofA, 2018)

Random Enriched Trees with Applications to Random Graphs. - Benedikt Stufler (Electron. J. Comb., 2018)

Gibbs partitions: The convergent case. - Benedikt Stufler (Random Struct. Algorithms, 2018)

Graph limits of random graphs from a subset of connected k-trees. - Michael Drmota; Emma Yu Jin; Benedikt Stufler (Random Struct. Algorithms, 2019)

Geometry of large Boltzmann outerplanar maps. - Sigurdur Örn Stefánsson; Benedikt Stufler (Random Struct. Algorithms, 2019)

The continuum random tree is the scaling limit of unlabeled unrooted trees. - Benedikt Stufler (Random Struct. Algorithms, 2019)

Graph limits of random unlabelled k-trees. - Emma Yu Jin; Benedikt Stufler (Comb. Probab. Comput., 2020)

Unlabelled Gibbs partitions. - Benedikt Stufler (Comb. Probab. Comput., 2020)

Asymptotic Properties of Random Unlabelled Block-Weighted Graphs. - Benedikt Stufler (Electron. J. Comb., 2021)

Graphon convergence of random cographs. - Benedikt Stufler (Random Struct. Algorithms, 2021)

A branching process approach to level-k phylogenetic networks. - Benedikt Stufler (Random Struct. Algorithms, 2022)

Cut Vertices in Random Planar Maps. - Michael Drmota; Marc Noy; Benedikt Stufler (Electron. J. Comb., 2023)

Exact-Size Sampling of Enriched Trees in Linear Time. - Konstantinos Panagiotou; Leon Ramzews; Benedikt Stufler (SIAM J. Comput., 2023)