Parameterized Algorithms for Generalized Domination (Q5505650): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-540-85097-7_11
+Normal rank
@@ Property / OpenAlex ID @@
+W2132198511
@@ Property / OpenAlex ID: W2132198511 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear Time Algorithms for Finding a Dominating Set of Fixed Size in Degenerated Graphs
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Improved Parameterized Upper Bounds for Vertex Cover
+Normal rank
@@ Property / cites work @@
+Subexponential parameterized algorithms on bounded-genus graphs and             <i>H</i>             -minor-free graphs
+Normal rank
@@ Property / cites work @@
+Q4342632
@@ Property / cites work: Q4342632 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526990
@@ Property / cites work: Q4526990 / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+A threshold of ln             <i>n</i>             for approximating set cover
+Normal rank
@@ Property / cites work @@
+Parametrized complexity theory.
@@ Property / cites work: Parametrized complexity theory. / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+A note on domination in bipartite graphs
@@ Property / cites work: A note on domination in bipartite graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for combinatorial problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+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
@@ links / mardi / name / links / mardi / name @@
+Publication:5505650