scientific article; zbMATH DE number 5485524
From MaRDI portal
Publication:3549693
Cited in
(39)- On problems without polynomial kernels
- Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
- A multi-parameter analysis of hard problems on deterministic finite automata
- Facility location problems: a parameterized view
- Parameterized complexity of firefighting
- A linear kernel for the complementary maximal strip recovery problem
- Hitting forbidden minors: approximation and kernelization
- Parameterized Complexity of Firefighting Revisited
- On the hardness of losing width
- On cutwidth parameterized by vertex cover
- Kernelization -- preprocessing with a guarantee
- Backdoors to satisfaction
- What's next? Future directions in parameterized complexity
- Kernelization Hardness of Connectivity Problems in d-Degenerate Graphs
- On the Kernelization Complexity of Colorful Motifs
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems
- Towards non-black-box separations of public key encryption and one way function
- Lower bounds for kernelizations and other preprocessing procedures
- A Problem Kernelization for Graph Packing
- Kernelization: new upper and lower bound techniques
- Two edge modification problems without polynomial kernels
- Lower bounds on kernelization
- Guarantees and limits of preprocessing in constraint satisfaction and reasoning
- Depth reduction for composites
- The kernelization complexity of connected domination in graphs with (no) small cycles
- Crossing Paths with Hans Bodlaender: A Personal View on Cross-Composition for Sparsification Lower Bounds
- Lower bounds for kernelizations and other preprocessing procedures
- On the small cycle transversal of planar graphs
- Kernelization of packing problems
- scientific article; zbMATH DE number 7053262 (Why is no real title available?)
- What Is Known About Vertex Cover Kernelization?
- Infeasibility of instance compression and succinct PCPs for NP
- Quadratic kernelization for convex recoloring of trees
- Polynomial Turing compressions for some graph problems parameterized by modular-width
- Probabilistically checkable arguments for all NP
- Polynomial Turing compressions for some graph problems parameterized by modular-width
- Collapsing and separating completeness notions under average-case and worst-case hypotheses
- Fréchet distance between a line and avatar point set
- Linear kernelizations for restricted 3-Hitting Set problems
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3549693)
