Polynomial kernels for vertex cover parameterized by small degree modulators (Q2322700): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: How much does a treedepth modulator help to obtain polynomial kernels beyond sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of vertex colouring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved upper bounds for vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfying more than half of a system of linear equations over GF(2): a multivariate approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of losing width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Satisfiability Allows No Nontrivial Sparsification unless the Polynomial-Time Hierarchy Collapses / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Linear-Time Algorithms for Finding Large Cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Towards fully multivariate algorithmics: parameter ecology and the deconstruction of computational complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity ecology of parameters: An illustration using bounded max leaf number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hitting Forbidden Minors: Approximation and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex Cover Structural Parameterization Revisited / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for the max-cut problem on graphs without long odd cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A probabilistic approach to problems parameterized above or below tight bounds / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Smaller Parameters for Vertex Cover Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial algorithm for maximum weighted vertex packings on graphs without long odd cycles / 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: Sparsification upper and lower bounds for graph problems and not-all-equal SAT / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Algorithms for above Average Constraint Satisfaction / 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: Faster Parameterized Algorithms Using Linear Programming / 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: On the Kernelization Complexity of Problems on Graphs without Long Odd Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3392273 / 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

Revision as of 08:43, 20 July 2024

scientific article
Language Label Description Also known as
English
Polynomial kernels for vertex cover parameterized by small degree modulators
scientific article

    Statements

    Polynomial kernels for vertex cover parameterized by small degree modulators (English)
    0 references
    0 references
    0 references
    0 references
    5 September 2019
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    expansion lemma
    0 references
    vertex cover
    0 references
    structural parameterization
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references