A Survey on the Complexity of Flood-Filling Games (Q6163636): Difference between revisions

@@ Property / cites work @@
+The hardness of perfect phylogeny, feasible register assignment and other problems on thin colored graphs
+Normal rank
@@ Property / cites work @@
+Connected Coloring Completion for General Graphs: Algorithms and Complexity
+Normal rank
@@ Property / cites work @@
+The complexity of flood filling games
@@ Property / cites work: The complexity of flood filling games / rank @@
+Normal rank
@@ Property / cites work @@
+The Flood-It game parameterized by the vertex cover number
+Normal rank
@@ Property / cites work @@
+Sharp Tractability Borderlines for Finding Connected Motifs in Vertex-Colored Graphs
+Normal rank
@@ Property / cites work @@
+Analogs &amp; duals of the MAST problem for sequences &amp; trees
+Normal rank
@@ Property / cites work @@
+Algorithms, kernels and lower bounds for the flood-it game parameterized by the vertex cover number
+Normal rank
@@ Property / cites work @@
+Tractability and hardness of flood-filling games on trees
+Normal rank
@@ Property / cites work @@
+On Complexity of Flooding Games on Graphs with Interval Representations
+Normal rank
@@ Property / cites work @@
+On the complexity of DNA physical mapping
@@ Property / cites work: On the complexity of DNA physical mapping / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient algorithms for inferring evolutionary trees
+Normal rank
@@ Property / cites work @@
+Flooding games on graphs
@@ Property / cites work: Flooding games on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic meta-theorems for restrictions of treewidth
+Normal rank
@@ Property / cites work @@
+Triangulating Vertex-Colored Graphs
@@ Property / cites work: Triangulating Vertex-Colored Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of flood-filling games on graphs
@@ Property / cites work: The complexity of flood-filling games on graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of free-flood-it on \(2\times n\) boards
+Normal rank
@@ Property / cites work @@
+Spanning trees and the complexity of flood-filling games
+Normal rank
@@ Property / cites work @@
+More on the complexity of common superstring and supersequence problems
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Call routing and the ratcatcher
@@ Property / cites work: Call routing and the ratcatcher / rank @@
+Normal rank
@@ Property / cites work @@
+An algorithmic analysis of the Honey-Bee game
@@ Property / cites work: An algorithmic analysis of the Honey-Bee game / rank @@
+Normal rank
@@ Property / cites work @@
+The shortest common supersequence problem over binary alphabet is NP- complete
+Normal rank
@@ Property / cites work @@
+The consensus string problem for a metric is NP-complete
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity of Flood-Filling Games on Trees
+Normal rank
@@ Property / cites work @@
+Q5173160
@@ Property / cites work: Q5173160 / rank @@
+Normal rank