Stephan G. Wagner

Theor. Comput. Sci., 2026

Distribution of new statistics of parking functions and their generalizations.

[BibT_eX]

[DOI]

Catherine H. Yan

Mei Yin

Adv. Appl. Math., 2026

2024

The birth of the strong components.

[BibT_eX]

[DOI]

Sergey Dovgal

Élie de Panafieu

Vonjy Rasendrahasina

Random Struct. Algorithms, March, 2024

On the distribution of eigenvalues of increasing trees.

[BibT_eX]

[DOI]

Kennteth Dadedzi

Discret. Math., February, 2024

The distribution of the maximum protection number in simply generated trees.

[BibT_eX]

[DOI]

Sarah J. Selkirk

Comb. Probab. Comput., 2024

The Minimum Number of Maximal Independent Sets in Twin-Free Graphs.

[BibT_eX]

[DOI]

Stijn Cambie

Electron. J. Comb., 2024

Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2024

Subdiagonal and superdiagonal compositions.

[BibT_eX]

[DOI]

Art Discret. Appl. Math., 2024

Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study.

[BibT_eX]

[DOI]

Benjamin Hackl

Proceedings of the 35th International Conference on Probabilistic, 2024

A Bijection for the Evolution of B-Trees.

[BibT_eX]

[DOI]

Fabian Burghart

Proceedings of the 35th International Conference on Probabilistic, 2024

Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Probabilistic, 2024

Statistics of Parking Functions and Labeled Forests.

[BibT_eX]

[DOI]

Mei Yin

Proceedings of the 35th International Conference on Probabilistic, 2024

On the Number of Distinct Fringe Subtrees in Binary Search Trees.

[BibT_eX]

[DOI]

Proceedings of the 35th International Conference on Probabilistic, 2024

2023

On the mean subtree order of trees under edge contraction.

[BibT_eX]

[DOI]

J. Graph Theory, 2023

Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$.

[BibT_eX]

[DOI]

Sarah J. Selkirk

Electron. J. Comb., 2023

2022

Trees with minimum number of infima closed sets.

[BibT_eX]

[DOI]

Discret. Math., 2022

Distinct Fringe Subtrees in Random Trees.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Algorithmica, 2022

Automorphisms of Random Trees.

[BibT_eX]

[DOI]

Christoffer Olsson

Proceedings of the 33rd International Conference on Probabilistic, 2022

Uncovering a Random Tree.

[BibT_eX]

[DOI]

Benjamin Hackl

Alois Panholzer

Proceedings of the 33rd International Conference on Probabilistic, 2022

2021

On the probability that a random subtree is spanning.

[BibT_eX]

[DOI]

J. Graph Theory, 2021

On the maximum mean subtree order of trees.

[BibT_eX]

[DOI]

Stijn Cambie

Eur. J. Comb., 2021

Extremal Trees with Fixed Degree Sequence.

[BibT_eX]

[DOI]

Valisoa Razanajatovo Misanantenaina

Audace A. V. Dossou-Olory

Electron. J. Comb., 2021

Further results on the inducibility of $d$-ary trees.

[BibT_eX]

[DOI]

Australas. J Comb., 2021

2020

The Average Size of Matchings in Graphs.

[BibT_eX]

[DOI]

Valisoa Razanajatovo Misanantenaina

Graphs Comb., 2020

The number of distinct adjacent pairs in geometrically distributed words.

[BibT_eX]

[DOI]

Margaret Archibald

Aubrey Blecher

Charlotte A. C. Brennan

Valisoa Razanajatovo Misanantenaina

Mark Daniel Ward

Discret. Math. Theor. Comput. Sci., 2020

On the distance spectral radius of trees with given degree sequence.

[BibT_eX]

[DOI]

Kennteth Dadedzi

Discuss. Math. Graph Theory, 2020

Inducibility of d-ary trees.

[BibT_eX]

[DOI]

Audace A. V. Dossou-Olory

Discret. Math., 2020

On the number of increasing trees with label repetitions.

[BibT_eX]

[DOI]

Olivier Bodini

Antoine Genitrini

Bernhard Gittenberger

Discret. Math., 2020

Matchings in graphs with a given number of cuts.

[BibT_eX]

[DOI]

Jinfeng Liu

Fei Huang

Discret. Appl. Math., 2020

A Central Limit Theorem for Almost Local Additive Tree Functionals.

[BibT_eX]

[DOI]

Matas Sileikis

Algorithmica, 2020

On the Collection of Fringe Subtrees in Random Binary Trees.

[BibT_eX]

[DOI]

Louisa Seelbach Benkner

Proceedings of the LATIN 2020: Theoretical Informatics, 2020

On the Probability That a Random Digraph Is Acyclic.

[BibT_eX]

[DOI]

Vonjy Rasendrahasina

Proceedings of the 31st International Conference on Probabilistic, 2020

Block Statistics in Subcritical Graph Classes.

[BibT_eX]

