Kuba, M., & Panholzer, A. (2023). Tree evolution processes for bucket increasing trees. Discrete Mathematics, 346(7), Article 113443. https://doi.org/10.1016/j.disc.2023.113443 ( reposiTUm)

Hackl, B., Panholzer, A., & Wagner, S. (2023). The Uncover Process for Random Labeled Trees. La Matematica, 2(4), 861–892. https://doi.org/10.1007/s44007-023-00060-3 ( reposiTUm)

Kuba, M., & Panholzer, A. (2022). On bucket increasing trees, clustered increasing trees and increasing diamonds. Combinatorics, Probability and Computing, 31(4), 629–661. https://doi.org/10.1017/S0963548321000493 ( reposiTUm)

Panholzer, A. (2021). Parking function varieties for combinatorial tree models. Advances in Applied Mathematics, 128(102191), 102191. https://doi.org/10.1016/j.aam.2021.102191 ( reposiTUm)

Panholzer, A. (2021). Consecutive permutation patterns in trees and mappings. Journal of Combinatorics, 12(1), 17–54. https://doi.org/10.4310/joc.2021.v12.n1.a2 ( reposiTUm)

Panholzer, A. (2020). A combinatorial approach for discrete car parking on random labelled trees. Journal of Combinatorial Theory, Series A, 173(105233), 105233. https://doi.org/10.1016/j.jcta.2020.105233 ( reposiTUm)

Lackner, M.-L., & Panholzer, A. (2020). Runs in labelled trees and mappings. Discrete Mathematics, 343(111990), 111990. https://doi.org/10.1016/j.disc.2020.111990 ( reposiTUm)

Kuba, M., & Panholzer, A. (2019). A note on harmonic number identities, Stirling series and multiple zeta values. International Journal of Number Theory, 15(07), 1323–1348. https://doi.org/10.1142/s179304211950074x ( reposiTUm)

Panholzer, A., & Kuba, M. (2019). Stirling permutations containing a single pattern of length three. Australasian Journal of Combinatorics, 74, 215–239. http://hdl.handle.net/20.500.12708/143715 ( reposiTUm)

Hwang, H.-K., Panholzer, A., Rolin, N., Tsai, T.-H., & Chen, W.-M. (2018). Probalistic Analysis of the (1+1)-Evolutionary Algorithm. Evolutionary Computation, 26(2), 299–345. https://doi.org/10.1162/evco_a_00212 ( reposiTUm)

Kuba, M., & Panholzer, A. (2018). Combinatorial Analysis of Growth Models for Series-Parallel Networks. Combinatorics, Probability and Computing, 28(4), 574–599. https://doi.org/10.1017/S096354831800038X ( reposiTUm)

Kuba, M., & Panholzer, A. (2016). On Moment Sequences and Mixed Poisson Distributions. Probability Surveys, 13(none). https://doi.org/10.1214/14-ps244 ( reposiTUm)

Kuba, M., & Panholzer, A. (2016). Combinatorial families of multilabelled increasing trees and hook-length formulas. Discrete Mathematics, 339(1), 227–254. https://doi.org/10.1016/j.disc.2015.08.010 ( reposiTUm)

Panholzer, A., & Lackner, M.-L. (2016). Parking functions for mappings. Journal of Combinatorial Theory, Series A, 339(1), 227–254. https://doi.org/10.1016/j.disc.2015.08.010 ( reposiTUm)

Kuba, M., & Panholzer, A. (2014). Multiple isolation of nodes in recursive trees. Online Journal of Analytic Combinatorics, 9. http://hdl.handle.net/20.500.12708/157308 ( reposiTUm)

Panholzer, A., & Seitz, G. (2014). Ancestors and descendants in evolving k-tree models. Random Structures and Algorithms, 44, 465–489. http://hdl.handle.net/20.500.12708/157301 ( reposiTUm)

Helmi, A., Martínez, C., & Panholzer, A. (2014). Analysis of the strategy 'hiring above the m-th best candidate". Algorithmica, 70(2), 267–300. https://doi.org/10.1007/s00453-014-9895-3 ( reposiTUm)

Helmi, A., & Panholzer, A. (2013). Analysis of the “Hiring above the median” selection strategy for the hiring problem. Algorithmica, 66(4), 762–803. https://doi.org/10.1007/s00453-012-9727-2 ( reposiTUm)

