Descendants and ascendants in binary trees. - Alois Panholzer; Helmut Prodinger (Discret. Math. Theor. Comput. Sci., 1997)

Average-Case Analysis of Priority Trees: A Structure for Priority Queue Administration. - Alois Panholzer; Helmut Prodinger (Algorithmica, 1998)

Towards a More Precise Analysis of an Algorithm to Generate Binary Trees: A Tutorial. - Alois Panholzer; Helmut Prodinger (Comput. J., 1998)

On the Number of Descendants and Ascendants in Random Search Trees. - Conrado Martinez; Alois Panholzer; Helmut Prodinger (Electron. J. Comb., 1998)

A generating functions approach for the analysis of grand averages for multiple QUICKSELECT. - Alois Panholzer; Helmut Prodinger (Random Struct. Algorithms, 1998)

Untersuchungen zur durchschnittlichen Gestalt gewisser Baumfamilien: mit besonderer Berücksichtigung von Anwendungen in der Informatik. - Alois Panholzer (Österr. Kunst- und Kulturverl., 1999)

Partial Match Queries in Relaxed Multidimensional Search Trees. - Conrado Martinez; Alois Panholzer; Helmut Prodinger (Algorithmica, 2001)

Bijections for ternary trees and non-crossing trees. - Alois Panholzer; Helmut Prodinger (Discret. Math., 2002)

Noncrossing trees are almost conditioned Galton-Watson trees. - Jean-François Marckert; Alois Panholzer (Random Struct. Algorithms, 2002)

Non-crossing trees revisited: cutting down and spanning subtrees. - Alois Panholzer (DRW, 2003)

The Height Distribution of Nodes in Non-Crossing Trees. - Alois Panholzer (Ars Comb., 2003)

Analysis of multiple quickselect variants. - Alois Panholzer (Theor. Comput. Sci., 2003)

On Some Parameters in Heap Ordered Trees. - Kate Morris; Alois Panholzer; Helmut Prodinger (Comb. Probab. Comput., 2004)

Distribution of the Steiner Distance in Generalized M-ary Search Trees. - Alois Panholzer (Comb. Probab. Comput., 2004)

Analysis of some statistics for increasing tree families. - Alois Panholzer; Helmut Prodinger (Discret. Math. Theor. Comput. Sci., 2004)

Permuting in place: analysis of two stopping rules. - Alois Panholzer; Helmut Prodinger; Marko Riedel (J. Algorithms, 2004)

The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees. - Alois Panholzer (Random Struct. Algorithms, 2004)

The distribution of the path edge-covering numbers for random trees. - Alois Panholzer (Electron. Notes Discret. Math., 2005)

Gröbner Bases and the Defining Polynomial of a Context-Free Grammar Generating Function. - Alois Panholzer (J. Autom. Lang. Comb., 2005)

The climbing depth of random trees. - Alois Panholzer (Random Struct. Algorithms, 2005)

Destruction of Very Simple Trees. - James Allen Fill; Nevin Kapur; Alois Panholzer (Algorithmica, 2006)

Descendants in Increasing Trees. - Markus Kuba; Alois Panholzer (Electron. J. Comb., 2006)

Analysis of Insertion Costs in Priority Trees. - Markus Kuba; Alois Panholzer (ANALCO, 2007)

On the degree distribution of the nodes in increasing trees. - Markus Kuba; Alois Panholzer (J. Comb. Theory A, 2007)

Level of nodes in increasing trees revisited. - Alois Panholzer; Helmut Prodinger (Random Struct. Algorithms, 2007)

The left-right-imbalance of binary search trees. - Markus Kuba; Alois Panholzer (Theor. Comput. Sci., 2007)

Generating Random Derangements. - Conrado Martínez; Alois Panholzer; Helmut Prodinger (ANALCO, 2008)

A distributional study of the path edge-covering numbers for random trees. - Alois Panholzer (Discret. Appl. Math., 2008)

On edge-weighted recursive trees and inversions in random permutations. - Markus Kuba; Alois Panholzer (Discret. Math., 2008)

Analysis of Some Parameters for Random Nodes in Priority Trees. - Alois Panholzer (Discret. Math. Theor. Comput. Sci., 2008)

Phase Changes in Subtree Varieties in Random Recursive and Binary Search Trees. - Qunqiang Feng; Hosam M. Mahmoud; Alois Panholzer (SIAM J. Discret. Math., 2008)

Lattice Paths, Sampling Without Replacement, and Limiting Distributions. - Markus Kuba; Alois Panholzer; Helmut Prodinger (Electron. J. Comb., 2009)

