Publikationsliste für
Alois Panholzer
als Autorin / Autor bzw. wesentlich beteiligte Person
191 Datensätze (2002 - 2021)
Bücher und Buch-Herausgaben
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2007,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer:
"Mathematik für Informatik";
Heldermann Verlag,
2010,
ISBN: 978-3-88538-117-4;
438 S.
M. Drmota, B. Gittenberger, G. Karigl, A. Panholzer (Hrg.):
"Mathematik für Informatik. Vierte erweiterte Auflage";
Heldermann Verlag,
2014,
ISBN: 978-3-88538-117-4;
470 S.
Zeitschriftenartikel
C. Banderier, M. Kuba, A. Panholzer:
"Analysis of three graph parameters for random trees";
Random Structures and Algorithms,
35
(2009),
1;
S. 42
- 69.
M. Drmota, B. Gittenberger, A. Panholzer, H. Prodinger, M. Ward:
"On the shape of the fringe of various types of random trees";
Mathematical Methods in the Applied Sciences,
32
(2009),
S. 1207
- 1245.
Q. Feng, H. Mahmoud, A. Panholzer:
"Limit laws for the Randić index of random binary tree models";
Annals of the Institute of Statistical Mathematics,
60
(2008),
2;
S. 319
- 343.
Q. Feng, H. Mahmoud, A. Panholzer:
"Phase changes in subtree varieties in random recursive and binary search trees";
SIAM Journal on Discrete Mathematics,
22
(2008),
1;
S. 160
- 184.
J. Fill, N. Kapur, A. Panholzer:
"Destruction of very simple trees";
Algorithmica,
46
(2006),
S. 354
- 366.
A. Helmi, C. Martinez, A. Panholzer:
"Analysis of the strategy ´hiring above the m-th best candidate"";
Algorithmica,
70
(2014),
S. 267
- 300.
A. Helmi, C. Martinez, A. Panholzer:
"Hiring above the m-th Best Candidate: A Generalization of Records in Permutations";
Lecture Notes in Computer Science,
7256
(2012),
S. 470
- 481.
A. Helmi, A. Panholzer:
"Analysis of the "Hiring above the median" selection strategy for the hiring problem";
Algorithmica,
66
(2013),
4;
S. 762
- 803.
S. Janson, M. Kuba, A. Panholzer:
"Generalized Stirling permutations, families of increasing trees and urn models";
Journal of Combinatorial Theory Series A,
118
(2011),
1;
S. 94
- 114.
M. Kuba, H. Mahmoud, A. Panholzer:
"Analysis of a generalized Friedman´s urn with multiple drawings";
Discrete Applied Mathematics,
161
(2013),
18;
S. 2968
- 2984.
M. Kuba, A. Panholzer:
"A combinatorial approach to the analysis of bucket recursive trees";
Theoretical Computer Science,
411
(2010),
S. 3255
- 3273.
M. Kuba, A. Panholzer:
"A combinatorical approach for analyzing the number of descendant in increasing trees and related parameters";
Quaestiones Mathematicae,
32
(2009),
S. 91
- 114.
M. Kuba, A. Panholzer:
"A unifying approach for proving Hook-Length formulas for weighted tree families";
Graphs and Combinatorics,
29
(2013),
6;
S. 1839
- 1865.
M. Kuba, A. Panholzer:
"Analysis of statistics for generalized Stirling permutations";
Combinatorics, Probability and Computing,
20
(2011),
S. 875
- 910.
M. Kuba, A. Panholzer:
"Bilabelled increasing trees and hook-length formulae";
European Journal of Combinatorics,
33
(2012),
2;
S. 248
- 258.
M. Kuba, A. Panholzer:
"Combinatorial families of multilabelled increasing trees and hook-length formulas";
Discrete Mathematics,
339
(2016),
S. 227
- 254.
Zusätzliche Informationen
M. Kuba, A. Panholzer:
"Descendants in increasing trees";
Electronic Journal of Combinatorics,
13
(2006),
S. 1
- 14.
M. Kuba, A. Panholzer:
"Enumeration formulae for pattern restricted Stirling permutations";
Discrete Mathematics,
312
(2012),
21;
S. 3179
- 3194.
M. Kuba, A. Panholzer:
"Enumeration results for alternating tree families";
European Journal of Combinatorics,
31
(2010),
S. 1751
- 1780.
M. Kuba, A. Panholzer:
"Isolating a leaf in rooted trees via random cuttings";
Annals Of Combinatorics,
12
(2008),
1;
S. 81
- 99.
M. Kuba, A. Panholzer:
"Isolating nodes in recursive trees";
Aequationes Mathematicae,
76
(2008),
S. 258
- 280.
M. Kuba, A. Panholzer:
"Limiting distributions for a class of diminishing urn models";
Advances in Applied Probability,
44
(2012),
1;
S. 87
- 116.
M. Kuba, A. Panholzer:
"Multiple isolation of nodes in recursive trees";
Online Journal of Analytic Combinatorics,
9
(2014).
M. Kuba, A. Panholzer:
"On edge-weighted recursive trees and inversions in random permutations";
Discrete Mathematics,
308
(2008),
4;
S. 529
- 540.
M. Kuba, A. Panholzer:
"On Moment Sequences and Mixed Poisson Distributions";
Probability Surveys,
13
(2016),
S. 89
- 155.
Zusätzliche Informationen
M. Kuba, A. Panholzer:
"On the area under lattice paths associated with triangular diminishing urn models";
Advances in Applied Mathematics,
44
(2010),
S. 329
- 358.
M. Kuba, A. Panholzer:
"On the degree distribution of the nodes in increasing trees.";
Journal of Combinatorial Theory Series A,
114
(2007),
S. 597
- 618.
M. Kuba, A. Panholzer:
"On the distribution of distances between specified nodes in increasing trees";
Discrete Applied Mathematics,
158
(2010),
S. 489
- 506.
M. Kuba, A. Panholzer:
"On weighted path lengths and distances in increasing trees";
Probability in the Engineering and Informational Science,
21
(2007),
03;
S. 419
- 433.
M. Kuba, A. Panholzer:
"The left-right-imbalance of binary search trees";
Theoretical Computer Science,
370
(2007),
S. 265
- 278.
M. Kuba, A. Panholzer, H. Prodinger:
"Lattice paths, smpling without replacement, and the kernel method";
Electronic Journal of Combinatorics,
16
(2009),
1;
12 S.
M. Lackner, A. Panholzer:
"Runs in labelled trees and mappings";
Discrete Mathematics,
343
(2020),
9;
S. 1
- 22.
Zusätzliche Informationen
J.-F. Marckert, A. Panholzer:
"Noncrossing trees are almost conditioned Galton-Watson trees";
Random Structures and Algorithms,
20
(2002),
S. 115
- 125.
C. Martinez, A. Panholzer, H. Prodinger:
"The analysis of Range Quickselect and related problems";
Theoretical Computer Science,
412
(2011),
46;
S. 6537
- 6555.
K. Morris, A. Panholzer, H. Prodinger:
"On some parameters in heap ordered trees";
Combinatorics, Probability and Computing,
13
(2004),
4-5;
S. 677
- 696.
A. Panholzer:
"A combinatorial approach for discrete car parking on random labelled trees";
Journal of Combinatorial Theory Series A,
173
(2020),
105233.
Zusätzliche Informationen
A. Panholzer:
"A distributional study of the path edge-covering numbers for random trees";
Discrete Applied Mathematics,
156
(2008),
S. 1036
- 1052.
A. Panholzer:
"Algorithms, random tree models and combinatorial objects";
Internationale Mathematische Nachrichten,
214
(2010),
S. 1
- 16.
A. Panholzer:
"Alternating mapping functions";
Journal of Combinatorial Theory Series A,
120
(2013),
7;
S. 1835
- 1850.
A. Panholzer:
"Analysis of multiple quickselect variants";
Theoretical Computer Science,
302
(2003),
S. 45
- 91.
A. Panholzer:
"Analysis of some parameters for random nodes in priority trees";
Discrete Mathematics & Theoretical Computer Science,
10
(2008),
2;
S. 1
- 38.
A. Panholzer:
"Consecutive permutation patterns in trees and mappings.";
Journal of Combinatorics,
12
(2021),
1;
S. 17
- 54.
A. Panholzer:
"Cutting down very simple trees";
Quaestiones Mathematicae,
29
(2006),
S. 211
- 227.
A. Panholzer:
"Distribution of the Steiner distance in generalized M-ary search trees";
Combinatorics, Probability and Computing,
13
(2004),
4-5;
S. 717
- 733.
A. Panholzer:
"Gröbner bases and the defining polynomial of a context-free grammar generating function";
Journal of Automata, Languages and Combinatorics,
10
(2005),
1;
S. 79
- 97.
A. Panholzer:
"Left and right length of paths in binary trees or on a question of Knuth";
Annals Of Combinatorics,
12
(2009),
S. 479
- 492.
A. Panholzer:
"Non-crossing trees revisited: cutting down and spanning subtrees";
Discrete Mathematics & Theoretical Computer Science,
http://dmtcs.loria.fr/proceedings/html/pdfpapers/
(2003).
A. Panholzer:
"On generalized Fibonacci permutations";
Journal of Information and Optimization Sciences,
24
(2003),
S. 591
- 610.
A. Panholzer:
"Parking function varieties for combinatorial tree models.";
Advances in Applied Mathematics,
128
(2021),
102191;
42 S.
A. Panholzer:
"The climbing depth of random trees";
Random Structures and Algorithms,
26
(2005),
S. 84
- 109.
A. Panholzer:
"The distribution of the path edge-covering numbers for random trees";
Electronic Notes in Discrete Mathematics,
19
(2005),
S. 163
- 169.
A. Panholzer:
"The distribution of the size of the ancestor-tree and of the induced spanning subtree for random trees";
Random Structures and Algorithms,
25
(2004),
2;
S. 179
- 207.
A. Panholzer:
"The height distribution of nodes in non-crossing trees";
Ars Combinatoria,
69
(2003),
S. 19
- 32.
A. Panholzer, H. Hwang, N. Rolin, T. Tsai, M. Chen:
"Probalistic Analysis of the (1+1)-Evolutionary Algorithm";
Evolutionary Computation,
26
(2018),
2;
S. 299
- 345.
A. Panholzer, M. Kuba:
"A note on harmonic number identities, Stirling series and multiple zeta values.";
International Journal of Number Theory,
15
(2019),
7;
S. 1323
- 1348.
A. Panholzer, M. Kuba:
"Combinatorial Analysis of Growth Models for Series-Parallel Networks";
Combinatorics, Probability and Computing,
## online first
(2018),
S. 1
- 26.
A. Panholzer, M. Kuba:
"Combinatorial analysis of growth models for series-parallel networks";
Combinatorics, Probability and Computing,
28
(2019),
4;
S. 574
- 599.
A. Panholzer, M. Kuba:
"Stirling permutations containing a single pattern of length three";
Australasian Journal of Combinatorics,
74
(2019),
S. 215
- 239.
A. Panholzer, M. Lackner:
"Parking functions for mappings";
Journal of Combinatorial Theory Series A,
142
(2016),
S. 1
- 28.
Zusätzliche Informationen
A. Panholzer, H. Prodinger:
"A generating functions proof of a curious identity";
Integers: Electronic Journal of Combinatorial Number Theory,
2, http://www.integers-ejcnt.org/vol2.html
(2002),
A6.
A. Panholzer, H. Prodinger:
"A short proof of a series evaluation in terms of harmonic numbers";
Integers: Electronic Journal of Combinatorial Number Theory,
9
(2009),
6 S.
A. Panholzer, H. Prodinger:
"Analysis of some statistics for increasing tree families";
Discrete Mathematics & Theoretical Computer Science,
6
(2004),
2;
S. 437
- 460.
A. Panholzer, H. Prodinger:
"Asymptotic results for the number of paths in a grid";
Bulletin of the Australian Mathematical Society,
85
(2012),
3;
S. 446
- 455.
A. Panholzer, H. Prodinger:
"Bijections between certain families of labelled and unlabelled d-ary trees";
Applicable Analysis and Discrete Mathematics,
3
(2009),
1;
S. 123
- 136.
A. Panholzer, H. Prodinger:
"Bijections for ternary trees and non-crossing trees";
Discrete Mathematics,
250
(2002),
S. 181
- 195.
A. Panholzer, H. Prodinger:
"Binary search tree recursions with harmonic toll functions";
Journal of Computational and Applied Mathematics,
142
(2002),
S. 211
- 225.
A. Panholzer, H. Prodinger:
"Computer-free evaluation of an infinite double sum via Euler sums";
Séminaire Lotharingien de Combinatoire,
55
(2005),
B55a;
S. 1
- 3.
A. Panholzer, H. Prodinger:
"Level of nodes in increasing trees revisted";
Random Structures and Algorithms,
31
(2007),
2;
S. 203
- 226.
A. Panholzer, H. Prodinger:
"Moments of level numbers of leaves in binary trees";
Journal of Statistical Planning and Inference,
101
(2002),
S. 267
- 279.
A. Panholzer, H. Prodinger:
"Spanning tree size in random binary search trees";
Annals of Applied Probability,
14
(2004),
2;
S. 718
- 733.
A. Panholzer, H. Prodinger, M. Riedel:
"Measuring post-quickselect disorder";
Journal of the Iranian Statistical Society (eingeladen),
3
(2004),
2;
S. 219
- 249.
A. Panholzer, H. Prodinger, M. Riedel:
"Permuting in place: analysis of two stopping rules";
Journal of Algorithms,
51
(2004),
S. 170
- 184.
A. Panholzer, G. Seitz:
"Ancestors and descendants in evolving k-tree models";
Random Structures and Algorithms,
44
(2014),
S. 465
- 489.
A. Panholzer, G. Seitz:
"Limiting distributions for the number of inversions in labelled tree families";
Annals Of Combinatorics,
16
(2012),
4;
S. 847
- 870.
Beiträge in Tagungsbänden
M. Drmota, B. Gittenberger, A. Panholzer:
"The degree distriution of thickened trees";
in: "Proceedings of the Fifth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
2008,
S. 149
- 162.
B. Gittenberger, A. Panholzer:
"Some results for monotonically labelled simply generated trees";
in: "International Conference on the Analysis",
Discrete Mathematics and Theoretical Computer Science,
2005,
S. 173
- 180.
A. Helmi, A. Panholzer:
"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",
SIAM (Society for Industrial and Applied Mathematics,
2012,
S. 75
- 83.
H. Hwang, M. Kuba, A. Panholzer:
"Analysis of some exactly solvable diminishing urn models";
in: "The 19th International Conference on Formal Power Series and Algebraic Combinatorics",
Nankai University, Tianjin, China,
2007,
12 S.
M. Kuba, A. Panholzer:
"Analysis of insertion costs in priority trees";
in: "Proceedings of the Fourth Workshop on Analytic Algorithmics and Combinatorics",
SIAM,
2007,
ISBN: 978-0-898716-28-3,
S. 175
- 182.
M. Kuba, A. Panholzer:
"Analysis of label-based prarameters in increasing trees";
in: "Fourth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
2006,
S. 321
- 330.
M. Kuba, A. Panholzer:
"Analysis of the total costs for variants of the Union-Find algorithm";
in: "Proceedings of AofA 2007",
Discrete Mathematics and Theoretical Computer Science,
2007,
S. 259
- 268.
M. Kuba, A. Panholzer:
"Enumerating alternating tree families";
in: "20th Annual International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008",
LORIA,
2008,
S. 105
- 116.
M. Kuba, A. Panholzer:
"Limit laws for a class of diminishing urn models";
in: "2007 Conference on Analysis of Algorithms, AofA07",
Discrete Mathematics and Theoretical Computer Science,
Nancy, France,
2007,
S. 341
- 352.
M. Kuba, A. Panholzer:
"On death processes and urn models";
in: "23rd Intern. Meeting on Probabilistic, Combinatorial, and Asymptotic Methods for the Analysis of Algorithms (AofA'12)",
Discrete Mathematics and Theoretical Computer Science,
2012,
S. 29
- 42.
C. Martinez, A. Panholzer, H. Prodinger:
"Generating random derangements";
in: "Proceedings of the tenth Workshop on Algorithm Engineering and Experiments and the fifth Workshop on Analytic Algorithmics and Combinatorics",
SIAM,
Philadelphia, USA,
2008,
ISBN: 978-0-898716-53-5,
S. 234
- 240.
A. Panholzer:
"Analysis of some tree statistics";
in: "Proceedings of the Seventh Iranian Statistical Conference",
herausgegeben von: Allameh Tabatabaie University Tehran, Iran;
Iranian Statistical Society,
Teheran, Iran,
2004, (eingeladen),
S. 259
- 288.
A. Panholzer:
"Destruction of recursive trees";
in: "Mathematics and Computer Science III",
M. Drmota et al. (Hrg.);
Birkhäuser,
Basel,
2004,
ISBN: 3-7643-7128-5,
S. 267
- 280.
A. Panholzer:
"Left and right length of paths in binary trees or on a question of Knuth";
in: "Fourth Colloquium on Mathematics and Computer Science",
Discrete Mathematics and Theoretical Computer Science,
Nancy,
2006,
S. 415
- 418.
A. Panholzer, G. Seitz:
"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)",
Discrete Mathematics and Theoretical Computer Science,
2010,
S. 549
- 564.
Vorträge und Posterpräsentationen (mit Tagungsband-Eintrag)
A. Panholzer, M. Kuba:
"Combinatorial Analysis of Growth Models for Series-Parallel Networks";
Vortrag: 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016,
Krakau, Polen (eingeladen);
04.07.2016
- 08.07.2016; in: "Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Polen, 4-8. Juli 2016",
Artikel 22
(2016).
Zusätzliche Informationen
Vorträge und Posterpräsentationen (ohne Tagungsband-Eintrag)
M. Bruner, A. Panholzer:
"Label patterns in mappings";
Vortrag: 24th International Meeting on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms AofA 2013,
Cala Galdana, Menorca;
27.05.2013
- 31.05.2013.
M. Bruner, A. Panholzer:
"Parking arborescent";
Vortrag: Journées Aléa 2013,
Marseille, France;
18.03.2013
- 22.03.2013.
M. Bruner, A. Panholzer:
"Parking in trees";
Vortrag: CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference,
St. Johns, Newfoundland;
10.06.2013
- 13.06.2013.
A. Helmi, A. Panholzer:
"Analysis of "Hiring above the median": A "Lake Wobegon" strategy for the Hiring problem";
Vortrag: ANALCO12, Meeting on Analytic Algorithmics and Combinatorics,
Kyoto, Japan;
16.01.2012.
A. Panholzer:
""Auf und ab": Abzählprobleme für alternierende Bäume";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
TU Wien, Austria;
23.10.2007.
A. Panholzer:
"A study of two combinatorial problems";
Vortrag: University of Stellenbosch,
Stellenbosch, South Africa (eingeladen);
25.03.2008.
A. Panholzer:
"About Multiple Quickselect and the spanning tree size in binary search trees";
Vortrag: Academia Sinica Taipeh,
Taipeh, Taiwan;
10.07.2002.
A. Panholzer:
"About Multiple Quickselect and the spanning tree size in binary search trees";
Vortrag: 8th Seminar on Analysis of Algorithms,
Strobl, Austria (eingeladen);
28.06.2002.
A. Panholzer:
"Analysis of data structures and tree-like structures";
Vortrag: Hearing Nationales Forschungsnetzwerk, FWF,
Wien, Austria (eingeladen);
20.10.2005.
A. Panholzer:
"Analysis of insertion costs in priority trees";
Vortrag: Workshop on Analytic Algorithmics and Combinatorics ANALCO 07,
New Orleans, USA;
06.01.2007.
A. Panholzer:
"Analysis of label-dependent parameters in increasing trees";
Vortrag: The 14th International Conference on Random Structures and Algorithms, RS&A 2009,
Poznan, Poland;
03.08.2009
- 07.08.2009.
A. Panholzer:
"Analysis of label-dependent parameters in increasing trees and generalizations";
Vortrag: 2nd Canadian Discrete and Algorithmic Mathematics Conference,
Montréal, Québec, Canada;
25.05.2009
- 28.05.2009.
A. Panholzer:
"Analysis of Multiple Quickselect variants and of the Steiner distance in search trees - a generating functions approach";
Vortrag: University of the Witwatersrand,
Johannesburg, Republic of South Africa (eingeladen);
27.08.2002.
A. Panholzer:
"Analysis of scale-free network models based on k-trees";
Vortrag: SIAM Conference on Discrete Mathematics (DM 10),
Austin,Texas, USA;
14.06.2010
- 17.06.2010.
A. Panholzer:
"Analysis of some exactly solvable diminishing urn models";
Vortrag: 19th International Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2007),
Tianjin, China;
05.07.2007.
A. Panholzer:
"Analysis of some exactly solvable diminishing urn models";
Vortrag: Kolloquium über Kombinatorik, Kolkom 07,
Magdeburg, Germany;
16.11.2007.
A. Panholzer:
"Analysis of some tree statistics";
Vortrag: Seventh Iranian Statistical Conference,
Teheran, Iran;
23.08.2004.
A. Panholzer:
"Analysis of strategies for the hiring problem";
Vortrag: Kolloquium über Kombinatorik KolKom 2011,
Magdeburg, Germany;
11.11.2011
- 12.11.2011.
A. Panholzer:
"Analysis of strategies for the hiring problem";
Vortrag: 18th ÖMG Congress and Annual DMV Meeting,
Innsbruck;
23.09.2013
- 27.09.2013.
A. Panholzer:
"Analysis of the total costs for variants of the Union-Find algorithm";
Vortrag: AofA07 Conference on Analysis of Algorithms,
Juan-les-Pins, France;
20.06.2007.
A. Panholzer:
"Analytic combinatorics approaches to study discrete stochastic processes";
Vortrag: Seminar on Stochastic Processes, ETH Zürich,
Zürich, Swiss (eingeladen);
27.11.2013.
A. Panholzer:
"Analyzing generalized stirling permutations via relations to families of increasing trees and urn models";
Vortrag: Academia Sinica Taipeh,
Thaipe, Taiwan;
13.08.2010.
A. Panholzer:
"Analyzing generalized stirling permutations via relations to families of increasing trees and urn models";
Vortrag: International Workshop an Applied Probability -IWAP2010,
Madrid, Spein (eingeladen);
05.07.2010
- 08.07.2010.
A. Panholzer:
"Applications of generating functions for limiting distribution results in random tree models";
Vortrag: Rhein-Main Kolloquium Stochastik,
Frankfurt, Germany (eingeladen);
21.06.2006.
A. Panholzer:
"Asymptotic results for the number of unsuccesful parkers in a one-way street";
Vortrag: 27th Colloquium on Combinatorics "Kolkom 08",
Magdeburg, Germany;
14.11.2008
- 15.11.2008.
A. Panholzer:
"Asymptotic results for the number of unsuccesful parkers in a one-way street";
Vortrag: Discrete Mathematics Days 2009,
Ottawa, Canada;
22.05.2009
- 23.05.2009.
A. Panholzer:
"Climbing and destroying trees ";
Vortrag: Academia Sinica Taipeh,
Taipeh, Taiwan (eingeladen);
19.07.2004.
A. Panholzer:
"Climbing rooted trees again";
Vortrag: 11th International Conference on Random Structures and Algorithms,
Poznan, Poland;
13.08.2003.
A. Panholzer:
"Combinatorial analysis of certain tree parameters";
Vortrag: Universität Szegedin,
Szeged, Hungary (eingeladen);
19.04.2004.
A. Panholzer:
"Combinatorial analysis of data structures and tree-like structures";
Vortrag: Fonds zur Förderung der wissenschaftlichen Forschung,
Wien, Austria;
06.11.2008.
A. Panholzer:
"Combinatorial analysis of data structures and tree-like structures";
Vortrag: Analytic Combinatorics and Probabilistic Number Theory: Closing Conference of the FWF-Network,
TU Wien, Austria (eingeladen);
02.06.2012
- 06.06.2012.
A. Panholzer:
"Combinatorial analysis of growth models for series-parallel networks";
Vortrag: CSASC 2018 Bratislava,
Bratislava;
11.09.2018
- 14.09.2018.
A. Panholzer:
"Combinatorial models based on thickened tree structures";
Vortrag: Workshop: Evaluating R&D Collaboration Networks in Europe,
Bielefeld, Germany (eingeladen);
21.10.2009.
A. Panholzer:
"Consecutive Permutation Patterns in Trees and Mappings";
Vortrag: 17th Conference on Permutation Patterns 2019,
University of Zurich;
17.06.2019
- 21.06.2019.
A. Panholzer:
"Cutting down trees revisited: a generating functions approach";
Vortrag: 9th Seminar on Analysis of Algorithms,
San Miniato, Italy;
25.06.2003.
A. Panholzer:
"Destruction of certain tree families";
Vortrag: Seventh Iranian Statistical Conference,
Teheran, Iran;
23.08.2004
- 25.08.2004.
A. Panholzer:
"Destruction of recursive trees";
Vortrag: Third Colloquium on Mathematics and Computer,
TU Wien, Austria;
16.09.2004.
A. Panholzer:
"Discovering the beauty of concrete mathematics: Thanks to my advisor and mentor";
Vortrag: University of the Witwatersrand,
Johannesburg, South Africa (eingeladen);
27.02.2004.
A. Panholzer:
"Distribution results for Steiner-distances in certain tree families";
Vortrag: 8. Österreichisches Mathematikertreffen,
Bolzano, Italy;
23.09.2003.
A. Panholzer:
"Enumerating alternating tree families";
Vortrag: 20th Internationale Conference on Formal Power Series and Algebraic Combinatorics (FPSAC 2008),
Valparaiso-Vina del Mar, Chile;
23.06.2008.
A. Panholzer:
"Exact and asymptotic enumeration results for combinatorial objects";
Vortrag: 17th ÖMG Congress / Annual DMV Conference,
Graz;
21.09.2009
- 25.09.2009.
A. Panholzer:
"Exact and asymptotic enumeration results for combinatorial objects";
Vortrag: Université Paris XIII,
Paris, France (eingeladen);
09.02.2010.
A. Panholzer:
"Examples of two-parameter recurrences and their treatments";
Vortrag: AofA 2015, 26th. Internatioal Meeting on Probalistic, Combinatorical and Asymptotic Methods for the Analysis of Algorithms,
Strobl;
08.06.2015
- 12.06.2015.
A. Panholzer:
"Increasing trees: the combinatorical approach";
Vortrag: Université Paris XIII,
Paris, France (eingeladen);
11.04.2006.
A. Panholzer:
"Kombinatorische Analyse von Algorithmen und zufälligen diskreten Strukturen";
Vortrag: Universität Klagenfurt,
Klagenfurt (eingeladen);
27.04.2011.
A. Panholzer:
"Label quantities in trees and mappings";
Vortrag: Combinatorial Probability and Statistical Mechanics Workshop,
London (eingeladen);
21.02.2013
- 23.02.2013.
A. Panholzer:
"Label-bezogene Parameter in Increasing trees";
Vortrag: 16.Int.Kongress ÖMG-DMV, Klagenfurt,
Klagenfurt, Austria;
21.09.2005.
A. Panholzer:
"Label-patterns in mappings";
Vortrag: Kolloquium über Kombinatorik , KolKom 2012,
Berlin, Germany;
16.11.2012
- 17.11.2012.
A. Panholzer:
"Label-quantities in trees and mappings";
Vortrag: ÖMG Conference 2019,
Dornbirn, Vorarlberg;
16.09.2019
- 20.09.2019.
A. Panholzer:
"Left and right length of paths in binary trees";
Vortrag: 4th Colloquium on Mathematics and Computer Science,
Nancy, France;
19.09.2006.
A. Panholzer:
"Limiting distribution results for a discrete parking problem";
Vortrag: 8th German Open Conference on Probability and Statistics (GOCPS 2008),
Aachen, Germany;
05.03.2008.
A. Panholzer:
"More results on priority trees";
Vortrag: 10th Seminar on Analysis of Algorithms,
Berkeley, USA;
14.06.2004
- 18.06.2004.
A. Panholzer:
"Non-crossing trees revisited: cutting down and spanning subtrees";
Vortrag: Discrete Random Walks 2003,
Paris, France;
03.09.2003.
A. Panholzer:
"Occurrences of exactly solvable PDEs in combinatorial problems";
Vortrag: CanaDam 2013: 4th Canadian Discrete and Algorithmic Mathematics Conference,
St. Johns, Newfoundland (eingeladen);
10.06.2013
- 13.06.2013.
A. Panholzer:
"On a discrete parking problem";
Vortrag: 2008 International Conference on the Analysis of Algorithms (AofA2008),
Maresias, Brazil (eingeladen);
12.04.2008
- 18.04.2008.
A. Panholzer:
"On a discrete parking problem";
Vortrag: Academia Sinica,
Taipei, Taiwan (eingeladen);
18.08.2008.
A. Panholzer:
"On path covering numbers of random trees";
Vortrag: 12th Internationa Conference on Random Structures and Algorithms,
Poznan, Poland;
04.08.2005.
A. Panholzer:
"On Some Generalizations to Trees of Problems for Permutations";
Vortrag: Dagstuhl Seminar "Genomics, Pattern Avoidance and Statistical Mechanics",
Schloss Dagstuhl (eingeladen);
04.11.2018
- 09.11.2018.
A. Panholzer:
"Parking functions for trees and mappings";
Vortrag: Kolloquium über Kombinatorik KolKom2013,
Ilmenau, Germany;
08.11.2013
- 09.11.2013.
A. Panholzer:
"Permutation statistics for generalized stirling permutations";
Vortrag: Colloquium on Combinatorics,
Saarbrücken, Germany;
12.11.2010
- 13.11.2010.
A. Panholzer:
"Priority trees";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
Wien, Austria;
12.04.2005.
A. Panholzer:
"Recent results on the analysis of increasing trees";
Vortrag: Carleton Applied Probability Workshop,
Ottawa, Canada;
03.06.2006.
A. Panholzer:
"Some applications of generating functions for obtaining limiting distribution results in random tree models";
Vortrag: Academia Sinica Taipeh,
Taipeh, Taiwan (eingeladen);
14.08.2006.
A. Panholzer:
"Some applications of the method of moments in the analysis of algorithms";
Vortrag: 1st Canadian Discrete and Algorithmic Mathematics Conference,
Banff, Alberta, Canada;
31.05.2007.
A. Panholzer:
"Some applications of the method of moments in the analysis of algorithms";
Vortrag: Université Paris XIII,
Paris, France (eingeladen);
16.02.2010.
A. Panholzer:
"Some combinatorics on trees: generating, cutting and parking";
Vortrag: Helmut Prodinger´s 60th. birthday colloquium,
Stellenbosch, South Africa;
28.02.2014.
A. Panholzer:
"Some new results for deriving hook-lenght formulas for trees";
Vortrag: ÖMG-Tagung-CSASC 2011,
Krems;
25.09.2011
- 28.09.2011.
A. Panholzer:
"Some new results for deriving hook-lenght formulas for trees";
Vortrag: CanaDAM 2011: 3rd Canadian Discrete and Algorithmic Mathematics Conference,
Victoria, Canada;
31.05.2011
- 03.06.2011.
A. Panholzer:
"Some results for monotonically labelled simply generated trees";
Vortrag: International Conference on the Analysis of Algorithms,
Barcelona, Spain;
06.06.2005.
A. Panholzer:
"The distribution of the path edge-covering numbers for random trees";
Vortrag: Second Brazilian Symposium on Graphs, Algorithms and Combinatorics,
Angra dos Reis, Brazil;
28.04.2005.
A. Panholzer:
"The left-right-imbalance of binary search trees and related questions";
Vortrag: Analysis of Algorithms 2006,
Alden Biesen, Belgium;
07.07.2006.
A. Panholzer:
"Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen";
Vortrag: Habilitationskolloquium,
Wien, Austria;
22.11.2002.
A. Panholzer:
"Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
Wien, Austria;
10.12.2002.
A. Panholzer:
"Verteilungsresultate für Steiner-Distanzen in verschiedenen Baumfamilien";
Vortrag: Kombinatorisches Minikolloquium,
Graz, Austria (eingeladen);
06.12.2002.
A. Panholzer:
"Verteilungsresultate für Steiner-Distanzen in verschiedenen Baumfamilien";
Vortrag: Arbeitsgemeinschaft Diskrete Mathematik,
Wien, Austria;
03.12.2002.
Habilitationsschriften
A. Panholzer:
"Über das asymptotische Verhalten bestimmter rekursiver Algorithmen und rekursiv beschreibbarer Größen von Bäumen";
Technische Universität Wien / Fakultät für Technische Naturwissenschaften und Informatik,
2002.
Dissertationen (eigene und begutachtete)
M. Bruner:
"Patterns in labelled combinatorical objects";
Betreuer/in(nen), Begutachter/in(nen): A. Panholzer, V. Vatter;
Institut für Diskrete Mathematik und Geometrie,
2015;
Rigorosum: 22.06.2015.
Zusätzliche Informationen
M. Kuba:
"Analysis of node isolation procedures and label-based parameters in tree structures";
Betreuer/in(nen), Begutachter/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2006.
V. Roitner:
"Studies on several parameters in lattice paths";
Betreuer/in(nen), Begutachter/in(nen): B. Gittenberger, C. Banderier, A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2020;
Rigorosum: 19.11.2020.
Zusätzliche Informationen
G. Seitz:
"Analysis of various parameters in labelled trees and tree-like structures"";
Betreuer/in(nen), Begutachter/in(nen): A. Panholzer, I. Fischer;
Institut für Diskrete Mathematik und Geometrie,
2012;
Rigorosum: 2012.
Diplom- und Master-Arbeiten (eigene und betreute)
P. Agy:
"Analyse von Prozeduren zum Isolieren von Knoten in Zufallsbäumen";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2005.
C. Beer:
"Hook-length formulas for trees: a general approach";
Betreuer/in(nen): A. Panholzer;
E 104,
2019.
S. Beer:
"Vergleich und Analyse von Partitionierungsalgorithmen für Quicksort";
Betreuer/in(nen): A. Panholzer;
E 104,
2018.
M. Bruner:
"Restriceted permutations on multisetshhhh";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2011;
Abschlussprüfung: 06.06.2011.
S. Dorrighi:
"Analyse und Varianten von In-Situ Permutationsalgorithmen";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2009.
M. Fuchs:
"Analyse von serien-parallelen Graphen und deren Entwicklung unter stochastischen Wachstumsregeln";
Betreuer/in(nen): A. Panholzer;
E 104,
2017.
M. Heinrich:
"Komplexität und Varianten von Minesweeper";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2006.
M. Kammer:
"Application of the Kernel-Method";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2011;
Abschlussprüfung: 30.11.2011.
M. Kuba:
"Multiple quickselect und die Steiner-Distanz in binären Suchbäumen";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2004.
S. Pichler:
"Label-Muster in markierten Bäumen";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2014;
Abschlussprüfung: 02.06.2014.
K. Podloucky:
"Analysis of non-crossing trees";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2005.
P. Reiner:
"Kombinatorische Abzählprobleme bei markierten k-Bäumen";
Betreuer/in(nen): A. Panholzer;
E 104,
2018.
L. Riegler:
"Analytische Behandlung von Urnenmodellen";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2010.
S. Schnabl:
"Boltzmann Sampling Algorithmen zum Erzeugen zufälliger kombinatorischer Objekte";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2015;
Abschlussprüfung: 05/2015.
C. Schreiber:
"Über das Verhalten von Quickselect";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2011;
Abschlussprüfung: 06.06.2011.
G. Seitz:
"Parking functions and generalizations";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2009.
C. Tomsic:
"Rank-Based strategies for the Hiring Problem";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2014.
A. Zapletal:
"Algorithmen in der Computeralgebra für Polynomideale und -moduln";
Betreuer/in(nen): A. Panholzer;
Institut für Diskrete Mathematik und Geometrie,
2004.