Panholzer, A. (2013). Alternating mapping functions. Journal of Combinatorial Theory, Series A, 120(7), 1835–1850. https://doi.org/10.1016/j.jcta.2013.07.005 ( reposiTUm)

Kuba, M., & Panholzer, A. (2013). A unifying approach for proving Hook-Length formulas for weighted tree families. Graphs and Combinatorics, 29(6), 1839–1865. https://doi.org/10.1007/s00373-012-1217-4 ( reposiTUm)

Kuba, M., Mahmoud, H., & Panholzer, A. (2013). Analysis of a generalized Friedman’s urn with multiple drawings. Discrete Applied Mathematics, 161(18), 2968–2984. https://doi.org/10.1016/j.dam.2013.06.022 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Limiting distributions for a class of diminishing urn models. Advances in Applied Probability, 44(1), 87–116. https://doi.org/10.1239/aap/1331216646 ( reposiTUm)

Panholzer, A., & Seitz, G. (2012). Limiting distributions for the number of inversions in labelled tree families. Annals of Combinatorics, 16(4), 847–870. https://doi.org/10.1007/s00026-012-0164-3 ( reposiTUm)

PANHOLZER, A., & PRODINGER, H. (2012). Asymptotic results for the number of paths in a grid. Bulletin of the Australian Mathematical Society, 85(3), 446–455. https://doi.org/10.1017/s0004972711002759 ( reposiTUm)

Helmi, A., Martínez, C., & Panholzer, A. (2012). Hiring above the m-th Best Candidate: A Generalization of Records in Permutations. LATIN 2012: Theoretical Informatics, 470–481. https://doi.org/10.1007/978-3-642-29344-3_40 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Enumeration formulae for pattern restricted Stirling permutations. Discrete Mathematics, 312(21), 3179–3194. http://hdl.handle.net/20.500.12708/164003 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). Bilabelled increasing trees and hook-length formulae. European Journal of Combinatorics, 33(2), 248–258. http://hdl.handle.net/20.500.12708/164004 ( reposiTUm)

KUBA, M., & PANHOLZER, A. (2011). Analysis of statistics for generalized Stirling permutations. Combinatorics, Probability and Computing, 20(6), 875–910. https://doi.org/10.1017/s0963548311000381 ( reposiTUm)

Janson, S., Kuba, M., & Panholzer, A. (2011). Generalized Stirling permutations, families of increasing trees and urn models. Journal of Combinatorial Theory, Series A, 118(1), 94–114. https://doi.org/10.1016/j.jcta.2009.11.006 ( reposiTUm)

Martínez, C., Panholzer, A., & Prodinger, H. (2011). The analysis of Range Quickselect and related problems. Theoretical Computer Science, 412(46), 6537–6555. https://doi.org/10.1016/j.tcs.2011.06.030 ( reposiTUm)

Panholzer, A. (2010). Algorithms, random tree models and combinatorial objects. Internationale Mathematische Nachrichten, 214, 1–16. http://hdl.handle.net/20.500.12708/167417 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). On the distribution of distances between specified nodes in increasing trees. Discrete Applied Mathematics, 158(5), 489–506. https://doi.org/10.1016/j.dam.2009.10.014 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). On the area under lattice paths associated with triangular diminishing urn models. Advances in Applied Mathematics, 44(4), 329–358. https://doi.org/10.1016/j.aam.2009.09.001 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). Enumeration results for alternating tree families. European Journal of Combinatorics, 31(7), 1751–1780. https://doi.org/10.1016/j.ejc.2010.03.001 ( reposiTUm)

Kuba, M., & Panholzer, A. (2010). A combinatorial approach to the analysis of bucket recursive trees. Theoretical Computer Science, 411, 3255–3273. http://hdl.handle.net/20.500.12708/167413 ( reposiTUm)

Banderier, C., Kuba, M., & Panholzer, A. (2009). Analysis of three graph parameters for random trees. Random Structures and Algorithms, 35(1), 42–69. https://doi.org/10.1002/rsa.20259 ( reposiTUm)

Panholzer, A., & Prodinger, H. (2009). A short proof of a series evaluation in terms of harmonic numbers. Integers: Electronic Journal of Combinatorial Number Theory, 9, 6. http://hdl.handle.net/20.500.12708/166371 ( reposiTUm)

Kuba, M., & Panholzer, A. (2009). A combinatorical approach for analyzing the number of descendant in increasing trees and related parameters. Quaestiones Mathematicae, 32, 91–114. http://hdl.handle.net/20.500.12708/166374 ( reposiTUm)