[DOI]

Clément Requilé

Proceedings of the 31st International Conference on Probabilistic, 2020

2019

A tanglegram Kuratowski theorem.

[BibT_eX]

[DOI]

J. Graph Theory, 2019

On the centroid of increasing trees.

[BibT_eX]

[DOI]

Kevin Durant

Audace A. V. Dossou-Olory

Discret. Math. Theor. Comput. Sci., 2019

On the inducibility of small trees.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2019

A central limit theorem for additive functionals of increasing trees.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2019

Reducing Simply Generated Trees by Iterative Leaf Cutting.

[BibT_eX]

[DOI]

Benjamin Hackl

Proceedings of the Sixteenth Workshop on Analytic Algorithmics and Combinatorics, 2019

2018

Regularized Gaussian belief propagation.

[BibT_eX]

[DOI]

Stat. Comput., 2018

On the Number of Nonisomorphic Subtrees of a Tree.

[BibT_eX]

[DOI]

J. Graph Theory, 2018

Graphs with few total dominating sets.

[BibT_eX]

[DOI]

Marcin Krzywkowski

Discret. Math., 2018

Subcritical Graph Classes Containing All Planar Graphs.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

Comb. Probab. Comput., 2018

On the distribution of subtree orders of a tree.

[BibT_eX]

[DOI]

Ars Math. Contemp., 2018

Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees.

[BibT_eX]

[DOI]

Matas Sileikis

Proceedings of the 29th International Conference on Probabilistic, 2018

Counting Planar Tanglegrams.

[BibT_eX]

[DOI]

Jean Bernoulli Ravelomanana

Proceedings of the 29th International Conference on Probabilistic, 2018

2017

On the distribution of betweenness centrality in random trees.

[BibT_eX]

[DOI]

Kevin Durant

Theor. Comput. Sci., 2017

Inducibility in Binary Trees and Crossings in Random Tanglegrams.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2017

Hitting Times, Cover Cost, and the Wiener Index of a Tree.

[BibT_eX]

[DOI]

Agelos Georgakopoulos

J. Graph Theory, 2017

Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number.

[BibT_eX]

[DOI]

Florian Lehner

Graphs Comb., 2017

Extremal problems for trees with given segment sequence.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2017

On q-Quasiadditive and q-Quasimultiplicative Functions.

[BibT_eX]

[DOI]

Sara Kropf

Electron. J. Comb., 2017

Paths vs. Stars in the Local Profile of Trees.

[BibT_eX]

[DOI]

Electron. J. Comb., 2017

On the distribution of random walk hitting times in random trees.

[BibT_eX]

[DOI]

Joubert Oosthuizen

Proceedings of the Fourteenth Workshop on Analytic Algorithmics and Combinatorics, 2017

2016

On the Local and Global Means of Subtree Orders.

[BibT_eX]

[DOI]

J. Graph Theory, 2016

On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees.

[BibT_eX]

[DOI]

Mohan Gopaladesikan

Mark Daniel Ward

Exp. Math., 2016

Compositions into Powers of b: Asymptotic Enumeration and Parameters.

[BibT_eX]

[DOI]

Daniel Krenn

Algorithmica, 2016

The shape of random tanglegrams.

[BibT_eX]

[DOI]

Matjaz Konvalinka

Adv. Appl. Math., 2016

Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees.

[BibT_eX]

[DOI]

Milan Bradonjic

Proceedings of the Algorithms and Models for the Web Graph - 13th International Workshop, 2016

Betweenness Centrality in Random Trees.

[BibT_eX]

[DOI]

Kevin Durant

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.

[BibT_eX]

[DOI]

Daniel Krenn

SIAM J. Discret. Math., 2015

Enumeration of the adjunctive hierarchy of hereditarily finite sets.

[BibT_eX]

[DOI]

Giorgio Audrito

Alexandru I. Tomescu

J. Log. Comput., 2015

Variances and covariances in the Central Limit Theorem for the output of a transducer.

[BibT_eX]

[DOI]

Sara Kropf

Eur. J. Comb., 2015

Bootstrapping and double-exponential limit laws.

[BibT_eX]

[DOI]

Helmut Prodinger

Discret. Math. Theor. Comput. Sci., 2015

Counting subwords in flattened partitions of sets.

[BibT_eX]

[DOI]

Toufik Mansour

Mark Shattuck

Discret. Math., 2015

Central Limit Theorems for Additive Tree Parameters with Small Toll Functions.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics.

[BibT_eX]

[DOI]

Comb. Probab. Comput., 2015

Locally Oriented Noncrossing Trees.

[BibT_eX]

[DOI]

Isaac Owino Okoth

Electron. J. Comb., 2015

Repeated fringe subtrees in random rooted trees.

[BibT_eX]

[DOI]

Proceedings of the Twelfth Workshop on Analytic Algorithmics and Combinatorics, 2015

2014

Indistinguishable Trees and Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2014

