Cecilia Holmgren

Orcid: 0000-0003-0717-4671

According to our database1, Cecilia Holmgren authored at least 22 papers between 2010 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2024
Fringe Trees for Random Trees with Given Vertex Degrees.
Proceedings of the 35th International Conference on Probabilistic, 2024

2023
Broadcasting-induced colorings of preferential attachment trees.
Random Struct. Algorithms, September, 2023

2022
The asymptotic distribution of cluster sizes for supercritical percolation on random split trees.
Random Struct. Algorithms, 2022

Fragmentation Processes Derived from Conditioned Stable Galton-Watson Trees.
Proceedings of the 33rd International Conference on Probabilistic, 2022

2021
A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees.
Discret. Appl. Math., 2021

The $k$-Cut Model in Deterministic and Random Trees.
Electron. J. Comb., 2021

Split Trees - A Unifying Model for Many Important Random Trees of Logarithmic Height: A Brief Survey.
Proceedings of the Discrete Geometry and Mathematical Morphology, 2021

2020
Normal Limit Laws for Vertex Degrees in Randomly Grown Hooking Networks and Bipolar Networks.
Electron. J. Comb., 2020

Embedding Small Digraphs and Permutations in Binary Trees and Split Trees.
Algorithmica, 2020

Largest Clusters for Supercritical Percolation on Split Trees.
Proceedings of the 31st International Conference on Probabilistic, 2020

The k-Cut Model in Conditioned Galton-Watson Trees.
Proceedings of the 31st International Conference on Probabilistic, 2020

2019
Inversions in Split Trees and Conditional Galton-Watson Trees.
Comb. Probab. Comput., 2019

Cutting Resilient Networks - Complete Binary Trees.
Electron. J. Comb., 2019

k -cuts on a Path.
Proceedings of the Algorithms and Complexity - 11th International Conference, 2019

Degree distributions of generalized hooking networks.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018
Permutations in Binary Trees and Split Trees.
Proceedings of the 29th International Conference on Probabilistic, 2018

2017
The heavy path approach to Galton-Watson trees with an application to Apollonian networks.
CoRR, 2017

Multivariate Normal Limit Laws for the Numbers of Fringe Subtrees in m-ary Search Trees and Preferential Attachment Trees.
Electron. J. Comb., 2017

Majority Bootstrap Percolation on G(n, p).
Electron. J. Comb., 2017

2012
Counterexamples to a monotonicity conjecture for the threshold pebbling number.
Discret. Math., 2012

2011
The total path length of split trees
CoRR, 2011

2010
Random Records and Cuttings in Binary Search Trees.
Comb. Probab. Comput., 2010


  Loading...