Meta-kernelization using Well-structured Modulators
From MaRDI portal
Recommendations
- Meta-kernelization using well-structured modulators
- Meta-kernelization with structural parameters
- Meta-kernelization with structural parameters
- (Meta) kernelization
- A Retrospective on (Meta) Kernelization
- scientific article; zbMATH DE number 5957287
- Model-based transductive learning of the kernel matrix
- Model-based transductive learning of the kernel matrix
Cited in
(15)- Backdoors into heterogeneous classes of SAT and CSP
- Meta-kernelization with structural parameters
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Kernelization using structural parameters on sparse graph classes
- On the Parameterized Complexity of Clique Elimination Distance
- Backdoor sets for CSP
- On structural parameterizations of the bounded-degree vertex deletion problem
- An FPT algorithm for elimination distance to bounded degree graphs
- Meta-kernelization with structural parameters
- A fixed-parameter tractable algorithm for elimination distance to bounded degree graphs
- Solving problems on graphs of high rank-width
- Meta-kernelization using well-structured modulators
- A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion
- On structural parameterizations of the bounded-degree vertex deletion problem
- Solving problems on graphs of high rank-width
This page was built for publication: Meta-kernelization using Well-structured Modulators
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5363765)
