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 consider problems arising in the areas of Combinatorial Optimisation, Artificial Intelligence, Automated Reasoning, Planning and Scheduling, Network Design, Cutting and Packing.
Among the methods the group's research builds upon are mathematical programming techniques, satisfiability solving techniques, dynamic programming, graph algorithms, metaheuristics, fixed-parameter algorithms, and constraint-based methods.
Recent Research Projects
- Cycles on Graphs and Properties of Graphs with Special Cycle Structure (FWF P27615)
- Variable Dependencies of Quantified Boolean Formulas (FWF P27721)
- Doctoral College Logical Methods in Computer Science (FWF W1255)
- Parameterized Compilation (FWF P26200)
- Complete Solution Archives for Evolutionary Combinatorial Optimization (FWF P24660)
- Exploiting New Types of Structure for Fixed Parameter Tractability (FWF P26696)
- The Parameterized Complexity of Reasoning Problems (ERC 239962)
- Balancing Bicycle Sharing Systems (FFG 831740)
- Optimization Challenges in the Future Federated Internet (WWTF ICT-10-024)
- Multi-Criteria Optimization of FTTx Networks (FFG I892-N23)
- Matheuristics: Hybrid Optimization Algorithms for Transportation Problems with Mutliple Visits (FWF P20342)
- Cutting and Packing Problems (cooperation with Lodestar GmbH)
Benchmark suites for various problems: Problem Instances