The Algorithms and Complexity Group is concerned with the development and analysis of efficient algorithms for hard computational problems that arise in practical applications, as well as the establishment of theoretical limits of algorithmic approaches.

In particular, the group considers problems arising in the areas of Combinatorial Optimization, Artificial Intelligence, Automated Reasoning, Planning and Scheduling, Network Design, Cutting and Packing, Network Visualization, and Cartography.

Among the methods our research builds upon are mathematical programming techniques, satisfiability solving techniques, metaheuristics, graph algorithms, computational geometry, fixed-parameter algorithms, constraint-based methods, and machine learning.

The group contributes significantly to the research area Logic and Computation which is among the four main focus areas of the TU Wien Faculty of Informatics.