Algorithmics for Hard Problems

We analyze hard problems, for which there are probably no efficient algorithms. To this end, we consider several approaches in order to cope with the algorithmic hardness of such problems, such as fixed-parameter algorithms, approximation algorithms, exponential time algorithms, and the restriction to special instances. Further we are interested in useful properties and relations of graph parameters and graph classes.

Office Address

Group Algorithmics for Hard Problems
Building 25.13 Level O2
Universitätsstraße 1
40225 Düsseldorf

Germany

Section head

PD Dr. Frank Gurski

Building: 25.13
Floor/Room: O2.35
Phone +49 211 81-13713
Fax +49 211 81-13462
Responsible for the content: E-MailWE Informatik