Random Records and Cuttings in Binary Search Trees. - Cecilia Holmgren (Comb. Probab. Comput., 2010)

Split Trees, Cuttings and Explosions. - Cecilia Holmgren (2010)

The total path length of split trees - Nicolas Broutin; Cecilia Holmgren (CoRR, 2011)

Counterexamples to a monotonicity conjecture for the threshold pebbling number. - Johan Björklund; Cecilia Holmgren (Discret. Math., 2012)

Majority Bootstrap Percolation on G(n, p). - Cecilia Holmgren; Tomas Juskevicius; Nathan Kettle (Electron. J. Comb., 2017)

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees. - Cecilia Holmgren; Svante Janson; Matas Sileikis (Electron. J. Comb., 2017)

The heavy path approach to Galton-Watson trees with an application to Apollonian networks. - Luc Devroye; Cecilia Holmgren; Henning Sulzbach (CoRR, 2017)

Permutations in Binary Trees and Split Trees. - Michael Albert 001; Cecilia Holmgren; Tony Johansson; Fiona Skerman (AofA, 2018)

Degree distributions of generalized hooking networks. - Colin Desmarais; Cecilia Holmgren (ANALCO, 2019)

k -cuts on a Path. - Xing Shi Cai; Luc Devroye; Cecilia Holmgren; Fiona Skerman (CIAC, 2019)

Cutting Resilient Networks - Complete Binary Trees. - Xing Shi Cai; Cecilia Holmgren (Electron. J. Comb., 2019)

Inversions in Split Trees and Conditional Galton-Watson Trees. - Xing Shi Cai; Cecilia Holmgren; Svante Janson; Tony Johansson; Fiona Skerman (Comb. Probab. Comput., 2019)

The k-Cut Model in Conditioned Galton-Watson Trees. - Gabriel Berzunza Ojeda; Xing Shi Cai; Cecilia Holmgren (AofA, 2020)

Largest Clusters for Supercritical Percolation on Split Trees. - Gabriel Berzunza Ojeda; Cecilia Holmgren (AofA, 2020)

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees. - Michael Albert 001; Cecilia Holmgren; Tony Johansson; Fiona Skerman (Algorithmica, 2020)

Normal Limit Laws for Vertex Degrees in Randomly Grown Hooking Networks and Bipolar Networks. - Colin Desmarais; Cecilia Holmgren (Electron. J. Comb., 2020)

Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey. - Cecilia Holmgren (DGMM, 2021)

The $k$-Cut Model in Deterministic and Random Trees. - Gabriel Berzunza Ojeda; Xing Shi Cai; Cecilia Holmgren (Electron. J. Comb., 2021)

A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees. - Michael Fuchs 001; Cecilia Holmgren; Dieter Mitsche; Ralph Neininger (Discret. Appl. Math., 2021)

Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees. - Gabriel Berzunza Ojeda; Cecilia Holmgren (AofA, 2022)

The asymptotic distribution of cluster sizes for supercritical percolation on random split trees. - Gabriel Berzunza; Cecilia Holmgren (Random Struct. Algorithms, 2022)

Broadcasting-induced colorings of preferential attachment trees. - Colin Desmarais; Cecilia Holmgren; Stephan Wagner (Random Struct. Algorithms, 2023)

Approximation of subgraph counts in the uniform attachment model. - Johan Björklund; Cecilia Holmgren; Svante Janson; Tiffany Y. Y. Lo (Comb. Probab. Comput., 2025)

Fringe Trees for Random Trees With Given Vertex Degrees. - Gabriel Berzunza Ojeda; Cecilia Holmgren; Svante Janson (Random Struct. Algorithms, 2025)