Kuba, M., Panholzer, A., & Prodinger, H. (2009). Lattice paths, smpling without replacement, and the kernel method. Electronic Journal of Combinatorics, 16(1), 12. http://hdl.handle.net/20.500.12708/166373 ( reposiTUm)

Panholzer, A. (2009). Left and right length of paths in binary trees or on a question of Knuth. Annals of Combinatorics, 12(4), 479–492. https://doi.org/10.1007/s00026-009-0005-1 ( reposiTUm)

Drmota, M., Gittenberger, B., Panholzer, A., Prodinger, H., & Ward, M. D. (2009). On the shape of the fringe of various types of random trees. Mathematical Methods in the Applied Sciences, 32, 1207–1245. http://hdl.handle.net/20.500.12708/165681 ( reposiTUm)

Panholzer, A., & Prodinger, H. (2009). Bijections between certain families of labelled and unlabelled d-ary trees. Applicable Analysis and Discrete Mathematics, 3(1), 123–136. https://doi.org/10.2298/aadm0901123p ( reposiTUm)

Feng, Q., Mahmoud, H. M., & Panholzer, A. (2008). Phase changes in subtree varieties in random recursive and binary search trees. SIAM Journal on Discrete Mathematics, 22(1), 160–184. https://doi.org/10.1137/060653950 ( reposiTUm)

Panholzer, A. (2008). A distributional study of the path edge-covering numbers for random trees. Discrete Applied Mathematics, 156(7), 1036–1052. https://doi.org/10.1016/j.dam.2006.05.014 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Isolating a leaf in rooted trees via random cuttings. Annals of Combinatorics, 12(1), 81–99. http://hdl.handle.net/20.500.12708/170409 ( reposiTUm)

Feng, Q., Mahmoud, H. M., & Panholzer, A. (2008). Limit laws for the Randić index of random binary tree models. Annals of the Institute of Statistical Mathematics, 60(2), 319–343. https://doi.org/10.1007/s10463-006-0107-z ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). On edge-weighted recursive trees and inversions in random permutations. Discrete Mathematics, 308(4), 529–540. https://doi.org/10.1016/j.disc.2007.03.032 ( reposiTUm)

Panholzer, A. (2008). Analysis of some parameters for random nodes in priority trees. Discrete Mathematics & Theoretical Computer Science, 10(2), 1–38. http://hdl.handle.net/20.500.12708/170422 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Isolating nodes in recursive trees. Aequationes Mathematicae, 76(3), 258–280. https://doi.org/10.1007/s00010-008-2929-7 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). On the degree distribution of the nodes in increasing trees. Journal of Combinatorial Theory, Series A, 114, 597–618. http://hdl.handle.net/20.500.12708/168727 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). On weighted path lengths and distances in increasing trees. Probability in the Engineering and Informational Sciences, 21(03), 419–433. http://hdl.handle.net/20.500.12708/168731 ( reposiTUm)

Panholzer, A., & Prodinger, H. (2007). Level of nodes in increasing trees revisted. Random Structures and Algorithms, 31(2), 203–226. https://doi.org/10.1002/rsa.20161 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). The left-right-imbalance of binary search trees. Theoretical Computer Science, 370, 265–278. http://hdl.handle.net/20.500.12708/168732 ( reposiTUm)

Fill, J. A., Kapur, N., & Panholzer, A. (2006). Destruction of very simple trees. Algorithmica, 46(3–4), 345–366. https://doi.org/10.1007/s00453-006-0100-1 ( reposiTUm)

Kuba, M., & Panholzer, A. (2006). Descendants in increasing trees. Electronic Journal of Combinatorics, 13, 1–14. http://hdl.handle.net/20.500.12708/172025 ( reposiTUm)

Panholzer, A. (2006). Cutting down very simple trees. Quaestiones Mathematicae, 29, 211–227. http://hdl.handle.net/20.500.12708/172027 ( reposiTUm)

Panholzer, A. (2005). Gröbner bases and the defining polynomial of a context-free grammar generating function. Journal of Automata, Languages and Combinatorics, 10(1), 79–97. http://hdl.handle.net/20.500.12708/171936 ( reposiTUm)

Panholzer, A. (2005). The distribution of the path edge-covering numbers for random trees. Electronic Notes in Discrete Mathematics, 19, 163–169. http://hdl.handle.net/20.500.12708/171937 ( reposiTUm)

