Oswin Aichholzer

Oswin Aichholzer is an Associate Professor in the Department of Algorithms and Theory at TU Graz, Austria. He is affiliated with the Institute of Algorithms and Theory and the Institute of Software Engineering and Artificial Intelligence. His research focuses on computational geometry, graph theory, and combinatorial geometry, with an emphasis on geometric graphs, matching problems, and crossing minimization in graph drawings. He is also involved in teaching theoretical computer science and actively contributes to research projects and courses through the TU Graz's Research Portal (PURE). His recent work explores structures like crossing-free Hamiltonian cycles, bicolored order types, and folding algorithms for polyominoes.

Key research interests include algorithmic problems in geometric configurations, graph isomorphisms, and the development of efficient algorithms for problems in discrete mathematics. He has published extensively on topics such as flip operations in graphs, geometric matchings, and the analysis of complete graph drawings. His work often bridges theoretical foundations with practical algorithmic solutions, addressing challenges in both computational geometry and combinatorics.

Dr. Aichholzer’s contributions span multiple areas, including the study of polyomino folding, bichromatic matchings, and the characterization of graph rotation systems. He maintains an active research presence, with recent publications in top conferences like the Symposium on Computational Geometry (SoCG). His research portal provides further details on ongoing projects and collaborations.