Pages that link to "Item:Q4962171"
From MaRDI portal
The following pages link to Kernelization Lower Bounds Through Colors and IDs (Q4962171):
Displaying 21 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Parameterized complexity dichotomy for \textsc{Steiner Multicut} (Q295637) (← links)
- Polynomial kernels and user reductions for the workflow satisfiability problem (Q309799) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Exploiting hidden structure in selecting dimensions that distinguish vectors (Q899584) (← links)
- Multivariate complexity analysis of geometric \textsc{Red Blue Set Cover} (Q1679222) (← links)
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs (Q1755775) (← links)
- The parameterized complexity of finding secluded solutions to some classical optimization problems on graphs (Q1756342) (← links)
- How Bad is the Freedom to Flood-It? (Q4622773) (← links)
- Dual parameterization of Weighted Coloring (Q5009474) (← links)
- (Q5009490) (← links)
- (Q5075825) (← links)
- (Q5089202) (← links)
- (Q5116487) (← links)
- Parameterized Complexity of Safe Set (Q5119377) (← links)
- The Maximum Colorful Arborescence problem parameterized by the structure of its color hierarchy graph (Q5140781) (← links)
- Approximate Turing Kernelization for Problems Parameterized by Treewidth (Q5874531) (← 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)
- Constrained hitting set problem with intervals: hardness, FPT and approximation algorithms (Q6201335) (← links)
