Parameterized certificate dispersal and its variants
type: Item
instance of: scholarly article
title: Parameterized certificate dispersal and its variants
zbMATH Open document ID: 1335.68104
author: Valentin Garnero
author: Mathias Weller
published in: Theoretical Computer Science
publication date: 2016-02-26T00:00:00Z
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 94A60
zbMATH DE Number: 6546620
zbMATH Keywords: asymmetric cryptography
zbMATH Keywords: algorithmic graph theory
zbMATH Keywords: parameterized complexity
zbMATH Keywords: Turing kernelization
MaRDI profile type: Publication
full work available at URL: j.tcs.2016.02.001
OpenAlex ID: W2263465034
cites work: Crown structures for vertex cover kernelization
cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
cites work: Studying the complexity of global verification for NP-hard discrete optimization problems
cites work: Kernel(s) for problems with no kernel
cites work: Kernelization Lower Bounds by Cross-Composition
cites work: The Turing way to parameterized complexity
cites work: Q4943511
cites work: Improved Algorithms for Vertex Cover with Hard Capacities on Multigraphs and Hypergraphs
cites work: Graph-Theoretic Concepts in Computer Science
cites work: Steiner forest orientation problems
cites work: On strong distances in oriented graphs
cites work: Q5743378
cites work: Fundamentals of parameterized complexity
cites work: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
cites work: Q5259180
cites work: Parametrized complexity theory.
cites work: Q4198056
cites work: A completeness theory for polynomial (Turing) kernelization
cites work: Approximability and inapproximability of the minimum certificate dispersal problem
cites work: Approximability of minimum certificate dispersal with tree structures
cites work: Turing kernelization for finding long paths and cycles in restricted graph classes
cites work: Q4967164
cites work: The point-to-point delivery and connection problems: Complexity and algorithms
cites work: The point-to-point connection problem - analysis and algorithms
cites work: Vertex packings: Structural properties and algorithms
cites work: Q5710169
cites work: A Polynomial Turing-Kernel for Weighted Independent Set in Bull-Free Graphs
DOI: 10.1016/J.TCS.2016.02.001
Recommended article: Optimal Dispersal of Certificate Chains
Recommended article: Stabilizing Certificate Dispersal
Recommended article: A Model for Distribution and Revocation of Certificates
Recommended article: Relationship between Approximability and Request Structures in the Minimum Certificate Dispersal Problem
Recommended article: Approximability and inapproximability of the minimum certificate dispersal problem
Recommended article: Approximability of minimum certificate dispersal with tree structures
Recommended article: Minimum Certificate Dispersal with Tree Structures
description: scientific article; zbMATH DE number 6546620