Extremal Problems for Topological Indices in Combinatorial Chemistry. - Robert F. Tichy; Stephan G. Wagner (J. Comput. Biol., 2005)

On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups. - Stephan G. Wagner (Electron. J. Comb., 2006)

On the average Wiener index of degree-restricted trees. - Stephan G. Wagner (Australas. J Comb., 2007)

Graphs, partitions and Fibonacci numbers. - Arnold Knopfmacher; Robert F. Tichy; Stephan G. Wagner; Volker Ziegler (Discret. Appl. Math., 2007)

On the number of matchings of a tree. - Stephan G. Wagner (Eur. J. Comb., 2007)

Enumeration problems for classes of self-similar graphs. - Elmar Teufl; Stephan G. Wagner (J. Comb. Theory A, 2007)

Correlation of Graph-Theoretical Indices. - Stephan G. Wagner (SIAM J. Discret. Math., 2007)

Subset Counting in Trees. - Stephan G. Wagner (Ars Comb., 2008)

The Distribution of Ascents of Size d or More in Partitions of n. - Charlotte A. C. Brennan; Arnold Knopfmacher; Stephan G. Wagner (Comb. Probab. Comput., 2008)

Combinatorial properties of a general domination problem with parity constraints. - Johannes Hatzl; Stephan G. Wagner (Discret. Math., 2008)

Maximizing the number of independent subsets over trees with bounded degree. - Clemens Heuberger; Stephan G. Wagner (J. Graph Theory, 2008)

Almost All Trees have an Even Number of Independent Sets. - Stephan G. Wagner (Electron. J. Comb., 2009)

The inverse problem for certain tree parameters. - Éva Czabarka; László A. Székely; Stephan G. Wagner (Discret. Appl. Math., 2009)

Molecular graphs and the inverse Wiener index problem. - Stephan G. Wagner; Hua Wang 003; Gang Yu (Discret. Appl. Math., 2009)

Exact and asymptotic enumeration of perfect matchings in self-similar graphs. - Elmar Teufl; Stephan G. Wagner (Discret. Math., 2009)

Asymptotic enumeration on self-similar graphs with two boundary vertices. - Elmar Teufl; Stephan G. Wagner (Discret. Math. Theor. Comput. Sci., 2009)

Some new results on distance-based graph invariants. - M. H. Khalifeh; Hassan Yousefi-Azari; A. R. Ashrafi; Stephan G. Wagner (Eur. J. Comb., 2009)

On the parity of the Wiener index. - Stephan G. Wagner; Hua Wang 003 (Eur. J. Comb., 2009)

An Asymptotic Independence Theorem for the Number of Matchings in Graphs. - Elmar Teufl; Stephan G. Wagner (Graphs Comb., 2009)

Records in Set Partitions. - Arnold Knopfmacher; Toufik Mansour; Stephan G. Wagner (Electron. J. Comb., 2010)

On the Distribution of Depths in Increasing Trees. - Markus Kuba; Stephan G. Wagner (Electron. J. Comb., 2010)

Deterministic Edge Weights in Increasing Tree Families. - Markus Kuba; Stephan G. Wagner (Comb. Probab. Comput., 2010)

Enumeration of matchings in families of self-similar graphs. - Elmar Teufl; Stephan G. Wagner (Discret. Appl. Math., 2010)

Bijections for a class of labeled plane trees. - Nancy S. S. Gu; Helmut Prodinger; Stephan G. Wagner (Eur. J. Comb., 2010)

Labeled Trees, Functions, and an Algebraic Identity. - Stephan G. Wagner (Electron. J. Comb., 2011)

The number of maximum matchings in a tree. - Clemens Heuberger; Stephan G. Wagner (Discret. Math., 2011)

Unfair permutations. - Helmut Prodinger; Carsten Schneider; Stephan G. Wagner (Eur. J. Comb., 2011)

On the number of independent subsets in trees with restricted degrees. - Eric Ould Dadah Andriantiana; Stephan G. Wagner (Math. Comput. Model., 2011)

