Pages that link to "Item:Q4962171"
From MaRDI portal
The following pages link to Kernelization Lower Bounds Through Colors and IDs (Q4962171):
Displaying 9 items.
- Lower bounds for the happy coloring problems (Q5918935) (← links)
- Finding large degree-anonymous subgraphs is hard (Q5964077) (← links)
- On the lossy kernelization for connected treedepth deletion set (Q6043184) (← links)
- Serial and parallel kernelization of multiple hitting set parameterized by the Dilworth number, implemented on the GPU (Q6078297) (← links)
- Parameterized Complexity of Graph Burning (Q6089668) (← links)
- Essentially tight kernels for (weakly) closed graphs (Q6103524) (← links)
- An ETH-tight algorithm for bidirected Steiner connectivity (Q6139039) (← links)
- Balanced substructures in bicolored graphs (Q6169522) (← links)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)