Matching under preferences, as we will demonstrate, both being fundamental and being unexplored in several directions, allows for numerous future innovations (conceptually and methodologically) we want to provide.
In this project, first based on parameterized algorithmics new methods for solving NP-hard problems will be developed; these will then be implemented and compared to conventional technique approaches, in order to reach general recommendations.
The goal of DAMM is to investigate different aspects of preprocessing taking into consideration other interesting properties of problem kernels, such as the running time for example.
The main focus of AFFA is the investigation of important computational problems in context of fair allocations with respect to their algorithmic tractability.
