On miniaturized problems in parameterized complexity theory (Q820145): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1016/j.tcs.2005.10.003
+Normal rank
@@ Property / OpenAlex ID @@
+W2165019867
@@ Property / OpenAlex ID: W2165019867 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535023
@@ Property / cites work: Q4535023 / rank @@
+Normal rank
@@ Property / cites work @@
+Linear FPT reductions and computational lower bounds
+Normal rank
@@ Property / cites work @@
+Q2843923
@@ Property / cites work: Q2843923 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4503944
@@ Property / cites work: Q4503944 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithms and Data Structures
@@ Property / cites work: Algorithms and Data Structures / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability, Definability, and Model-Checking
+Normal rank
@@ Property / cites work @@
+Q3396009
@@ Property / cites work: Q3396009 / rank @@
+Normal rank
@@ Property / cites work @@
+Automata, Languages and Programming
@@ Property / cites work: Automata, Languages and Programming / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of \(k\)-SAT
@@ Property / cites work: On the complexity of \(k\)-SAT / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank