| Generalized Stirling permutations, families of increasing trees and urn models S Janson, M Kuba, A Panholzer Journal of Combinatorial Theory, Series A 118 (1), 94-114, 2011 | 87 | 2011 |
| Level of nodes in increasing trees revisited A Panholzer, H Prodinger Random Structures & Algorithms 31 (2), 203-226, 2007 | 72 | 2007 |
| Cutting down very simple trees A Panholzer Quaestiones Mathematicae 29 (2), 211-227, 2006 | 70 | 2006 |
| Partial match queries in relaxed multidimensional search trees C Martinez, A Panholzer, H Prodinger Algorithmica 29 (1), 181-204, 2001 | 52 | 2001 |
| On the degree distribution of the nodes in increasing trees M Kuba, A Panholzer Journal of Combinatorial Theory, Series A 114 (4), 597-618, 2007 | 50 | 2007 |
| Bijections for ternary trees and non-crossing trees A Panholzer, H Prodinger Discrete mathematics 250 (1-3), 181-195, 2002 | 41 | 2002 |
| Probabilistic analysis of the (1+ 1)-evolutionary algorithm HK Hwang, A Panholzer, N Rolin, TH Tsai, WM Chen Evolutionary computation 26 (2), 299-345, 2018 | 35 | 2018 |
| Destruction of recursive trees A Panholzer Mathematics and Computer Science III: Algorithms, Trees, Combinatorics and …, 2004 | 35 | 2004 |
| Parking functions for mappings ML Lackner, A Panholzer Journal of Combinatorial Theory, Series A 142, 1-28, 2016 | 33 | 2016 |
| Analysis of a generalized Friedman’s urn with multiple drawings M Kuba, H Mahmoud, A Panholzer Discrete Applied Mathematics 161 (18), 2968-2984, 2013 | 32 | 2013 |
| Analysis of some exactly solvable diminishing urn models HK Hwang, M Kuba, A Panholzer arXiv preprint arXiv:2212.05091, 2022 | 31 | 2022 |
| The distribution of the size of the ancestor‐tree and of the induced spanning subtree for random trees A Panholzer Random Structures & Algorithms 25 (2), 179-207, 2004 | 29 | 2004 |
| Non-crossing trees revisited: cutting down and spanning subtrees A Panholzer Discrete Mathematics & Theoretical Computer Science, 2003 | 29 | 2003 |
| A generating functions approach for the analysis of grand averages for multiple QUICKSELECT A Panholzer, H Prodinger Random Structures & Algorithms 13 (3‐4), 189-209, 1998 | 29 | 1998 |
| Spanning tree size in random binary search trees A Panholzer, H Prodinger | 26 | 2004 |
| On the number of descendants and ascendants in random search trees C Martínez, A Panholzer, H Prodinger The Electronic Journal of Combinatorics 5 (1), R20, 1998 | 25 | 1998 |
| Generating random derangements C Martínez, A Panholzer, H Prodinger 2008 Proceedings of the Fifth Workshop on Analytic Algorithmics and …, 2008 | 24 | 2008 |
| Phase changes in subtree varieties in random recursive and binary search trees Q Feng, HM Mahmoud, A Panholzer SIAM Journal on Discrete Mathematics 22 (1), 160-184, 2008 | 24 | 2008 |
| Destruction of very simple trees JA Fill, N Kapur, A Panholzer Algorithmica 46, 345-366, 2006 | 23 | 2006 |
| Analysis of statistics for generalized Stirling permutations M Kuba, A Panholzer Combinatorics, Probability and Computing 20 (6), 875-910, 2011 | 21 | 2011 |