Graphs with maximal Hosoya index and minimal Merrifield-Simmons index.

[BibT_eX]

[DOI]

Zhongxun Zhu

Cao Yuan

Discret. Math., 2014

A General Asymptotic Scheme for the Analysis of Partition Statistics.

[BibT_eX]

[DOI]

Peter J. Grabner

Comb. Probab. Comput., 2014

Enumeration Of Highly Balanced Trees.

[BibT_eX]

Ars Comb., 2014

2013

Coupon collecting and transversals of hypergraphs.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2013

The Number of Fixed Points of Wilf's Partition Involution.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Greedy Trees, Subtrees and Antichains.

[BibT_eX]

[DOI]

Electron. J. Comb., 2013

Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions.

[BibT_eX]

[DOI]

Daniel Krenn

Proceedings of the 10th Meeting on Analytic Algorithmics and Combinatorics, 2013

2012

Decomposing the hypercube Qn into n isomorphic edge-disjoint trees.

[BibT_eX]

[DOI]

Marcel Wild

Discret. Math., 2012

On the Wiener index of random trees.

[BibT_eX]

[DOI]

Discret. Math., 2012

The matching energy of a graph.

[BibT_eX]

[DOI]

Ivan Gutman

Discret. Appl. Math., 2012

Asymptotic Enumeration of Extensional Acyclic Digraphs.

[BibT_eX]

[DOI]

Proceedings of the 9th Meeting on Analytic Algorithmics and Combinatorics, 2012

2011

On the number of independent subsets in trees with restricted degrees.

[BibT_eX]

[DOI]

Math. Comput. Model., 2011

Unfair permutations.

[BibT_eX]

[DOI]

Helmut Prodinger

Carsten Schneider

Eur. J. Comb., 2011

The number of maximum matchings in a tree.

[BibT_eX]

[DOI]

Discret. Math., 2011

Labeled Trees, Functions, and an Algebraic Identity.

[BibT_eX]

[DOI]

Electron. J. Comb., 2011

2010

Bijections for a class of labeled plane trees.

[BibT_eX]

[DOI]

Nancy S. S. Gu

Helmut Prodinger

Eur. J. Comb., 2010

Enumeration of matchings in families of self-similar graphs.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2010

Deterministic Edge Weights in Increasing Tree Families.

[BibT_eX]

[DOI]

Markus Kuba

Comb. Probab. Comput., 2010

On the Distribution of Depths in Increasing Trees.

[BibT_eX]

[DOI]

Markus Kuba

Electron. J. Comb., 2010

Records in Set Partitions.

[BibT_eX]

[DOI]

Toufik Mansour

Electron. J. Comb., 2010

2009

An Asymptotic Independence Theorem for the Number of Matchings in Graphs.

[BibT_eX]

[DOI]

Graphs Comb., 2009

On the parity of the Wiener index.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Some new results on distance-based graph invariants.

[BibT_eX]

[DOI]

Eur. J. Comb., 2009

Asymptotic enumeration on self-similar graphs with two boundary vertices.

[BibT_eX]

[DOI]

Discret. Math. Theor. Comput. Sci., 2009

Exact and asymptotic enumeration of perfect matchings in self-similar graphs.

[BibT_eX]

[DOI]

Discret. Math., 2009

Molecular graphs and the inverse Wiener index problem.

[BibT_eX]

[DOI]

Gang Yu

Discret. Appl. Math., 2009

The inverse problem for certain tree parameters.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2009

Almost All Trees have an Even Number of Independent Sets.

[BibT_eX]

[DOI]

Electron. J. Comb., 2009

2008

Maximizing the number of independent subsets over trees with bounded degree.

[BibT_eX]

[DOI]

J. Graph Theory, 2008

Combinatorial properties of a general domination problem with parity constraints.

[BibT_eX]

[DOI]

Johannes Hatzl

Discret. Math., 2008

The Distribution of Ascents of Size d or More in Partitions of n.

[BibT_eX]

[DOI]

Charlotte A. C. Brennan

Comb. Probab. Comput., 2008

Subset Counting in Trees.

[BibT_eX]

Ars Comb., 2008

2007

Correlation of Graph-Theoretical Indices.

[BibT_eX]

[DOI]

SIAM J. Discret. Math., 2007

Enumeration problems for classes of self-similar graphs.

[BibT_eX]

[DOI]

J. Comb. Theory A, 2007

On the number of matchings of a tree.

[BibT_eX]

[DOI]

Eur. J. Comb., 2007

Graphs, partitions and Fibonacci numbers.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2007

On the average Wiener index of degree-restricted trees.

[BibT_eX]

[DOI]

Australas. J Comb., 2007

2006

On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups.

[BibT_eX]

[DOI]

Electron. J. Comb., 2006

2005

Extremal Problems for Topological Indices in Combinatorial Chemistry.

[BibT_eX]

[DOI]

Robert F. Tichy