Panholzer, A. (2005). The climbing depth of random trees. Random Structures and Algorithms, 26, 84–109. http://hdl.handle.net/20.500.12708/171935 ( reposiTUm)

Panholzer, A., & Prodinger, H. (2005). Computer-free evaluation of an infinite double sum via Euler sums. Séminaire Lotharingien de Combinatoire, 55(B55a), 1–3. http://hdl.handle.net/20.500.12708/171938 ( reposiTUm)

Hackl, B., Panholzer, A., & Wagner, S. (2022). Uncovering a Random Tree. In M. D. Ward (Ed.), 33rd International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2022) (pp. 1–17). Schloss Dagstuhl – Leibniz-Zentrum für Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.AofA.2022.10 ( reposiTUm)

Panholzer, A., & Kuba, M. (2016). Combinatorial Analysis of Growth Models for Series-Parallel Networks. In Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016. 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016, Krakau, Polen, EU. http://hdl.handle.net/20.500.12708/41494 ( reposiTUm)

Kuba, M., & Panholzer, A. (2012). On death processes and urn models. In 23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA’12) (pp. 29–42). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/41155 ( reposiTUm)

Helmi, A., & Panholzer, A. (2012). Analysis of “hiring above the median”: a “Lake Wobegon” strategy for the hiring problem. In Proceedings of ANALCO 2012: Meeting on Analytic Algorithms and Combinatorics (pp. 75–83). SIAM (Society for Industrial and Applied Mathematics. http://hdl.handle.net/20.500.12708/41156 ( reposiTUm)

Panholzer, A., & Seitz, G. (2010). Ordered increasing k-trees: Introduction and analysis of a preferential attachment networking model. In 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA’10) (pp. 549–564). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40963 ( reposiTUm)

Martinez, C., Panholzer, A., & Prodinger, H. (2008). Generating random derangements. In Proceedings of the tenth Workshop on Algorithm Engineering and Experiments and the fifth Workshop on Analytic Algorithmics and Combinatorics (pp. 234–240). SIAM. http://hdl.handle.net/20.500.12708/41816 ( reposiTUm)

Drmota, M., Gittenberger, B., & Panholzer, A. (2008). The degree distriution of thickened trees. In Proceedings of the Fifth Colloquium on Mathematics and Computer Science (pp. 149–162). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40800 ( reposiTUm)

Kuba, M., & Panholzer, A. (2008). Enumerating alternating tree families. In 20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008 (pp. 105–116). LORIA. http://hdl.handle.net/20.500.12708/40880 ( reposiTUm)

Hwang, H.-K., Kuba, M., & Panholzer, A. (2007). Analysis of some exactly solvable diminishing urn models. In The 19th International Conference on Formal Power Series and Algebraic Combinatorics (p. 12). Nankai University, Tianjin, China. http://hdl.handle.net/20.500.12708/40713 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Analysis of insertion costs in priority trees. In Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics (pp. 175–182). SIAM. http://hdl.handle.net/20.500.12708/41815 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Limit laws for a class of diminishing urn models. In 2007 Conference on Analysis of Algorithms, AofA07 (pp. 341–352). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40806 ( reposiTUm)

Kuba, M., & Panholzer, A. (2007). Analysis of the total costs for variants of the Union-Find algorithm. In Proceedings of AofA 2007 (pp. 259–268). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40788 ( reposiTUm)

Kuba, M., & Panholzer, A. (2006). Analysis of label-based prarameters in increasing trees. In Fourth Colloquium on Mathematics and Computer Science (pp. 321–330). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40631 ( reposiTUm)

Panholzer, A. (2006). Left and right length of paths in binary trees or on a question of Knuth. In Fourth Colloquium on Mathematics and Computer Science (pp. 415–418). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40630 ( reposiTUm)

Gittenberger, B., & Panholzer, A. (2005). Some results for monotonically labelled simply generated trees. In International Conference on the Analysis (pp. 173–180). Discrete Mathematics and Theoretical Computer Science. http://hdl.handle.net/20.500.12708/40577 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (Eds.). (2014). Mathematik für Informatik. Vierte erweiterte Auflage. Heldermann Verlag. http://hdl.handle.net/20.500.12708/23874 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2010). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/176068 ( reposiTUm)

Drmota, M., Gittenberger, B., Karigl, G., & Panholzer, A. (2007). Mathematik für Informatik. Heldermann Verlag. http://hdl.handle.net/20.500.12708/22176 ( reposiTUm)

Panholzer, A. (2022, November 17). Cutting trees revisited [Conference Presentation]. BIRS Workshop: Analytic and Probabilistic Combinatorics, Banff, Alberta, Canada. ( reposiTUm)

Panholzer, A. (2019). Label-quantities in trees and mappings. ÖMG Conference 2019, Dornbirn, Vorarlberg, Austria. http://hdl.handle.net/20.500.12708/122944 ( reposiTUm)

Panholzer, A. (2019). Consecutive Permutation Patterns in Trees and Mappings. 17th Conference on Permutation Patterns 2019, University of Zurich, Switzerland. http://hdl.handle.net/20.500.12708/122945 ( reposiTUm)

Panholzer, A. (2018). On Some Generalizations to Trees of Problems for Permutations. Dagstuhl Seminar “Genomics, Pattern Avoidance and Statistical Mechanics,” Schloss Dagstuhl, EU. http://hdl.handle.net/20.500.12708/122595 ( reposiTUm)

Panholzer, A. (2018). Combinatorial analysis of growth models for series-parallel networks. CSASC 2018 Bratislava, Bratislava, EU. http://hdl.handle.net/20.500.12708/122946 ( reposiTUm)

Panholzer, A. (2015). Examples of two-parameter recurrences and their treatments. AofA 2015, 26th. Internatioal Meeting on Probalistic, Combinatorical and Asymptotic Methods for the Analysis of Algorithms, Strobl, Austria. http://hdl.handle.net/20.500.12708/121433 ( reposiTUm)

Panholzer, A. (2014). Some combinatorics on trees: generating, cutting and parking. Helmut Prodinger´s 60th. birthday colloquium, Stellenbosch, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/120886 ( reposiTUm)

Bruner, M.-L., & Panholzer, A. (2013). Label patterns in mappings. 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013, Cala Galdana, Menorca, EU. http://hdl.handle.net/20.500.12708/120415 ( reposiTUm)

Panholzer, A. (2013). Analysis of strategies for the hiring problem. 18th ÖMG Congress and Annual DMV Meeting, Universität Innsbruck, Austria. http://hdl.handle.net/20.500.12708/120428 ( reposiTUm)

Panholzer, A. (2013). Analytic combinatorics approaches to study discrete stochastic processes. Seminar on Stochastic Processes, ETH Zürich, Zürich, Swiss, Non-EU. http://hdl.handle.net/20.500.12708/120469 ( reposiTUm)

Panholzer, A. (2013). Parking functions for trees and mappings. Kolloquium über Kombinatorik KolKom2013, Ilmenau, Germany, EU. http://hdl.handle.net/20.500.12708/120434 ( reposiTUm)

Bruner, M.-L., & Panholzer, A. (2013). Parking in trees. CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference, St. Johns, Newfoundland, Non-EU. http://hdl.handle.net/20.500.12708/120419 ( reposiTUm)

Panholzer, A. (2013). Occurrences of exactly solvable PDEs in combinatorial problems. CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference, St. Johns, Newfoundland, Non-EU. http://hdl.handle.net/20.500.12708/120420 ( reposiTUm)

Bruner, M.-L., & Panholzer, A. (2013). Parking arborescent. Journées Aléa 2013, Marseille, France, EU. http://hdl.handle.net/20.500.12708/120424 ( reposiTUm)

Panholzer, A. (2013). Label quantities in trees and mappings. Combinatorial Probability and Statistical Mechanics Workshop, London, EU. http://hdl.handle.net/20.500.12708/120325 ( reposiTUm)

Helmi, A., & Panholzer, A. (2012). Analysis of “Hiring above the median”: A “Lake Wobegon” strategy for the Hiring problem. ANALCO12, Meeting on Analytic Algorithmics and Combinatorics, Kyoto, Japan, Non-EU. http://hdl.handle.net/20.500.12708/120009 ( reposiTUm)

Panholzer, A. (2012). Label-patterns in mappings. Kolloquium über Kombinatorik , KolKom 2012, Berlin, Germany, EU. http://hdl.handle.net/20.500.12708/120130 ( reposiTUm)

Panholzer, A. (2012). Combinatorial analysis of data structures and tree-like structures. Analytic Combinatorics and Probabilistic Number Theory: Closing Conference of the FWF-Network, TU Wien, Austira, Austria. http://hdl.handle.net/20.500.12708/120160 ( reposiTUm)

