Vertex Cover, Dominating Set and My Encounters with Parameterized Complexity and Mike Fellows (Q2908533): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-642-30891-8_6
+Normal rank
@@ Property / OpenAlex ID @@
+W113281379
@@ Property / OpenAlex ID: W113281379 / rank @@
+Normal rank
@@ Property / cites work @@
+An improved fixed-parameter algorithm for vertex cover
+Normal rank
@@ Property / cites work @@
+Sorting, Minimal Feedback Sets, and Hamilton Paths in Tournaments
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+The complexity of irredundant sets parameterized by size
+Normal rank
@@ Property / cites work @@
+A Constructive Solution to a Tournament Problem
@@ Property / cites work: A Constructive Solution to a Tournament Problem / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+On finding a minimum dominating set in a tournament
+Normal rank
@@ Property / cites work @@
+On limited nondeterminism and the complexity of the V-C dimension
+Normal rank
@@ Property / cites work @@
+Short cycles make \(W\)-hard problems hard: FPT algorithms for \(W\)-hard problems in graphs with no short cycles
+Normal rank