Pages that link to "Item:Q4962171"
From MaRDI portal
The following pages link to Kernelization Lower Bounds Through Colors and IDs (Q4962171):
Displaying 47 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)
- On the complexity of broadcast domination and multipacking In digraphs (Q1979448) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- Exact multi-covering problems with geometric sets (Q2075389) (← links)
- On knot-free vertex deletion: fine-grained parameterized complexity analysis of a deadlock resolution graph problem (Q2078619) (← links)
- Refined parameterizations for computing colored cuts in edge-colored graphs (Q2082563) (← links)
- Twin-width and polynomial kernels (Q2093574) (← links)
- Eternal vertex cover on bipartite graphs (Q2097214) (← links)
- Parameterized complexity of graph burning (Q2161013) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets (Q2316936) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs? (Q2324243) (← links)
- Sparsification upper and lower bounds for graph problems and not-all-equal SAT (Q2408194) (← links)
- On kernelization and approximation for the vector connectivity problem (Q2408198) (← links)
- Extending the kernel for planar Steiner tree to the number of Steiner vertices (Q2408201) (← links)
- The structural complexity landscape of finding balance-fair shortest paths (Q2676473) (← links)
- \(p\)-edge/vertex-connected vertex cover: parameterized and approximation algorithms (Q2677827) (← links)
- Building large \(k\)-cores from sparse graphs (Q2678255) (← links)
- Circumventing connectivity for kernelization (Q2692730) (← links)
- Constrained hitting set problem with intervals (Q2695330) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Unique Covering Problems with Geometric Sets (Q3196414) (← links)
- (Q3304124) (← 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)