Panholzer, A. (2011). Some new results for deriving hook-lenght formulas for trees. ÖMG-Tagung-CSASC 2011, Krems, Austria. http://hdl.handle.net/20.500.12708/119809 ( reposiTUm)

Panholzer, A. (2011). Analysis of strategies for the hiring problem. Kolloquium über Kombinatorik KolKom 2011, Magdeburg, Germany, EU. http://hdl.handle.net/20.500.12708/119816 ( reposiTUm)

Panholzer, A. (2011). Some new results for deriving hook-lenght formulas for trees. CanaDAM 2011: 3rd Canadian Discrete and Algorithmic Mathematics Conference, Victoria, Canada, Non-EU. http://hdl.handle.net/20.500.12708/119841 ( reposiTUm)

Panholzer, A. (2011). Kombinatorische Analyse von Algorithmen und zufälligen diskreten Strukturen. Universität Klagenfurt, Klagenfurt, EU. http://hdl.handle.net/20.500.12708/119840 ( reposiTUm)

Panholzer, A. (2010). Analyzing generalized stirling permutations via relations to families of increasing trees and urn models. Academia Sinica Taipeh, Taipeh, Taiwan, Austria. http://hdl.handle.net/20.500.12708/119481 ( reposiTUm)

Panholzer, A. (2010). Analyzing generalized stirling permutations via relations to families of increasing trees and urn models. International Workshop an Applied Probability -IWAP2010, Madrid, Spein, EU. http://hdl.handle.net/20.500.12708/119482 ( reposiTUm)

Panholzer, A. (2010). Analysis of scale-free network models based on k-trees. SIAM Conference on Discrete Mathematics (DM 10), Austin,Texas, USA, Non-EU. http://hdl.handle.net/20.500.12708/119483 ( reposiTUm)

Panholzer, A. (2010). Exact and asymptotic enumeration results for combinatorial objects. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/119485 ( reposiTUm)

Panholzer, A. (2010). Some applications of the method of moments in the analysis of algorithms. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/119484 ( reposiTUm)

Panholzer, A. (2010). Permutation statistics for generalized stirling permutations. Colloquium on Combinatorics, Saarbrücken, Germany, EU. http://hdl.handle.net/20.500.12708/119476 ( reposiTUm)

Panholzer, A. (2009). Analysis of label-dependent parameters in increasing trees and generalizations. 2nd Canadian Discrete and Algorithmic Mathematics Conference, Montréal, Québec, Canada, Non-EU. http://hdl.handle.net/20.500.12708/119016 ( reposiTUm)

Panholzer, A. (2009). Combinatorial models based on thickened tree structures. Workshop: Evaluating R&D Collaboration Networks in Europe, Bielefeld, Germany, EU. http://hdl.handle.net/20.500.12708/119249 ( reposiTUm)

Panholzer, A. (2009). Analysis of label-dependent parameters in increasing trees. The 14th International Conference on Random Structures and Algorithms, RS&A 2009, Poznan, Poland, EU. http://hdl.handle.net/20.500.12708/119250 ( reposiTUm)

Panholzer, A. (2009). Asymptotic results for the number of unsuccesful parkers in a one-way street. Discrete Mathematics Days 2009, Ottawa, Canada, Non-EU. http://hdl.handle.net/20.500.12708/119251 ( reposiTUm)

Panholzer, A. (2009). Exact and asymptotic enumeration results for combinatorial objects. 17th ÖMG Congress / Annual DMV Conference, Graz, Austria. http://hdl.handle.net/20.500.12708/119046 ( reposiTUm)

Panholzer, A. (2008). Limiting distribution results for a discrete parking problem. 8th German Open Conference on Probability and Statistics (GOCPS 2008), Aachen, Germany, EU. http://hdl.handle.net/20.500.12708/118789 ( reposiTUm)

Panholzer, A. (2008). A study of two combinatorial problems. University of Stellenbosch, South Africa, Non-EU. http://hdl.handle.net/20.500.12708/118788 ( reposiTUm)

Panholzer, A. (2008). Asymptotic results for the number of unsuccesful parkers in a one-way street. 27th Colloquium on Combinatorics “Kolkom 08,” Magdeburg, Germany, EU. http://hdl.handle.net/20.500.12708/118775 ( reposiTUm)

