(Meta) kernelization
From MaRDI portal
Recommendations
Cited in
(75)- Reinterpreting the kernel
- Explicit linear kernels for packing problems
- Parameterized algorithms for Max Colorable Induced Subgraph problem on perfect graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Introducing \textsf{lop}-kernels: a framework for kernelization lower bounds
- Preprocessing for outerplanar vertex deletion: an elementary kernel of quartic size
- Partial vertex cover on graphs of bounded degeneracy
- Preprocessing vertex-deletion problems: characterizing graph properties by low-rank adjacencies
- Parameterized analysis and crossing minimization problems
- Lower bounds for protrusion replacement by counting equivalence classes
- Sparse obstructions for minor-covering parameters
- Polynomial kernels for hitting forbidden minors under structural parameterizations
- Kernels for packing and covering problems
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
- Meta-kernelization using well-structured modulators
- Kernelization and approximation of distance-r independent sets on nowhere dense graphs
- Towards a polynomial kernel for directed feedback vertex set
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Meta-kernelization with structural parameters
- Bidimensionality and kernels
- Approximation and kernelization for chordal vertex deletion
- Coverability and sub-exponential parameterized algorithms in planar graphs
- Reducing CMSO model checking to highly connected graphs
- Counting problems in parameterized complexity
- Efficient Graph Minors Theory and Parameterized Algorithms for (Planar) Disjoint Paths
- A Retrospective on (Meta) Kernelization
- Modification to Planarity is Fixed Parameter Tractable
- Lean Tree-Cut Decompositions: Obstructions and Algorithms
- Data-compression for parametrized counting problems on sparse graphs
- Measuring what matters: a hybrid approach to dynamic programming with treewidth
- Towards a polynomial kernel for directed feedback vertex set
- Lossy Kernels for Hitting Subgraphs
- Optimal algorithms for hitting (topological) minors on graphs of bounded treewidth
- Maximum cut parameterized by crossing number
- Hitting minors on bounded treewidth graphs. I: General upper bounds
- Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Meta-kernelization using Well-structured Modulators
- Kernelizations for Parameterized Counting Problems
- First-Order Model-Checking in Random Graphs and Complex Networks
- Approximate Turing Kernelization for Problems Parameterized by Treewidth
- Confluence in data reduction: bridging graph transformation and kernelization
- Confluence in data reduction: bridging graph transformation and kernelization
- Algorithms for outerplanar graph roots and graph roots of pathwidth at most 2
- Treelength of series-parallel graphs
- Hitting Topological Minor Models in Planar Graphs is Fixed Parameter Tractable
- Maximum Shallow Clique Minors in Preferential Attachment Graphs Have Polylogarithmic Size
- scientific article; zbMATH DE number 7764102 (Why is no real title available?)
- Hitting Minors on Bounded Treewidth Graphs. IV. An Optimal Algorithm
- A survey of parameterized algorithms and the complexity of edge modification
- Snakes and Ladders: A Treewidth Story
- Turán’s Theorem Through Algorithmic Lens
- Preprocessing to reduce the search space: antler structures for feedback vertex set
- Search-space reduction via essential vertices
- Lossy planarization: a constant-factor approximate kernelization for planar vertex deletion
- A constant-factor approximation for weighted bond cover
- Approximate Turing kernelization for problems parameterized by treewidth
- Decremental sensitivity oracles for covering and packing minors
- Sunflowers meet sparsity: a linear-vertex kernel for weighted clique-packing on sparse graphs
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
- Polynomial kernel for immersion hitting in tournaments
- Tight bounds for chordal/interval vertex deletion parameterized by treewidth
- Roman cycle hitting set
- Wannabe bounded treewidth graphs admit a polynomial kernel for directed feedback vertex set
- An exponential time parameterized algorithm for planar disjoint paths
- Complexity framework for forbidden subgraphs. I: The framework
- Compound logics for modification problems
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Unified almost linear kernels for generalized covering and packing problems on nowhere dense classes
- Uniform polynomial kernel for deletion to \(K_{2,p}\) minor-free graphs
- Boundaried kernelization
- Editing to a planar graph of given degrees
- Compactors for parameterized counting problems
- Meta-kernelization with structural parameters
This page was built for publication: (Meta) kernelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3177820)
