Pages that link to "Item:Q4979840"
From MaRDI portal
The following pages link to Kernelization Lower Bounds by Cross-Composition (Q4979840):
Displaying 50 items.
- On polynomial kernels for sparse integer linear programs (Q269481) (← links)
- Win-win kernelization for degree sequence completion problems (Q295647) (← links)
- Finding shortest paths between graph colourings (Q309791) (← links)
- AND-compression of NP-complete problems: streamlined proof and minor observations (Q309801) (← links)
- Polynomial kernels for weighted problems (Q340549) (← links)
- On the parameterized complexity of computing balanced partitions in graphs (Q493645) (← links)
- On the complexity of computing the \(k\)-restricted edge-connectivity of a graph (Q501666) (← links)
- Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
- Graph editing to a given degree sequence (Q507592) (← links)
- Parameterized complexity of critical node cuts (Q517024) (← links)
- Structural parameterizations of undirected feedback vertex set: FPT algorithms and kernelization (Q722549) (← links)
- Turing kernelization for finding long paths and cycles in restricted graph classes (Q730497) (← links)
- Best-case and worst-case sparsifiability of Boolean CSPs (Q786033) (← links)
- Dual parameterization of weighted coloring (Q786042) (← links)
- Parameterized complexity of independent set in H-free graphs (Q786045) (← links)
- A parameterized complexity view on collapsing \(k\)-cores (Q825978) (← links)
- Interval scheduling and colorful independent sets (Q892898) (← links)
- Scaffolding problems revisited: complexity, approximation and fixed parameter tractable algorithms, and some special cases (Q1635706) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← links)
- Parameterized complexity of superstring problems (Q1679230) (← links)
- On the kernelization complexity of string problems (Q1749539) (← 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)
- Finding temporal paths under waiting time constraints (Q1979453) (← links)
- On the approximate compressibility of connected vertex cover (Q2006945) (← links)
- On parameterized algorithms for fixed-order book thickness with respect to the pathwidth of the vertex ordering (Q2034395) (← links)
- Subexponential parameterized algorithms and kernelization on almost chordal graphs (Q2037110) (← links)
- Sliding window temporal graph coloring (Q2037193) (← links)
- On fixed-order book thickness parameterized by the pathwidth of the vertex ordering (Q2039665) (← links)
- On some FPT problems without polynomial Turing compressions (Q2072079) (← links)
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds (Q2093577) (← links)
- Parameterized complexity of set-restricted disjoint paths on chordal graphs (Q2097221) (← links)
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies (Q2119402) (← links)
- Streaming deletion problems parameterized by vertex cover (Q2140522) (← links)
- Structural parameterization for minimum conflict-free colouring (Q2161251) (← links)
- Parameterized aspects of strong subgraph closure (Q2182097) (← links)
- Matching cut: kernelization, single-exponential time FPT, and exact exponential algorithms (Q2192064) (← links)
- On structural parameterizations of the bounded-degree vertex deletion problem (Q2223699) (← links)
- Refined notions of parameterized enumeration kernels with applications to matching cut enumeration (Q2237892) (← links)
- On explaining integer vectors by few homogeneous segments (Q2256725) (← links)
- Optimal data reduction for graph coloring using low-degree polynomials (Q2272594) (← links)
- Turing kernelization for finding long paths in graph classes excluding a topological minor (Q2272596) (← links)
- Alternative parameterizations of \textsc{Metric Dimension} (Q2285127) (← links)
- On the computational complexity of length- and neighborhood-constrained path problems (Q2294439) (← links)
- On the parameterized complexity of graph modification to first-order logic properties (Q2300624) (← links)
- A multivariate analysis of the strict terminal connection problem (Q2306846) (← links)
- Consensus strings with small maximum distance and small distance sum (Q2309476) (← links)
- Revisiting connected vertex cover: FPT algorithms and lossy kernels (Q2322693) (← links)
- Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700) (← links)
- The parameterized complexity of the minimum shared edges problem (Q2323342) (← links)
