The following pages link to Lower bounds on kernelization (Q456702):
Displaying 12 items.
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Meta-kernelization with structural parameters (Q896025) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- Parameterized complexity of machine scheduling: 15 open problems (Q1782183) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Tractability, hardness, and kernelization lower bound for and/or graph solution (Q2410230) (← links)
- Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Studies in Computational Aspects of Voting (Q2908543) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Bidimensionality and Kernels (Q3387764) (← links)
- Parameterized algorithms and data reduction for the short secluded <i>s</i>‐<i>t</i>‐path problem (Q6068532) (← links)
