Periodic Reporting for period 1 - PARAPATH (Parameterized Complexity Through the Lens of Path Problems)

Nowadays, numerous problems are known to be NP-hard, and hence unlikely to admit worst-case efficient algorithms. Fortunately, the field of Parameterized Complexity (PC) shows that the nutshell of hardness often lies in particular properties (called parameters) of the...