Boundaried kernelization
From MaRDI portal
Cites work
- (Meta) kernelization
- A 4k^2 kernel for feedback vertex set
- A cubic kernel for feedback vertex set and loop cutset
- A Retrospective on (Meta) Kernelization
- A structural approach to kernels for ILPs: treewidth and total unimodularity
- A Turing kernelization dichotomy for structural parameterizations of \(\mathcal{F} \)-minor-free deletion
- An algebraic theory of graph reduction
- An improved kernelization algorithm for trivially perfect editing
- Approximate Turing kernelization and lower bounds for domination problems
- Bidimensionality and kernels
- Cluster editing: kernelization based on edge cuts
- Crown structures for vertex cover kernelization
- Difference determines the degree: structural kernelizations of component order connectivity
- Dynamic Sketching for Graph Optimization Problems with Applications to Cut-Preserving Sketches
- Elimination Distances, Blocking Sets, and Kernels for Vertex Cover
- Graph theory
- Graph-modeled data clustering: Exact algorithms for clique generation
- How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs?
- Incompressibility through Colors and IDs
- Kernelization dichotomies for hitting subgraphs under structural parameterizations
- Kernelization for counting problems on graphs: preserving the number of minimum solutions
- Kernelization for finding lineal topologies (depth-first spanning trees) with many or few leaves
- Kernelization for graph packing problems via rainbow matching
- Kernelization for spreading points
- Kernelization Lower Bounds by Cross-Composition
- Kernelization of counting problems
- Kernelization. Theory of parameterized preprocessing
- Kernels for (connected) dominating set on graphs with excluded topological minors
- Linear-time FPT algorithms via network flow
- Lossy kernelization for (implicit) hitting set problems
- Lower bounds for protrusion replacement by counting equivalence classes
- Meta-kernelization with structural parameters
- Parameterized complexity and kernelizability of max ones and exact ones problems
- Preprocessing of min ones problems: a dichotomy
- Preprocessing under uncertainty
- Preprocessing under uncertainty: matroid intersection
- Reduction algorithms for graphs of small treewidth
- Representative sets and irrelevant vertices: new tools for kernelization
- Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
- Space-efficient graph kernelizations
- The complexity ecology of parameters: An illustration using bounded max leaf number
- Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter
- Vertex cover: Further observations and further improvements
This page was built for publication: Boundaried kernelization
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294417)