Panholzer, A. (2008). Enumerating alternating tree families. 20th Internationale Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008), Valparaiso-Vina del Mar, Chile, Non-EU. http://hdl.handle.net/20.500.12708/118787 ( reposiTUm)

Panholzer, A. (2008). On a discrete parking problem. Academia Sinica, Taipei, Taiwan, Austria. http://hdl.handle.net/20.500.12708/118786 ( reposiTUm)

Panholzer, A. (2008). Combinatorial analysis of data structures and tree-like structures. Fonds zur Förderung der wissenschaftlichen Forschung, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118785 ( reposiTUm)

Panholzer, A. (2008). On a discrete parking problem. 2008 International Conference on the Analysis of Algorithms (AofA2008), Maresias, Brazil, Non-EU. http://hdl.handle.net/20.500.12708/118722 ( reposiTUm)

Panholzer, A. (2007). Analysis of insertion costs in priority trees. Workshop on Analytic Algorithmics and Combinatorics ANALCO 07, New Orleans, USA, Non-EU. http://hdl.handle.net/20.500.12708/118368 ( reposiTUm)

Panholzer, A. (2007). Some applications of the method of moments in the analysis of algorithms. 1st Canadian Discrete and Algorithmic Mathematics Conference, Banff, Canada, Non-EU. http://hdl.handle.net/20.500.12708/118367 ( reposiTUm)

Panholzer, A. (2007). “Auf und ab”: Abzählprobleme für alternierende Bäume. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/118370 ( reposiTUm)

Panholzer, A. (2007). Analysis of some exactly solvable diminishing urn models. Kolloquium über Kombinatorik, Kolkom 07, Magdeburg, Germany, EU. http://hdl.handle.net/20.500.12708/118369 ( reposiTUm)

Panholzer, A. (2007). Analysis of some exactly solvable diminishing urn models. 19th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2007), Tianjin, China, Non-EU. http://hdl.handle.net/20.500.12708/118365 ( reposiTUm)

Panholzer, A. (2007). Analysis of the total costs for variants of the Union-Find algorithm. AofA07 Conference on Analysis of Algorithms, Juan-les-pins, France, EU. http://hdl.handle.net/20.500.12708/118366 ( reposiTUm)

Panholzer, A. (2006). Left and right length of paths in binary trees. 4th Colloquium on Mathematics and Computer Science, Nancy, France, EU. http://hdl.handle.net/20.500.12708/117872 ( reposiTUm)

Panholzer, A. (2006). Some applications of generating functions for obtaining limiting distribution results in random tree models. Academia Sinica Taipeh, Taipeh, Taiwan, Austria. http://hdl.handle.net/20.500.12708/117873 ( reposiTUm)

Panholzer, A. (2006). Applications of generating functions for limiting distribution results in random tree models. Rhein-Main Kolloquium Stochastik, Frankfurt, Germany, EU. http://hdl.handle.net/20.500.12708/117875 ( reposiTUm)

Panholzer, A. (2006). The left-right-imbalance of binary search trees and related questions. Analysis of Algorithms 2006, Alden Biesen, Belgium, EU. http://hdl.handle.net/20.500.12708/117874 ( reposiTUm)

Panholzer, A. (2006). Increasing trees: the combinatorical approach. Université Paris XIII, Paris, France, EU. http://hdl.handle.net/20.500.12708/117877 ( reposiTUm)

Panholzer, A. (2006). Recent results on the analysis of increasing trees. Carleton Applied Probability Workshop, Ottawa, Canada, Non-EU. http://hdl.handle.net/20.500.12708/117876 ( reposiTUm)

Panholzer, A. (2005). Label-bezogene Parameter in Increasing trees. 16.Int.Kongress ÖMG-DMV, Klagenfurt, Klagenfurt, Austria. http://hdl.handle.net/20.500.12708/117629 ( reposiTUm)

Panholzer, A. (2005). Analysis of data structures and tree-like structures. Hearing Nationales Forschungsnetzwerk, FWF, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117630 ( reposiTUm)

Panholzer, A. (2005). On path covering numbers of random trees. 12th Internationa Conference on Random Structures and Algorithms, Poznan, Poland, EU. http://hdl.handle.net/20.500.12708/117628 ( reposiTUm)

Panholzer, A. (2005). The distribution of the path edge-covering numbers for random trees. Second Brazilian Symposium on Graphs, Algorithms and Combinatorics, Angra dos Reis, Brazil, Non-EU. http://hdl.handle.net/20.500.12708/117626 ( reposiTUm)

