On the Fixed-Parameter Tractability of Some Matching Problems Under the Color-Spanning Model (Q4632199): Difference between revisions

@@ Property / cites work @@
+Q4796181
@@ Property / cites work: Q4796181 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of multiple-interval graph problems
+Normal rank
@@ Property / cites work @@
+Computing Minimum Diameter Color-Spanning Sets
@@ Property / cites work: Computing Minimum Diameter Color-Spanning Sets / rank @@
+Normal rank
@@ Property / cites work @@
+Computing minimum diameter color-spanning sets is hard
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+On some geometric problems of color-spanning sets
@@ Property / cites work: On some geometric problems of color-spanning sets / rank @@
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of the induced matching problem
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding regular induced subgraphs
+Normal rank
@@ Property / cites work @@
+Q3694703
@@ Property / cites work: Q3694703 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3002782
@@ Property / cites work: Q3002782 / rank @@
+Normal rank