The following pages link to (Q3549693):
Displaying 27 items.
- Lower bounds on kernelization (Q456702) (← links)
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning (Q460604) (← links)
- The kernelization complexity of connected domination in graphs with (no) small cycles (Q476436) (← links)
- Lower bounds for kernelizations and other preprocessing procedures (Q538466) (← links)
- On the small cycle transversal of planar graphs (Q551170) (← links)
- Infeasibility of instance compression and succinct PCPs for NP (Q619903) (← links)
- Quadratic kernelization for convex recoloring of trees (Q639283) (← links)
- Collapsing and separating completeness notions under average-case and worst-case hypotheses (Q693053) (← links)
- Fréchet distance between a line and avatar point set (Q722543) (← links)
- Linear kernelizations for restricted 3-Hitting Set problems (Q989471) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number (Q1752485) (← links)
- A multi-parameter analysis of hard problems on deterministic finite automata (Q2256724) (← links)
- Facility location problems: a parameterized view (Q2275913) (← links)
- Parameterized complexity of firefighting (Q2453548) (← links)
- A linear kernel for the complementary maximal strip recovery problem (Q2453554) (← links)
- Hitting Forbidden Minors: Approximation and Kernelization (Q2790404) (← links)
- Parameterized Complexity of Firefighting Revisited (Q2891334) (← links)
- On the Hardness of Losing Width (Q2891345) (← links)
- On Cutwidth Parameterized by Vertex Cover (Q2891354) (← links)
- Kernelization – Preprocessing with a Guarantee (Q2908537) (← links)
- Backdoors to Satisfaction (Q2908542) (← links)
- What’s Next? Future Directions in Parameterized Complexity (Q2908548) (← links)
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs (Q3057621) (← links)
- On the Kernelization Complexity of Colorful Motifs (Q3058688) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Towards Non-Black-Box Separations of Public Key Encryption and One Way Function (Q3181026) (← links)
