Günther Raidl
Ao.Univ.Prof. Dipl.-Ing. Dr.techn.

Günther Raidl

Research Interests

  • Solving algorithmic problems arising in various application domains, e.g. network design and other problems on graphs, transportation optimization, cutting and packing, computational biology, scheduling and timetabling
  • Combinatorial optimization by means of exact techniques including mathematical programming, branch and bound, dynamic programming, constraint programming as well as heuristics and metaheuristics
  • Machine learning, reinforcement learning
  • A particular focus lies in hybrid optimization techniques combining concepts of (meta-)heuristics, exact optimization techniques, and machine learning.
  • Efficient algorithms and data structures in general.

Also see the group’s research page.

International Organizational Activities

Board Memberships etc.:

Some (more or less) recent major activities:

Finally, find here a detailed list of most of my past and present international organisational activities.

Recent Publications

A Denoising Diffusion Adaptive Search for the Alpha-Domination Problem on Social Graphs
Evolutionary Computation in Combinatorial Optimization (Krejca, Martin S. and Pillay, Nelishia), volume 16522 of LNCS, pages 133-149, 2026, Springer.
Complexity of Positive Influence Domination on Partial Grids
Fundamentals of Computation Theory—25th International Symposium (Jeż, Artur and Otop, Jan), volume 16106 of LNCS, pages 267-280, 2026, Springer.
Putting Tutte's Counterexample to Tait's Conjecture in Perspective to Hamiltonicity and Non-Hamiltonicity in Certain Planar Cubic Graphs
Proceedings of the 12th International Network Optimization Conference, INOC 2026, Liège, Belgium (Fortz, Bernard), pages 17-20, 2026, OpenProceedings.org.