The matching energy of a graph. - Ivan Gutman; Stephan G. Wagner (Discret. Appl. Math., 2012)

On the Wiener index of random trees. - Stephan G. Wagner (Discret. Math., 2012)

Decomposing the hypercube Qn into n isomorphic edge-disjoint trees. - Stephan G. Wagner; Marcel Wild (Discret. Math., 2012)

Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. - Clemens Heuberger; Daniel Krenn; Stephan G. Wagner (ANALCO, 2013)

Asymptotic Enumeration of Extensional Acyclic Digraphs. - Stephan G. Wagner (Algorithmica, 2013)

Greedy Trees, Subtrees and Antichains. - Eric Ould Dadah Andriantiana; Stephan G. Wagner; Hua Wang 003 (Electron. J. Comb., 2013)

The Number of Fixed Points of Wilf's Partition Involution. - Stephan G. Wagner (Electron. J. Comb., 2013)

Coupon collecting and transversals of hypergraphs. - Marcel Wild; Svante Janson; Stephan G. Wagner; Dirk Laurie (Discret. Math. Theor. Comput. Sci., 2013)

Enumeration Of Highly Balanced Trees. - Stephan G. Wagner (Ars Comb., 2014)

A General Asymptotic Scheme for the Analysis of Partition Statistics. - Peter J. Grabner; Arnold Knopfmacher; Stephan G. Wagner (Comb. Probab. Comput., 2014)

Graphs with maximal Hosoya index and minimal Merrifield-Simmons index. - Zhongxun Zhu; Cao Yuan; Eric Ould Dadah Andriantiana; Stephan G. Wagner (Discret. Math., 2014)

Indistinguishable Trees and Graphs. - Stephan G. Wagner; Hua Wang 003 (Graphs Comb., 2014)

Repeated fringe subtrees in random rooted trees. - Dimbinaina Ralaivaosaona; Stephan G. Wagner (ANALCO, 2015)

Locally Oriented Noncrossing Trees. - Isaac Owino Okoth; Stephan G. Wagner (Electron. J. Comb., 2015)

Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics. - Jeffrey Gaither; Guy Louchard; Stephan G. Wagner; Mark Daniel Ward (Comb. Probab. Comput., 2015)

Central Limit Theorems for Additive Tree Parameters with Small Toll Functions. - Stephan G. Wagner (Comb. Probab. Comput., 2015)

Counting subwords in flattened partitions of sets. - Toufik Mansour; Mark Shattuck 001; Stephan G. Wagner (Discret. Math., 2015)

Bootstrapping and double-exponential limit laws. - Helmut Prodinger; Stephan G. Wagner (Discret. Math. Theor. Comput. Sci., 2015)

Variances and covariances in the Central Limit Theorem for the output of a transducer. - Clemens Heuberger; Sara Kropf; Stephan G. Wagner (Eur. J. Comb., 2015)

Enumeration of the adjunctive hierarchy of hereditarily finite sets. - Giorgio Audrito; Alexandru I. Tomescu; Stephan G. Wagner (J. Log. Comput., 2015)

Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis. - Clemens Heuberger; Daniel Krenn; Stephan G. Wagner (SIAM J. Discret. Math., 2015)

Betweenness Centrality in Random Trees. - Kevin Durant; Stephan Wagner 003 (ANALCO, 2016)

Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees. - Milan Bradonjic; Stephan Wagner 003 (WAW, 2016)

The shape of random tanglegrams. - Matjaz Konvalinka; Stephan Wagner 003 (Adv. Appl. Math., 2016)

Compositions into Powers of b: Asymptotic Enumeration and Parameters. - Daniel Krenn; Stephan G. Wagner (Algorithmica, 2016)

On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees. - Mohan Gopaladesikan; Stephan G. Wagner; Mark Daniel Ward (Exp. Math., 2016)

On the Local and Global Means of Subtree Orders. - Stephan G. Wagner; Hua Wang 003 (J. Graph Theory, 2016)

On the distribution of random walk hitting times in random trees. - Joubert Oosthuizen; Stephan Wagner 003 (ANALCO, 2017)

