Parameterized certificate dispersal and its variants (Q5964075): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Crown structures for vertex cover kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Studying the complexity of global verification for NP-hard discrete optimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernel(s) for problems with no kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds by Cross-Composition / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Turing way to parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4943511 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Forest Orientation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On strong distances in oriented graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743378 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5259180 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A completeness theory for polynomial (Turing) kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability and inapproximability of the minimum certificate dispersal problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximability of minimum certificate dispersal with tree structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Turing kernelization for finding long paths and cycles in restricted graph classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-to-point delivery and connection problems: Complexity and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: The point-to-point connection problem - analysis and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs / rank
 
Normal rank

Latest revision as of 11:37, 11 July 2024

scientific article; zbMATH DE number 6546620
Language Label Description Also known as
English
Parameterized certificate dispersal and its variants
scientific article; zbMATH DE number 6546620

    Statements

    Parameterized certificate dispersal and its variants (English)
    0 references
    0 references
    0 references
    26 February 2016
    0 references
    asymmetric cryptography
    0 references
    algorithmic graph theory
    0 references
    parameterized complexity
    0 references
    Turing kernelization
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers