Lower bounds on kernelization (Q456702): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / 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 / cites work
 
Property / cites work: Vertex Cover: Further Observations and Further Improvements / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Crown reductions for the minimum weighted vertex cover problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4437501 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549693 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some consequences of non-uniform conditions on uniform classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Kernelizations and Other Preprocessing Procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Color-coding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Preprocessing of Min Ones Problems: A Dichotomy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel Bounds for Disjoint Cycles and Disjoint Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability and Completeness I: Basic Results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability and completeness II: On completeness for W[1] / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4850549 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Independent Circuits Contained in a Graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Cubic Kernel for Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Dominating Set in Larger Classes of Graphs: FPT Algorithms and Polynomial Kernels / 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: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5417644 / 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: Betweenness parameterized above tight lower bound / rank
 
Normal rank
Property / cites work
 
Property / cites work: All Ternary Permutation Constraint Satisfaction Problems Parameterized above Average Have Kernels with Quadratic Numbers of Variables / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Generalization of Nemhauser and Trotter's Local Optimization Theorem. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Linear Vertex Kernel for Maximum Internal Spanning Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even Faster Algorithm for Set Splitting! / rank
 
Normal rank

Latest revision as of 19:14, 5 July 2024

scientific article
Language Label Description Also known as
English
Lower bounds on kernelization
scientific article

    Statements

    Lower bounds on kernelization (English)
    0 references
    0 references
    0 references
    0 references
    16 October 2012
    0 references
    0 references
    kernelization
    0 references
    lower bounds
    0 references
    composition algorithms
    0 references
    polynomial parameter transformations
    0 references
    many kernels
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references