Paths vs. Stars in the Local Profile of Trees. - Éva Czabarka; László A. Székely; Stephan G. Wagner (Electron. J. Comb., 2017)

On q-Quasiadditive and q-Quasimultiplicative Functions. - Sara Kropf; Stephan G. Wagner (Electron. J. Comb., 2017)

Extremal problems for trees with given segment sequence. - Eric Ould Dadah Andriantiana; Stephan G. Wagner; Hua Wang 003 (Discret. Appl. Math., 2017)

Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. - Florian Lehner; Stephan Wagner 003 (Graphs Comb., 2017)

Hitting Times, Cover Cost, and the Wiener Index of a Tree. - Agelos Georgakopoulos; Stephan Wagner 003 (J. Graph Theory, 2017)

Inducibility in Binary Trees and Crossings in Random Tanglegrams. - Éva Czabarka; László A. Székely; Stephan G. Wagner (SIAM J. Discret. Math., 2017)

On the distribution of betweenness centrality in random trees. - Kevin Durant; Stephan Wagner 003 (Theor. Comput. Sci., 2017)

Counting Planar Tanglegrams. - Dimbinaina Ralaivaosaona; Jean Bernoulli Ravelomanana; Stephan G. Wagner (AofA, 2018)

Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees. - Dimbinaina Ralaivaosaona; Matas Sileikis; Stephan G. Wagner (AofA, 2018)

On the distribution of subtree orders of a tree. - Dimbinaina Ralaivaosaona; Stephan G. Wagner (Ars Math. Contemp., 2018)

Subcritical Graph Classes Containing All Planar Graphs. - Agelos Georgakopoulos; Stephan Wagner 003 (Comb. Probab. Comput., 2018)

Graphs with few total dominating sets. - Marcin Krzywkowski; Stephan G. Wagner (Discret. Math., 2018)

On the Number of Nonisomorphic Subtrees of a Tree. - Éva Czabarka; László A. Székely; Stephan G. Wagner (J. Graph Theory, 2018)

Regularized Gaussian belief propagation. - Francois Kamper; Johan A. du Preez; Sarel Steel; Stephan Wagner 003 (Stat. Comput., 2018)

Reducing Simply Generated Trees by Iterative Leaf Cutting. - Benjamin Hackl; Clemens Heuberger; Stephan G. Wagner (ANALCO, 2019)

A central limit theorem for additive functionals of increasing trees. - Dimbinaina Ralaivaosaona; Stephan G. Wagner (Comb. Probab. Comput., 2019)

On the inducibility of small trees. - Audace A. V. Dossou-Olory; Stephan Wagner 003 (Discret. Math. Theor. Comput. Sci., 2019)

On the centroid of increasing trees. - Kevin Durant; Stephan G. Wagner (Discret. Math. Theor. Comput. Sci., 2019)

A tanglegram Kuratowski theorem. - Éva Czabarka; László A. Székely; Stephan G. Wagner (J. Graph Theory, 2019)

Block Statistics in Subcritical Graph Classes. - Dimbinaina Ralaivaosaona; Clément Requilé; Stephan Wagner 003 (AofA, 2020)

On the Probability That a Random Digraph Is Acyclic. - Dimbinaina Ralaivaosaona; Vonjy Rasendrahasina; Stephan Wagner 003 (AofA, 2020)

On the Collection of Fringe Subtrees in Random Binary Trees. - Louisa Seelbach Benkner; Stephan G. Wagner (LATIN, 2020)

A Central Limit Theorem for Almost Local Additive Tree Functionals. - Dimbinaina Ralaivaosaona; Matas Sileikis; Stephan G. Wagner (Algorithmica, 2020)

Matchings in graphs with a given number of cuts. - Jinfeng Liu; Fei Huang 007; Stephan Wagner 003 (Discret. Appl. Math., 2020)

On the number of increasing trees with label repetitions. - Olivier Bodini; Antoine Genitrini; Bernhard Gittenberger; Stephan Wagner 003 (Discret. Math., 2020)

