More Efficient Algorithms for Polynomial-Time Solvable Graph Problems (FPTinP) The central goal of this project is to extend the focus of parametrized algorithmics from NP-hard problems to polynomial-time solvable problems.
