default search action
Stephan G. Wagner
Stephan Wagner 0003
Person information
- affiliation: Stellenbosch University, Department of Mathematical Sciences, South Africa
- affiliation (former): Graz University of Technology, Department of Mathematics, Austria
Other persons with the same name
- Stephan Wagner — disambiguation page
- Stephan Wagner 0001 — University of Duisburg-Essen, Department of Computer Science
- Stephan Wagner 0002 — Multimedia Kontor Hamburg GmbH
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [j85]Stijn Cambie
, Bradley McCoy, Stephan G. Wagner, Corrine Yap:
Bounding Mean Orders of Sub-$k$-Trees of $k$-Trees. Electron. J. Comb. 31(1) (2024) - [j84]Kennteth Dadedzi, Stephan G. Wagner
On the distribution of eigenvalues of increasing trees. Discret. Math. 347(2): 113762 (2024) - [j83]Sergey Dovgal, Élie de Panafieu
The birth of the strong components. Random Struct. Algorithms 64(2): 170-266 (2024) - [c19]Cyril Banderier, Markus Kuba, Stephan Wagner, Michael Wallner:
Composition Schemes: q-Enumerations and Phase Transitions in Gibbs Models. AofA 2024: 7:1-7:18 - [c18]Fabian Burghart, Stephan Wagner:
A Bijection for the Evolution of B-Trees. AofA 2024: 10:1-10:15 - [c17]Stephan Wagner:
On the Number of Distinct Fringe Subtrees in Binary Search Trees. AofA 2024: 13:1-13:11 - [c16]Benjamin Hackl
Binomial Sums and Mellin Asymptotics with Explicit Error Bounds: A Case Study. AofA 2024: 19:1-19:15 - [c15]Stephan Wagner, Mei Yin:
Statistics of Parking Functions and Labeled Forests. AofA 2024: 29:1-29:14 - [i5]Benjamin Hackl, Stephan G. Wagner:
Binomial sums and Mellin asymptotics with explicit error bounds: a case study. CoRR abs/2403.09408 (2024) - [i4]Fabian Burghart, Stephan Wagner:
A bijection for the evolution of B-trees. CoRR abs/2406.06359 (2024) - 2023
- [j82]Clemens Heuberger, Sarah J. Selkirk
Enumeration of Generalized Dyck Paths Based on the Height of Down-Steps Modulo $k$. Electron. J. Comb. 30(1) (2023) - [j81]Zuwen Luo
On the mean subtree order of trees under edge contraction. J. Graph Theory 102(3): 535-551 (2023) - 2022
- [j80]Louisa Seelbach Benkner
Distinct Fringe Subtrees in Random Trees. Algorithmica 84(12): 3686-3728 (2022) - [j79]Eric Ould Dadah Andriantiana
Trees with minimum number of infima closed sets. Discret. Math. 345(5): 112793 (2022) - [c14]Benjamin Hackl
Uncovering a Random Tree. AofA 2022: 10:1-10:17 - [c13]Christoffer Olsson, Stephan Wagner:
Automorphisms of Random Trees. AofA 2022: 16:1-16:16 - 2021
- [j78]Audace A. V. Dossou-Olory, Stephan Wagner:
Further results on the inducibility of $d$-ary trees. Australas. J Comb. 81: 1-24 (2021) - [j77]Eric Ould Dadah Andriantiana
Extremal Trees with Fixed Degree Sequence. Electron. J. Comb. 28(1): 1 (2021) - [j76]Stijn Cambie
On the maximum mean subtree order of trees. Eur. J. Comb. 97: 103388 (2021) - [j75]Stephan G. Wagner
On the probability that a random subtree is spanning. J. Graph Theory 98(2): 195-215 (2021) - [i3]Louisa Seelbach Benkner, Stephan G. Wagner:
Distinct Fringe Subtrees in Random Trees. CoRR abs/2105.04231 (2021) - 2020
- [j74]Dimbinaina Ralaivaosaona
A Central Limit Theorem for Almost Local Additive Tree Functionals. Algorithmica 82(3): 642-679 (2020) - [j73]Jinfeng Liu, Fei Huang, Stephan Wagner:
Matchings in graphs with a given number of cuts. Discret. Appl. Math. 283: 473-481 (2020) - [j72]Éva Czabarka
Inducibility of d-ary trees. Discret. Math. 343(2): 111671 (2020) - [j71]Olivier Bodini, Antoine Genitrini, Bernhard Gittenberger
On the number of increasing trees with label repetitions. Discret. Math. 343(8): 111722 (2020) - [j70]Kennteth Dadedzi, Valisoa Razanajatovo Misanantenaina
On the distance spectral radius of trees with given degree sequence. Discuss. Math. Graph Theory 40(2): 495-524 (2020) - [j69]Margaret Archibald
The number of distinct adjacent pairs in geometrically distributed words. Discret. Math. Theor. Comput. Sci. 22(4) (2020) - [j68]Eric Ould Dadah Andriantiana
The Average Size of Matchings in Graphs. Graphs Comb. 36(3): 539-560 (2020) - [c12]Dimbinaina Ralaivaosaona, Clément Requilé
Block Statistics in Subcritical Graph Classes. AofA 2020: 24:1-24:14 - [c11]Dimbinaina Ralaivaosaona
On the Probability That a Random Digraph Is Acyclic. AofA 2020: 25:1-25:18 - [c10]Louisa Seelbach Benkner, Stephan G. Wagner
On the Collection of Fringe Subtrees in Random Binary Trees. LATIN 2020: 546-558 - [i2]Louisa Seelbach Benkner, Stephan Wagner:
On the Collection of Fringe Subtrees in Random Binary Trees. CoRR abs/2003.03323 (2020) - [i1]Élie de Panafieu, Sergey Dovgal, Dimbinaina Ralaivaosaona, Vonjy Rasendrahasina, Stephan G. Wagner:
The birth of the strong components. CoRR abs/2009.12127 (2020)
2010 – 2019
- 2019
- [j67]Dimbinaina Ralaivaosaona
A central limit theorem for additive functionals of increasing trees. Comb. Probab. Comput. 28(4): 618-637 (2019) - [j66]Audace A. V. Dossou-Olory, Stephan Wagner:
On the inducibility of small trees. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j65]Kevin Durant, Stephan G. Wagner:
On the centroid of increasing trees. Discret. Math. Theor. Comput. Sci. 21(4) (2019) - [j64]Éva Czabarka
A tanglegram Kuratowski theorem. J. Graph Theory 90(2): 111-122 (2019) - [c9]Benjamin Hackl
Reducing Simply Generated Trees by Iterative Leaf Cutting. ANALCO 2019: 36-44 - 2018
- [j63]Dimbinaina Ralaivaosaona, Stephan G. Wagner:
On the distribution of subtree orders of a tree. Ars Math. Contemp. 14(1): 129-156 (2018) - [j62]Agelos Georgakopoulos, Stephan Wagner:
Subcritical Graph Classes Containing All Planar Graphs. Comb. Probab. Comput. 27(5): 763-773 (2018) - [j61]Marcin Krzywkowski, Stephan G. Wagner
Graphs with few total dominating sets. Discret. Math. 341(4): 997-1009 (2018) - [j60]Éva Czabarka
On the Number of Nonisomorphic Subtrees of a Tree. J. Graph Theory 87(1): 89-95 (2018) - [j59]Francois Kamper
Regularized Gaussian belief propagation. Stat. Comput. 28(3): 653-672 (2018) - [c8]Dimbinaina Ralaivaosaona
Counting Planar Tanglegrams. AofA 2018: 32:1-32:18 - [c7]Dimbinaina Ralaivaosaona, Matas Sileikis
Asymptotic Normality of Almost Local Functionals in Conditioned Galton-Watson Trees. AofA 2018: 33:1-33:17 - [e1]Markus E. Nebel, Stephan G. Wagner:
Proceedings of the Fifteenth Workshop on Analytic Algorithmics and Combinatorics, ANALCO 2018, New Orleans, LA, USA, January 8-9, 2018. SIAM 2018, ISBN 978-1-61197-506-2 [contents] - 2017
- [j58]Éva Czabarka, László A. Székely, Stephan G. Wagner:
Paths vs. Stars in the Local Profile of Trees. Electron. J. Comb. 24(1): 1 (2017) - [j57]Sara Kropf, Stephan G. Wagner:
On q-Quasiadditive and q-Quasimultiplicative Functions. Electron. J. Comb. 24(1): 1 (2017) - [j56]Eric Ould Dadah Andriantiana
Extremal problems for trees with given segment sequence. Discret. Appl. Math. 220: 20-34 (2017) - [j55]Florian Lehner
Maximizing the Number of Independent Sets of Fixed Size in Connected Graphs with Given Independence Number. Graphs Comb. 33(5): 1103-1118 (2017) - [j54]Agelos Georgakopoulos, Stephan Wagner:
Hitting Times, Cover Cost, and the Wiener Index of a Tree. J. Graph Theory 84(3): 311-326 (2017) - [j53]Éva Czabarka
Inducibility in Binary Trees and Crossings in Random Tanglegrams. SIAM J. Discret. Math. 31(3): 1732-1750 (2017) - [j52]Kevin Durant, Stephan Wagner
On the distribution of betweenness centrality in random trees. Theor. Comput. Sci. 699: 33-52 (2017) - [c6]Joubert Oosthuizen, Stephan Wagner:
On the distribution of random walk hitting times in random trees. ANALCO 2017: 73-84 - 2016
- [j51]Matjaz Konvalinka
The shape of random tanglegrams. Adv. Appl. Math. 78: 76-93 (2016) - [j50]Daniel Krenn
Compositions into Powers of b: Asymptotic Enumeration and Parameters. Algorithmica 75(4): 606-631 (2016) - [j49]Mohan Gopaladesikan, Stephan G. Wagner, Mark Daniel Ward:
On the Asymptotic Probability of Forbidden Motifs on the Fringe of Recursive Trees. Exp. Math. 25(3): 237-245 (2016) - [j48]Stephan G. Wagner, Hua Wang:
On the Local and Global Means of Subtree Orders. J. Graph Theory 81(2): 154-166 (2016) - [c5]Kevin Durant, Stephan Wagner:
Betweenness Centrality in Random Trees. ANALCO 2016: 66-79 - [c4]Milan Bradonjic, Stephan Wagner:
Existence and Region of Critical Probabilities in Bootstrap Percolation on Inhomogeneous Periodic Trees. WAW 2016: 47-59 - 2015
- [j47]Isaac Owino Okoth, Stephan G. Wagner:
Locally Oriented Noncrossing Trees. Electron. J. Comb. 22(3): 3 (2015) - [j46]Jeffrey Gaither, Guy Louchard, Stephan G. Wagner, Mark Daniel Ward:
Resolution of T. Ward's Question and the Israel-Finch Conjecture: Precise Analysis of an Integer Sequence Arising in Dynamics. Comb. Probab. Comput. 24(1): 195-215 (2015) - [j45]Stephan G. Wagner:
Central Limit Theorems for Additive Tree Parameters with Small Toll Functions. Comb. Probab. Comput. 24(1): 329-353 (2015) - [j44]Toufik Mansour
Counting subwords in flattened partitions of sets. Discret. Math. 338(11): 1989-2005 (2015) - [j43]Helmut Prodinger, Stephan G. Wagner:
Bootstrapping and double-exponential limit laws. Discret. Math. Theor. Comput. Sci. 17(1): 123-144 (2015) - [j42]Clemens Heuberger
Variances and covariances in the Central Limit Theorem for the output of a transducer. Eur. J. Comb. 49: 167-187 (2015) - [j41]Giorgio Audrito
Enumeration of the adjunctive hierarchy of hereditarily finite sets. J. Log. Comput. 25(3): 943-963 (2015) - [j40]Clemens Heuberger, Daniel Krenn
Canonical Trees, Compact Prefix-Free Codes, and Sums of Unit Fractions: A Probabilistic Analysis. SIAM J. Discret. Math. 29(3): 1600-1653 (2015) - [c3]Dimbinaina Ralaivaosaona, Stephan G. Wagner:
Repeated fringe subtrees in random rooted trees. ANALCO 2015: 78-88 - 2014
- [j39]Stephan G. Wagner:
Enumeration Of Highly Balanced Trees. Ars Comb. 114: 15-32 (2014) - [j38]Peter J. Grabner
A General Asymptotic Scheme for the Analysis of Partition Statistics. Comb. Probab. Comput. 23(6): 1057-1086 (2014) - [j37]Zhongxun Zhu, Cao Yuan, Eric Ould Dadah Andriantiana
Graphs with maximal Hosoya index and minimal Merrifield-Simmons index. Discret. Math. 329: 77-87 (2014) - [j36]Stephan G. Wagner, Hua Wang:
Indistinguishable Trees and Graphs. Graphs Comb. 30(6): 1593-1605 (2014) - 2013
- [j35]Stephan G. Wagner:
Asymptotic Enumeration of Extensional Acyclic Digraphs. Algorithmica 66(4): 829-847 (2013) - [j34]Eric Ould Dadah Andriantiana, Stephan G. Wagner, Hua Wang:
Greedy Trees, Subtrees and Antichains. Electron. J. Comb. 20(3): 28 (2013) - [j33]Stephan G. Wagner:
The Number of Fixed Points of Wilf's Partition Involution. Electron. J. Comb. 20(4): 13 (2013) - [j32]Marcel Wild, Svante Janson, Stephan G. Wagner, Dirk Laurie:
Coupon collecting and transversals of hypergraphs. Discret. Math. Theor. Comput. Sci. 15(2): 259-270 (2013) - [c2]Clemens Heuberger, Daniel Krenn, Stephan G. Wagner:
Analysis of parameters of trees corresponding to Huffman codes and sums of unit fractions. ANALCO 2013: 33-42 - 2012
- [j31]Ivan Gutman
The matching energy of a graph. Discret. Appl. Math. 160(15): 2177-2187 (2012) - [j30]Stephan G. Wagner:
On the Wiener index of random trees. Discret. Math. 312(9): 1502-1511 (2012) - [j29]Stephan G. Wagner, Marcel Wild:
Decomposing the hypercube Qn into n isomorphic edge-disjoint trees. Discret. Math. 312(10): 1819-1822 (2012) - [c1]Stephan G. Wagner:
Asymptotic Enumeration of Extensional Acyclic Digraphs. ANALCO 2012: 1-8 - 2011
- [j28]Stephan G. Wagner:
Labeled Trees, Functions, and an Algebraic Identity. Electron. J. Comb. 18(1) (2011) - [j27]Clemens Heuberger, Stephan G. Wagner:
The number of maximum matchings in a tree. Discret. Math. 311(21): 2512-2542 (2011) - [j26]Helmut Prodinger, Carsten Schneider
Unfair permutations. Eur. J. Comb. 32(8): 1282-1298 (2011) - [j25]Eric Ould Dadah Andriantiana
On the number of independent subsets in trees with restricted degrees. Math. Comput. Model. 53(5-6): 678-683 (2011) - 2010
- [j24]Arnold Knopfmacher, Toufik Mansour
Records in Set Partitions. Electron. J. Comb. 17(1) (2010) - [j23]Markus Kuba, Stephan G. Wagner:
On the Distribution of Depths in Increasing Trees. Electron. J. Comb. 17(1) (2010) - [j22]Markus Kuba, Stephan G. Wagner:
Deterministic Edge Weights in Increasing Tree Families. Comb. Probab. Comput. 19(1): 99-119 (2010) - [j21]Elmar Teufl, Stephan G. Wagner:
Enumeration of matchings in families of self-similar graphs. Discret. Appl. Math. 158(14): 1524-1535 (2010) - [j20]Nancy S. S. Gu, Helmut Prodinger, Stephan G. Wagner:
Bijections for a class of labeled plane trees. Eur. J. Comb. 31(3): 720-732 (2010)
2000 – 2009
- 2009
- [j19]Stephan G. Wagner:
Almost All Trees have an Even Number of Independent Sets. Electron. J. Comb. 16(1) (2009) - [j18]Stephan G. Wagner, Hua Wang, Gang Yu:
Molecular graphs and the inverse Wiener index problem. Discret. Appl. Math. 157(7): 1544-1554 (2009) - [j17]Éva Czabarka
The inverse problem for certain tree parameters. Discret. Appl. Math. 157(15): 3314-3319 (2009) - [j16]Elmar Teufl, Stephan G. Wagner:
Exact and asymptotic enumeration of perfect matchings in self-similar graphs. Discret. Math. 309(23-24): 6612-6625 (2009) - [j15]Elmar Teufl, Stephan G. Wagner:
Asymptotic enumeration on self-similar graphs with two boundary vertices. Discret. Math. Theor. Comput. Sci. 11(1): 11-32 (2009) - [j14]Stephan G. Wagner, Hua Wang:
On the parity of the Wiener index. Eur. J. Comb. 30(4): 996-1004 (2009) - [j13]M. H. Khalifeh, Hassan Yousefi-Azari, A. R. Ashrafi
Some new results on distance-based graph invariants. Eur. J. Comb. 30(5): 1149-1163 (2009) - [j12]Elmar Teufl, Stephan G. Wagner:
An Asymptotic Independence Theorem for the Number of Matchings in Graphs. Graphs Comb. 25(2): 239-251 (2009) - 2008
- [j11]Stephan G. Wagner:
Subset Counting in Trees. Ars Comb. 89 (2008) - [j10]Charlotte A. C. Brennan, Arnold Knopfmacher
The Distribution of Ascents of Size d or More in Partitions of n. Comb. Probab. Comput. 17(4): 495-509 (2008) - [j9]Johannes Hatzl, Stephan G. Wagner:
Combinatorial properties of a general domination problem with parity constraints. Discret. Math. 308(24): 6355-6367 (2008) - [j8]Clemens Heuberger, Stephan G. Wagner:
Maximizing the number of independent subsets over trees with bounded degree. J. Graph Theory 58(1): 49-68 (2008) - 2007
- [j7]Stephan G. Wagner:
On the average Wiener index of degree-restricted trees. Australas. J Comb. 37: 187-204 (2007) - [j6]Arnold Knopfmacher
Graphs, partitions and Fibonacci numbers. Discret. Appl. Math. 155(10): 1175-1187 (2007) - [j5]Stephan G. Wagner:
On the number of matchings of a tree. Eur. J. Comb. 28(4): 1322-1330 (2007) - [j4]Elmar Teufl, Stephan G. Wagner:
Enumeration problems for classes of self-similar graphs. J. Comb. Theory A 114(7): 1254-1277 (2007) - [j3]Stephan G. Wagner:
Correlation of Graph-Theoretical Indices. SIAM J. Discret. Math. 21(1): 33-46 (2007) - 2006
- [j2]Stephan G. Wagner:
On an Identity for the Cycle Indices of Rooted Tree Automorphism Groups. Electron. J. Comb. 13(1) (2006) - 2005
- [j1]Robert F. Tichy, Stephan G. Wagner:
Extremal Problems for Topological Indices in Combinatorial Chemistry. J. Comput. Biol. 12(7): 1004-1013 (2005)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 20:36 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: