Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (Q5009611): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Set OpenAlex properties.
 
(One intermediate revision by one other user not shown)
label / enlabel / en
 
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.
Property / cites work
 
Property / cites work: Q3113683 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Structural Parameterization Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: Infeasibility of instance compression and succinct PCPs for NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization using structural parameters on sparse graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform Kernelization Complexity of Hitting Forbidden Minors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover kernelization revisited. Upper and lower bounds for a refined parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Randomized Polynomial Kernelization for Vertex Cover with a Smaller Parameter / rank
 
Normal rank
Property / cites work
 
Property / cites work: Representative Sets and Irrelevant Vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Parameterizations of Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5363786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sparsity. Graphs, structures, and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Space Efficiency of Algorithms Working on Structural Decompositions of Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Faster Parameterized Algorithm for Treedepth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. V. Excluding a planar graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 4 <i>k</i> <sup>2</sup> kernel for feedback vertex set / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.4230/LIPIcs.ESA.2018.48 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3043016546 / rank
 
Normal rank
Property / title
 
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (English)
Property / title: Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (English) / rank
 
Normal rank

Latest revision as of 09:01, 30 July 2024

scientific article; zbMATH DE number 7378718
Language Label Description Also known as
English
Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations.
scientific article; zbMATH DE number 7378718

    Statements

    0 references
    0 references
    4 August 2021
    0 references
    kernelization
    0 references
    \(\mathcal{F}\)-minor free deletion
    0 references
    treedepth modulator
    0 references
    structural parameterization
    0 references
    Polynomial Kernels for Hitting Forbidden Minors under Structural Parameterizations. (English)
    0 references

    Identifiers