Inducibility of d-ary trees. - Éva Czabarka; Audace A. V. Dossou-Olory; László A. Székely; Stephan G. Wagner (Discret. Math., 2020)

On the distance spectral radius of trees with given degree sequence. - Kennteth Dadedzi; Valisoa Razanajatovo Misanantenaina; Stephan G. Wagner (Discuss. Math. Graph Theory, 2020)

The number of distinct adjacent pairs in geometrically distributed words. - Margaret Archibald; Aubrey Blecher; Charlotte A. C. Brennan; Arnold Knopfmacher; Stephan Wagner 003; Mark Daniel Ward (Discret. Math. Theor. Comput. Sci., 2020)

The Average Size of Matchings in Graphs. - Eric Ould Dadah Andriantiana; Valisoa Razanajatovo Misanantenaina; Stephan Wagner 003 (Graphs Comb., 2020)

Further results on the inducibility of $d$-ary trees. - Audace A. V. Dossou-Olory; Stephan Wagner 003 (Australas. J Comb., 2021)

Extremal Trees with Fixed Degree Sequence. - Eric Ould Dadah Andriantiana; Valisoa Razanajatovo Misanantenaina; Stephan Wagner 003 (Electron. J. Comb., 2021)

On the maximum mean subtree order of trees. - Stijn Cambie; Stephan Wagner 003; Hua Wang 003 (Eur. J. Comb., 2021)

On the probability that a random subtree is spanning. - Stephan G. Wagner (J. Graph Theory, 2021)

Uncovering a Random Tree. - Benjamin Hackl; Alois Panholzer; Stephan Wagner 003 (AofA, 2022)

Automorphisms of Random Trees. - Christoffer Olsson; Stephan Wagner 003 (AofA, 2022)

Distinct Fringe Subtrees in Random Trees. - Louisa Seelbach Benkner; Stephan G. Wagner (Algorithmica, 2022)

Trees with minimum number of infima closed sets. - Eric Ould Dadah Andriantiana; Stephan Wagner 003 (Discret. Math., 2022)

Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$. - Clemens Heuberger; Sarah J. Selkirk; Stephan G. Wagner (Electron. J. Comb., 2023)

On the mean subtree order of trees under edge contraction. - Zuwen Luo; Kexiang Xu; Stephan G. Wagner; Hua Wang 003 (J. Graph Theory, 2023)

On the Number of Distinct Fringe Subtrees in Binary Search Trees. - Stephan Wagner 003 (AofA, 2024)

Statistics of Parking Functions and Labeled Forests. - Stephan Wagner 003; Mei Yin (AofA, 2024)

Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. - Cyril Banderier; Markus Kuba; Stephan Wagner 003; Michael Wallner 001 (AofA, 2024)

A Bijection for the Evolution of B-Trees. - Fabian Burghart; Stephan Wagner 003 (AofA, 2024)

Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. - Benjamin Hackl; Stephan Wagner 003 (AofA, 2024)

Subdiagonal and superdiagonal compositions. - Margaret Archibald; Aubrey Blecher; Arnold Knopfmacher; Stephan Wagner 003 (Art Discret. Appl. Math., 2024)

Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees. - Stijn Cambie; Bradley McCoy; Stephan G. Wagner; Corrine Yap (Electron. J. Comb., 2024)

The Minimum Number of Maximal Independent Sets in Twin-Free Graphs. - Stijn Cambie; Stephan G. Wagner (Electron. J. Comb., 2024)

The distribution of the maximum protection number in simply generated trees. - Clemens Heuberger; Sarah J. Selkirk; Stephan Wagner 003 (Comb. Probab. Comput., 2024)

On the distribution of eigenvalues of increasing trees. - Kennteth Dadedzi; Stephan G. Wagner (Discret. Math., 2024)

The birth of the strong components. - Sergey Dovgal; Élie de Panafieu; Dimbinaina Ralaivaosaona; Vonjy Rasendrahasina; Stephan G. Wagner (Random Struct. Algorithms, 2024)