Meta-kernelization using Well-structured Modulators

DOI10.4230/LIPIcs.IPEC.2015.114zbMath1378.68073OpenAlexW2771139435MaRDI QIDQ5363765

Robert Ganian, Stefan Szeider, Eduard Eiben

Publication date: 29 September 2017

Full work available at URL: https://doi.org/10.4230/LIPIcs.IPEC.2015.114

zbMATH Keywords

parameterized complexitystructural parameterskernelizationrank-widthsplit decompositions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Nonnumerical algorithms (68W05)

Related Items (11)

A Fixed-Parameter Tractable Algorithm for Elimination Distance to Bounded Degree Graphs ⋮ A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion ⋮ On Structural Parameterizations of the Bounded-Degree Vertex Deletion Problem ⋮ Meta-kernelization using well-structured modulators ⋮ Meta-kernelization with structural parameters ⋮ Solving problems on graphs of high rank-width ⋮ Backdoor Sets for CSP. ⋮ On structural parameterizations of the bounded-degree vertex deletion problem ⋮ On the Parameterized Complexity of Clique Elimination Distance ⋮ Backdoors into heterogeneous classes of SAT and CSP ⋮ How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?

This page was built for publication: Meta-kernelization using Well-structured Modulators