08+09S 09W 10S,W 11S,W 12S,W 13S,W 14S,W 15S,W 16S,W 17S,W 18S,W 19S,W 20S,W 21S,W 22S,W 23S,W 24S,W 25S,W 26S

Winter Term 2025/26, Doctoral School Events
2025-12-19 Doctoral School Seminar (10:30–12:30, TU Graz, Seminarraum 2 Geometrie, Kopernikusgasse 24/IV)
Duc Anh Nguyen (Uni. Advisor: Q. B. Tang): Global well-posedness and stability analysis of a degenerate reaction diffusion system for a prey-predator and natural enemy interaction [show abstract]
Maryna Manskova (TU. Advisor: C. Aistleitner, P. Grabner): Norms of partial sums operators for a basis with respect to a filter [show abstract]
Eduard Stefanescu (TU. Advisor: C. Aistleitner): On the maximal volume of empty convex bodies amidst multivariate dilates of a lacunary integer sequence [show abstract]
2026-01-16 Doctoral Day (HS 11.01 & 11.03, Heinrichstr. 36, Univ. Graz)
(09:00 HS 11.01 — Welcome)
Max Gutkin (TU. Advisor: M. Kang, J. Erde): Thresholds for Froböse percolation in the hypercube [show abstract]
Benedikt Hahn (TU. Advisor: B. Vogtenhuber, B. Klinz): Combinatorial Optimization on Drawings of Graphs: The Geometric k-Colored Crossing Number [show abstract]
Daniel Strenger-Galvis (TU. Advisor: S. Hörmann): Quantifying and testing dependence to categorical variables [show abstract]
(10:15—10:45 Coffee Break)
Erion Morina (Uni. Advisor: M. Holler): Exact Parameter Identification in PET Pharmacokinetic Modeling [show abstract]
Isabel Pretterhofer (TU. Advisor: B. Klinz, E. Dragoti-Cela): Monte Carlo Tree Search for the Container Loading Problem

Abstract: The Container loading problem deals with placing cuboid shaped boxes into containers such that the utilized volume is maximized and constraints are satisfied (e.g. rules about how boxes may be stacked, about weight distribution, or the unloading order). We then demonstrate how to apply Monte Carlo Tree Search to this problem. This is a heuristic algorithm combining random sampling with tree-based exploration, leveraging iterative simulations to guide decision-making, making it particularly suitable for complex packing scenarios.[hide abstract]

Joseph Dorfer (TU. Advisor: O. Aichholzer, C. Ceballos): The complexity landscape of flipping odd matchings [show abstract]
(12:00—13:30 Lunch Break. Doctoral Day continues in HS 11.03)
Ethan Williams (TU. Advisor: E. Dragoti-Cela, B. Klinz): Fair division of indivisible goods over time [show abstract]
Tobias Kaltenbacher (TU. Advisor: O. Steinbach): A simplicial space-time finite element method for the Stokes System [show abstract]
(14:20—14:50 Coffee Break)
Willem Hansen (TU. Advisor: C. Elsholtz, C. Frei): Counting D4 extensions by multi-heights [show abstract]
Julius Baumhakel (TU. Advisor: S. Hörmann): Testing for Isotropy of Function-Valued Random Fields [show abstract]
(15:40 Closure)