Q5091010 (Q5091010): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4273870 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Easy problems for tree-decomposable graphs / 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: Reduction algorithms for graphs of small treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automatic generation of linear-time algorithms from predicate calculus descriptions of problems on recursively constructed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds for kernelizations and other preprocessing procedures / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the fixed parameter complexity of graph enumeration problems definable in monadic second-order logic / rank
 
Normal rank
Property / cites work
 
Property / cites work: The monadic second-order logic of graphs. I: Recognizable sets of finite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Monadic second-order evaluations on tree-decomposable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4255109 / rank
 
Normal rank
Property / cites work
 
Property / cites work: AND-compression of NP-complete problems: streamlined proof and minor observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for counting parameterized list \(H\)-colorings / 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: Testing first-order properties for subclasses of sparse graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Tractability, Definability, and Model-Checking / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidimensionality and Geometric Graphs / 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: Generalized model-checking over locally tree-decomposable classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4938635 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3086928 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3118384 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deciding First-Order Properties of Nowhere Dense Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Losing Treewidth by Separating Subsets / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Compressibility of $\mathcal{NP}$ Instances and Cryptographic Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Kernels and Single-Exponential Algorithms Via Protrusion Decompositions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic Meta-theorems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization – Preprocessing with a Guarantee / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms and Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The structure of the models of decidable monadic theories of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5284545 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelizations for Parameterized Counting Problems / rank
 
Normal rank

Revision as of 16:34, 29 July 2024

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

    Statements

    0 references
    0 references
    0 references
    21 July 2022
    0 references
    parameterized counting
    0 references
    compactor
    0 references
    protrusion decomposition
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers