How Bad is the Freedom to Flood-It? (Q4622773): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Normalize DOI.
 
(4 intermediate revisions by 4 users not shown)
Property / DOI
 
Property / DOI: 10.7155/jgaa.00486 / rank
Normal rank
 
Property / OpenAlex ID
 
Property / OpenAlex ID: W2911465928 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1804.08236 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On problems without polynomial kernels / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of flood filling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time solvable optimization problems on graphs of bounded clique-width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Tractability and hardness of flood-filling games on trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Survey on the Complexity of Flood-Filling Games / rank
 
Normal rank
Property / cites work
 
Property / cites work: An algorithmic analysis of the Honey-Bee game / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Complexity of Flooding Games on Graphs with Interval Representations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms for Modular-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Grundy number of Cameron graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Flooding games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algorithmic meta-theorems for restrictions of treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Modular decomposition and transitive orientation / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of flood-filling games on graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity of free-flood-it on \(2\times n\) boards / rank
 
Normal rank
Property / cites work
 
Property / cites work: Spanning trees and the complexity of flood-filling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal properties of flood-filling games / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating rank-width and clique-width quickly / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5173160 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simpler Linear-Time Modular Decomposition Via Recursive Factorizing Permutations / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q128457627 / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.7155/JGAA.00486 / rank
 
Normal rank

Latest revision as of 14:52, 30 December 2024

scientific article; zbMATH DE number 7021732
Language Label Description Also known as
English
How Bad is the Freedom to Flood-It?
scientific article; zbMATH DE number 7021732

    Statements

    How Bad is the Freedom to Flood-It? (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    14 February 2019
    0 references
    Fixed-Flood-It
    0 references
    Free-Flood-It
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references