Our research focuses on the investigation of hard problems for which there are probably no efficient algorithms. We consider different methods to address the algorithmic hardness of such problems, such as fixed-parameter algorithms, approximation algorithms, exponential time algorithms, and the restriction to specific instances. Furthermore, we investigate useful properties and relations of graph parameters and graph classes. While doing so the main focus is on directed graphs.
Group Algorithmics for Hard Problems
Building 25.13 Level O2