Parameterized Complexity and Kernel Bounds for Hard Planning Problems

Open in new window