Panholzer, A. (2005). Some results for monotonically labelled simply generated trees. International Conference on the Analysis of Algorithms, Barcelona, Spain, Austria. http://hdl.handle.net/20.500.12708/117627 ( reposiTUm)

Panholzer, A. (2005). Priority trees. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117625 ( reposiTUm)

Panholzer, A. (2004). Analysis of some tree statistics. Seventh Iranian Statistical Conference, Teheran, Iran, Austria. http://hdl.handle.net/20.500.12708/117281 ( reposiTUm)

Panholzer, A. (2004). Destruction of certain tree families. Seventh Iranian Statistical Conference, Teheran, Iran, Austria. http://hdl.handle.net/20.500.12708/117250 ( reposiTUm)

Panholzer, A. (2004). Discovering the beauty of concrete mathematics: Thanks to my advisor and mentor. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/117246 ( reposiTUm)

Panholzer, A. (2004). Combinatorial analysis of certain tree parameters. Universität Szegedin, Szegedin, Hungary, Austria. http://hdl.handle.net/20.500.12708/117247 ( reposiTUm)

Panholzer, A. (2004). More results on priority trees. 10th Seminar on Analysis of Algorithms, Berkeley, USA, Austria. http://hdl.handle.net/20.500.12708/117248 ( reposiTUm)

Panholzer, A. (2004). Climbing and destroying trees. Academia Sinica Taipeh, Taipeh, Taiwan, Austria. http://hdl.handle.net/20.500.12708/117249 ( reposiTUm)

Panholzer, A. (2004). Destruction of recursive trees. Third Colloquium on Mathematics and Computer, TU Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/117283 ( reposiTUm)

Panholzer, A. (2003). Distribution results for Steiner-distances in certain tree families. 8. Österreichisches Mathematikertreffen, Bolzano, Italy, Austria. http://hdl.handle.net/20.500.12708/116301 ( reposiTUm)

Panholzer, A. (2003). Non-crossing trees revisited: cutting down and spanning subtrees. Discrete Random Walks 2003, Paris, France, Austria. http://hdl.handle.net/20.500.12708/116300 ( reposiTUm)

Panholzer, A. (2003). Cutting down trees revisited: a generating functions approach. 9th Seminar on Analysis of Algorithms, San Miniato, Italy, Austria. http://hdl.handle.net/20.500.12708/116298 ( reposiTUm)

Panholzer, A. (2003). Climbing rooted trees again. 11th International Conference on Random Structures and Algorithms, Poznan, Poland, Austria. http://hdl.handle.net/20.500.12708/116299 ( reposiTUm)

Panholzer, A. (2002). Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/116030 ( reposiTUm)

Panholzer, A. (2002). Verteilungsresultate für Steiner-Distanzen in verschiedenen Baumfamilien. Arbeitsgemeinschaft Diskrete Mathematik, Wien, Austria, Austria. http://hdl.handle.net/20.500.12708/116029 ( reposiTUm)

Panholzer, A. (2002). Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen. Habilitationskolloquium, Wien, Austria. http://hdl.handle.net/20.500.12708/115972 ( reposiTUm)

Panholzer, A. (2002). About Multiple Quickselect and the spanning tree size in binary search trees. 8th Seminar on Analysis of Algorithms, Strobl, Austria, Austria. http://hdl.handle.net/20.500.12708/115971 ( reposiTUm)

Panholzer, A. (2002). Verteilungsresultate für Steiner-Distanzen in verschiedenen Baumfamilien. Kombinatorisches Minikolloquium, Graz, Austria, Austria. http://hdl.handle.net/20.500.12708/115973 ( reposiTUm)

Panholzer, A. (2002). Analysis of Multiple Quickselect variants and of the Steiner distance in search trees - a generating functions approach. University of the Witwatersrand, Johannesburg, Republic of South Africa, Austria. http://hdl.handle.net/20.500.12708/115958 ( reposiTUm)

Panholzer, A. (2002). About Multiple Quickselect and the spanning tree size in binary search trees. Academia Sinica Taipeh, Taipeh, Taiwan, Austria. http://hdl.handle.net/20.500.12708/115957 ( reposiTUm)

Panholzer, A., & Prodinger, H. (2002). Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen [Professorial Dissertation, Technische Universität Wien]. reposiTUm. http://hdl.handle.net/20.500.12708/181750 ( reposiTUm)