Analysis of three graph parameters for random trees. - Cyril Banderier; Markus Kuba; Alois Panholzer (Random Struct. Algorithms, 2009)

On the area under lattice paths associated with triangular diminishing urn models. - Markus Kuba; Alois Panholzer (Adv. Appl. Math., 2010)

On the distribution of distances between specified nodes in increasing trees. - Markus Kuba; Alois Panholzer (Discret. Appl. Math., 2010)

Enumeration results for alternating tree families. - Markus Kuba; Alois Panholzer (Eur. J. Comb., 2010)

A combinatorial approach to the analysis of bucket recursive trees. - Markus Kuba; Alois Panholzer (Theor. Comput. Sci., 2010)

Analysis of Statistics for Generalized Stirling Permutations. - Markus Kuba; Alois Panholzer (Comb. Probab. Comput., 2011)

Generalized Stirling permutations, families of increasing trees and urn models. - Svante Janson; Markus Kuba; Alois Panholzer (J. Comb. Theory A, 2011)

The analysis of Range Quickselect and related problems. - Conrado Martínez; Alois Panholzer; Helmut Prodinger (Theor. Comput. Sci., 2011)

Analysis of "Hiring Above the Median": A "Lake Wobegon" Strategy for The Hiring Problem. - Ahmed Helmi 001; Alois Panholzer (ANALCO, 2012)

Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. - Ahmed Helmi 001; Conrado Martínez; Alois Panholzer (LATIN, 2012)

Enumeration formulæ for pattern restricted Stirling permutations. - Markus Kuba; Alois Panholzer (Discret. Math., 2012)

Bilabelled increasing trees and hook-length formulae. - Markus Kuba; Alois Panholzer (Eur. J. Comb., 2012)

Analysis of the "Hiring Above the Median" Selection Strategy for the Hiring Problem. - Ahmed Helmi 001; Alois Panholzer (Algorithmica, 2013)

Analysis of a generalized Friedman's urn with multiple drawings. - Markus Kuba; Hosam M. Mahmoud; Alois Panholzer (Discret. Appl. Math., 2013)

A Unifying Approach for Proving Hook-Length Formulas for Weighted Tree Families. - Markus Kuba; Alois Panholzer (Graphs Comb., 2013)

Alternating mapping functions. - Alois Panholzer (J. Comb. Theory A, 2013)

Analysis of the Strategy "Hiring Above the $$m$$ m -th Best Candidate". - Ahmed Helmi 001; Conrado Martínez; Alois Panholzer (Algorithmica, 2014)

Ancestors and descendants in evolving k-tree models. - Alois Panholzer; Georg Seitz (Random Struct. Algorithms, 2014)

Combinatorial families of multilabelled increasing trees and hook-length formulas. - Markus Kuba; Alois Panholzer (Discret. Math., 2016)

Parking functions for mappings. - Marie-Louise Lackner; Alois Panholzer (J. Comb. Theory A, 2016)

Probabilistic Analysis of the (1+1)-Evolutionary Algorithm. - Hsien-Kuei Hwang; Alois Panholzer; Nicolas Rolin; Tsung-Hsi Tsai; Wei-Mei Chen (Evol. Comput., 2018)

Stirling permutations containing a single pattern of length three. - Markus Kuba; Alois Panholzer (Australas. J Comb., 2019)

Combinatorial Analysis of Growth Models for Series-Parallel Networks. - Markus Kuba; Alois Panholzer (Comb. Probab. Comput., 2019)

Runs in labelled trees and mappings. - Marie-Louise Lackner; Alois Panholzer (Discret. Math., 2020)

A combinatorial approach for discrete car parking on random labelled trees. - Alois Panholzer (J. Comb. Theory A, 2020)

Parking function varieties for combinatorial tree models. - Alois Panholzer (Adv. Appl. Math., 2021)

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

On bucket increasing trees, clustered increasing trees and increasing diamonds. - Markus Kuba; Alois Panholzer (Comb. Probab. Comput., 2022)

Tree evolution processes for bucket increasing trees. - Markus Kuba; Alois Panholzer (Discret. Math., 2023)

On card guessing games: Limit law for no feedback one-time riffle shuffle. - Markus Kuba; Alois Panholzer (Adv. Appl. Math., 2024)

On Card Guessing Games: Limit Law for One-Time Riffle Shuffle. - Markus Kuba; Alois Panholzer (Electron. J. Comb., 2025)