2024
The birth of the strong components.
Random Struct. Algorithms, March, 2024
On the distribution of eigenvalues of increasing trees.
Discret. Math., February, 2024
Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees.
Electron. J. Comb., 2024
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study.
Proceedings of the 35th International Conference on Probabilistic, 2024
A Bijection for the Evolution of B-Trees.
Proceedings of the 35th International Conference on Probabilistic, 2024
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models.
Proceedings of the 35th International Conference on Probabilistic, 2024
Statistics of Parking Functions and Labeled Forests.
Proceedings of the 35th International Conference on Probabilistic, 2024
On the Number of Distinct Fringe Subtrees in Binary Search Trees.
Proceedings of the 35th International Conference on Probabilistic, 2024
2023
On the mean subtree order of trees under edge contraction.
J. Graph Theory, 2023
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$.
Electron. J. Comb., 2023
2022
Trees with minimum number of infima closed sets.
Discret. Math., 2022
Distinct Fringe Subtrees in Random Trees.
Algorithmica, 2022
Automorphisms of Random Trees.
Proceedings of the 33rd International Conference on Probabilistic, 2022
Uncovering a Random Tree.
Proceedings of the 33rd International Conference on Probabilistic, 2022
2021
On the probability that a random subtree is spanning.
J. Graph Theory, 2021
On the maximum mean subtree order of trees.
Eur. J. Comb., 2021
Extremal Trees with Fixed Degree Sequence.
Electron. J. Comb., 2021
Further results on the inducibility of $d$-ary trees.
Australas. J Comb., 2021
2020
The Average Size of Matchings in Graphs.
Graphs Comb., 2020
The number of distinct adjacent pairs in geometrically distributed words.
Discret. Math. Theor. Comput. Sci., 2020
On the distance spectral radius of trees with given degree sequence.
Discuss. Math. Graph Theory, 2020
Inducibility of d-ary trees.
Discret. Math., 2020
On the number of increasing trees with label repetitions.
Discret. Math., 2020
Matchings in graphs with a given number of cuts.
Discret. Appl. Math., 2020
A Central Limit Theorem for Almost Local Additive Tree Functionals.
Algorithmica, 2020
On the Collection of Fringe Subtrees in Random Binary Trees.
Proceedings of the LATIN 2020: Theoretical Informatics, 2020
On the Probability That a Random Digraph Is Acyclic.
Proceedings of the 31st International Conference on Probabilistic, 2020
Block Statistics in Subcritical Graph Classes.
Proceedings of the 31st International Conference on Probabilistic, 2020
2019
A tanglegram Kuratowski theorem.
J. Graph Theory, 2019
On the centroid of increasing trees.
Discret. Math. Theor. Comput. Sci., 2019
On the inducibility of small trees.
Discret. Math. Theor. Comput. Sci., 2019
A central limit theorem for additive functionals of increasing trees.
Comb. Probab. Comput., 2019
Reducing Simply Generated Trees by Iterative Leaf Cutting.
Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019
2018
Regularized Gaussian belief propagation.
Stat. Comput., 2018
On the Number of Nonisomorphic Subtrees of a Tree.
J. Graph Theory, 2018
Graphs with few total dominating sets.
Discret. Math., 2018
Subcritical Graph Classes Containing All Planar Graphs.
Comb. Probab. Comput., 2018
On the distribution of subtree orders of a tree.
Ars Math. Contemp., 2018
Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees.
Proceedings of the 29th International Conference on Probabilistic, 2018
Counting Planar Tanglegrams.
Proceedings of the 29th International Conference on Probabilistic, 2018
2017
On the distribution of betweenness centrality in random trees.
Theor. Comput. Sci., 2017
Inducibility in Binary Trees and Crossings in Random Tanglegrams.
SIAM J. Discret. Math., 2017
Hitting Times, Cover Cost, and the Wiener Index of a Tree.
J. Graph Theory, 2017
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number.
Graphs Comb., 2017
Extremal problems for trees with given segment sequence.
Discret. Appl. Math., 2017
On q-Quasiadditive and q-Quasimultiplicative Functions.
Electron. J. Comb., 2017
Paths vs. Stars in the Local Profile of Trees.
Electron. J. Comb., 2017
On the distribution of random walk hitting times in random trees.
Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017
2016
On the Local and Global Means of Subtree Orders.
J. Graph Theory, 2016
On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees.
Exp. Math., 2016
Compositions into Powers of b: Asymptotic Enumeration and Parameters.
Algorithmica, 2016
The shape of random tanglegrams.
Adv. Appl. Math., 2016
Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees.
Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016
Betweenness Centrality in Random Trees.
Proceedings of the Thirteenth Workshop on Analytic Algorithmics and Combinatorics, 2016
2015
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis.
SIAM J. Discret. Math., 2015
Enumeration of the adjunctive hierarchy of hereditarily finite sets.
J. Log. Comput., 2015
Variances and covariances in the Central Limit Theorem for the output of a transducer.
Eur. J. Comb., 2015
Bootstrapping and double-exponential limit laws.
Discret. Math. Theor. Comput. Sci., 2015
Counting subwords in flattened partitions of sets.
Discret. Math., 2015
Central Limit Theorems for Additive Tree Parameters with Small Toll Functions.
Comb. Probab. Comput., 2015
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics.
Comb. Probab. Comput., 2015
Locally Oriented Noncrossing Trees.
Electron. J. Comb., 2015
Repeated fringe subtrees in random rooted trees.
Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015
2014
Indistinguishable Trees and Graphs.
Graphs Comb., 2014
Graphs with maximal Hosoya index and minimal Merrifield-Simmons index.
Discret. Math., 2014
A General Asymptotic Scheme for the Analysis of Partition Statistics.
Comb. Probab. Comput., 2014
Enumeration Of Highly Balanced Trees.
Ars Comb., 2014
2013
Coupon collecting and transversals of hypergraphs.
Discret. Math. Theor. Comput. Sci., 2013
The Number of Fixed Points of Wilf's Partition Involution.
Electron. J. Comb., 2013
Greedy Trees, Subtrees and Antichains.
Electron. J. Comb., 2013
Asymptotic Enumeration of Extensional Acyclic Digraphs.
Algorithmica, 2013
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions.
Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013
2012
Decomposing the hypercube Q<sub>n</sub> into n isomorphic edge-disjoint trees.
Discret. Math., 2012
On the Wiener index of random trees.
Discret. Math., 2012
The matching energy of a graph.
Discret. Appl. Math., 2012
2011
On the number of independent subsets in trees with restricted degrees.
Math. Comput. Model., 2011
The number of maximum matchings in a tree.
Discret. Math., 2011
Labeled Trees, Functions, and an Algebraic Identity.
Electron. J. Comb., 2011
2010
Bijections for a class of labeled plane trees.
Eur. J. Comb., 2010
Enumeration of matchings in families of self-similar graphs.
Discret. Appl. Math., 2010
Deterministic Edge Weights in Increasing Tree Families.
Comb. Probab. Comput., 2010
On the Distribution of Depths in Increasing Trees.
Electron. J. Comb., 2010
Records in Set Partitions.
Electron. J. Comb., 2010
2009
An Asymptotic Independence Theorem for the Number of Matchings in Graphs.
Graphs Comb., 2009
On the parity of the Wiener index.
Eur. J. Comb., 2009
Some new results on distance-based graph invariants.
Eur. J. Comb., 2009
Asymptotic enumeration on self-similar graphs with two boundary vertices.
Discret. Math. Theor. Comput. Sci., 2009
Exact and asymptotic enumeration of perfect matchings in self-similar graphs.
Discret. Math., 2009
Molecular graphs and the inverse Wiener index problem.
Discret. Appl. Math., 2009
The inverse problem for certain tree parameters.
Discret. Appl. Math., 2009
Almost All Trees have an Even Number of Independent Sets.
Electron. J. Comb., 2009
2008
Maximizing the number of independent subsets over trees with bounded degree.
J. Graph Theory, 2008
Combinatorial properties of a general domination problem with parity constraints.
Discret. Math., 2008
The Distribution of Ascents of Size <i>d</i> or More in Partitions of <i>n</i>.
Comb. Probab. Comput., 2008
Subset Counting in Trees.
Ars Comb., 2008
2007
Correlation of Graph-Theoretical Indices.
SIAM J. Discret. Math., 2007
Enumeration problems for classes of self-similar graphs.
J. Comb. Theory A, 2007
On the number of matchings of a tree.
Eur. J. Comb., 2007
Graphs, partitions and Fibonacci numbers.
Discret. Appl. Math., 2007
On the average Wiener index of degree-restricted trees.
Australas. J Comb., 2007
2006
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups.
Electron. J. Comb., 2006
2005
Extremal Problems for Topological Indices in Combinatorial Chemistry.
J. Comput. Biol., 2005
