Q5075825 (Q5075825): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3113681 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743378 / 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: Kernelization Lower Bounds Through Colors and IDs / 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: Lossy Kernels for Hitting Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy Kernels for Connected Dominating Set on Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity and approximation results for the connected vertex cover problem in graphs and hypergraphs / 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: Connected Feedback Vertex Set in Planar Graphs / 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: Q5743381 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4967164 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for connected feedback vertex set / 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: The Effect of a Connectivity Requirement on the Complexity of Maximum Subgraph Problems / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:50, 28 July 2024

scientific article; zbMATH DE number 7525514
Language Label Description Also known as
English
No label defined
scientific article; zbMATH DE number 7525514

    Statements

    11 May 2022
    0 references
    parameterized complexity
    0 references
    kernelization
    0 references
    approximation algorithms
    0 references

    Identifiers