Fractals for Kernelization Lower Bounds (Q4609787): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Length-bounded cuts and flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized complexity of firefighting / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Refined Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Two-Page Book Embeddings of 4-Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for DAG partitioning / rank
 
Normal rank
Property / cites work
 
Property / cites work: A partial k-arboretum of graphs with bounded treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: (Meta) Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / 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: Advice classes of parametrized tractability / 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: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clique Cover and Graph Separation / 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: Q3577833 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Incompressibility through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Limits to Classical and Quantum Instance Compression / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized Complexity of Length-Bounded Cuts and Multi-cuts / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation via Fidelity Preserving Transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Parameterized Complexity of the Minimum Shared Edges Problem / 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: Some simplified NP-complete graph problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths of bounded length and their cuts: parameterized complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of finding maximum disjoint paths with length constraints / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4904144 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: The k most vital arcs in the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face covers and the genus problem for apex graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Interdiction problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter increase caused by edge deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4782696 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the small cycle transversal of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization for cycle transversal problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank

Revision as of 08:22, 15 July 2024

scientific article; zbMATH DE number 6852743
Language Label Description Also known as
English
Fractals for Kernelization Lower Bounds
scientific article; zbMATH DE number 6852743

    Statements

    Fractals for Kernelization Lower Bounds (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    26 March 2018
    0 references
    parameterized complexity
    0 references
    polynomial-time data reduction
    0 references
    lower bounds
    0 references
    cross-compositions
    0 references
    graph modification problems
    0 references
    interdiction problems
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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