Dynamic kernels for hitting sets and set packing (Q2093581): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Removed claim: author (P16): Item:Q1166930
Added link to MaRDI item.
 
(6 intermediate revisions by 6 users not shown)
description / endescription / en
scientific article
scientific article; zbMATH DE number 7608296
Property / DOI
 
Property / DOI: 10.1007/s00453-022-00986-0 / rank
Normal rank
 
Property / author
 
Property / author: Rüdiger Reischuk / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: Publication / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00453-022-00986-0 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2990007591 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Slicewise Definability in First-Order Logic with Bounded Quantifier Rank. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Shortcut to (Sun)Flowers: Kernels in Logarithmic Space or Linear Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q6059165 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal-size problem kernels for \(d\)-Hitting Set in linear time and space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative compression and exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic Parameterized Problems and Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized enumeration, transversals, and imperfect phylogeny reconstruction / 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: Towards optimal and expressive kernelization for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondeterminism within $P^ * $ / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maintaining minimum spanning forests in dynamic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Poly-logarithmic deterministic fully-dynamic algorithms for connectivity, minimum spanning tree, 2-edge, and biconnectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Fully Dynamic Data Structures for Vertex Cover and Matching / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dyn-FO: A parallel, dynamic complexity class / rank
 
Normal rank
Property / cites work
 
Property / cites work: Reachability Is in DynFO / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Dynamic Graph Algorithms for Parameterized Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The vectorization of ITPACK 2C / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263467 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3219751 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Intersection Theorems for Systems of Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing hitting set kernels by \(\mathrm{AC}^0\)-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized approximation via fidelity preserving transformations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1007/S00453-022-00986-0 / rank
 
Normal rank
links / mardi / namelinks / mardi / name

Latest revision as of 01:39, 24 November 2025

scientific article; zbMATH DE number 7608296
Language Label Description Also known as
English
Dynamic kernels for hitting sets and set packing
scientific article; zbMATH DE number 7608296

    Statements

    Dynamic kernels for hitting sets and set packing (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    27 October 2022
    0 references
    kernelization
    0 references
    dynamic algorithms
    0 references
    hitting set
    0 references
    set packings
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers