The Birth and Early Years of Parameterized Complexity (Q2908529): Difference between revisions

@@ Property / cites work @@
+Q4281539
@@ Property / cites work: Q4281539 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness. IV: On completeness for W\([\) P\(]\) and PSPACE analogues
+Normal rank
@@ Property / cites work @@
+Q4273870
@@ Property / cites work: Q4273870 / rank @@
+Normal rank
@@ Property / cites work @@
+Resolution Is Not Automatizable Unless W[P] Is Tractable
+Normal rank
@@ Property / cites work @@
+Color-coding
@@ Property / cites work: Color-coding / rank @@
+Normal rank
@@ Property / cites work @@
+A linear time algorithm for finding tree-decompositions of small treewidth
+Normal rank
@@ Property / cites work @@
+A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+The parameterized complexity of sequence alignment and consensus
+Normal rank
@@ Property / cites work @@
+\(W[2]\)-hardness of precedence constrained \(K\)-processor scheduling
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+On the Structure of Polynomial Time Reducibility
@@ Property / cites work: On the Structure of Polynomial Time Reducibility / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability of graph modification problems for hereditary properties
+Normal rank
@@ Property / cites work @@
+On fixed-parameter tractability and approximability of NP optimization problems
+Normal rank
@@ Property / cites work @@
+On the parameterized complexity of short computation and factorization
+Normal rank
@@ Property / cites work @@
+Advice classes of parametrized tractability
@@ Property / cites work: Advice classes of parametrized tractability / rank @@
+Normal rank
@@ Property / cites work @@
+Q4520519
@@ Property / cites work: Q4520519 / rank @@
+Normal rank
@@ Property / cites work @@
+A Basic Parameterized Complexity Primer
@@ Property / cites work: A Basic Parameterized Complexity Primer / rank @@
+Normal rank
@@ Property / cites work @@
+Q4027320
@@ Property / cites work: Q4027320 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4281497
@@ Property / cites work: Q4281497 / rank @@
+Normal rank
@@ Property / cites work @@
+Fixed-Parameter Tractability and Completeness I: Basic Results
+Normal rank
@@ Property / cites work @@
+Fixed-parameter tractability and completeness II: On completeness for W[1]
+Normal rank
@@ Property / cites work @@
+Q4850549
@@ Property / cites work: Q4850549 / rank @@
+Normal rank
@@ Property / cites work @@
+Threshold dominating sets and an improved characterization of \(W[2]\)
+Normal rank
@@ Property / cites work @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4263467
@@ Property / cites work: Q4263467 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4940885
@@ Property / cites work: Q4940885 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501141
@@ Property / cites work: Q4501141 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity and the \(W\) hierarchy
+Normal rank
@@ Property / cites work @@
+Q4217593
@@ Property / cites work: Q4217593 / rank @@
+Normal rank
@@ Property / cites work @@
+The Parametrized Complexity of Some Fundamental Problems in Coding Theory
+Normal rank
@@ Property / cites work @@
+Uniformly hard languages.
@@ Property / cites work: Uniformly hard languages. / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Randomness and Complexity
@@ Property / cites work: Algorithmic Randomness and Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+The isomorphism problem for torsion-free abelian groups is analytic complete
+Normal rank
@@ Property / cites work @@
+Q3034816
@@ Property / cites work: Q3034816 / rank @@
+Normal rank
@@ Property / cites work @@
+Nonconstructive advances in polynomial-time complexity
+Normal rank
@@ Property / cites work @@
+Nonconstructive tools for proving polynomial-time decidability
+Normal rank
@@ Property / cites work @@
+Q4279511
@@ Property / cites work: Q4279511 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762493
@@ Property / cites work: Q2762493 / rank @@
+Normal rank
@@ Property / cites work @@
+Which problems have strongly exponential complexity?
+Normal rank
@@ Property / cites work @@
+Inferring Evolutionary History From DNA Sequences
@@ Property / cites work: Inferring Evolutionary History From DNA Sequences / rank @@
+Normal rank
@@ Property / cites work @@
+Refining Nondeterminism in Relativized Polynomial-Time Bounded Computations
+Normal rank
@@ Property / cites work @@
+Parameterized complexity of finding subgraphs with hereditary properties.
+Normal rank
@@ Property / cites work @@
+Integer Programming with a Fixed Number of Variables
+Normal rank
@@ Property / cites work @@
+Parameterizing above Guaranteed Values: MaxSat and MaxCut
+Normal rank
@@ Property / cites work @@
+What’s Next? Future Directions in Parameterized Complexity
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Parameterized Derandomization
@@ Property / cites work: Parameterized Derandomization / rank @@
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial-Time Bounded Truth-Table Reducibility of NP Sets to Sparse Sets
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+Q4250206
@@ Property / cites work: Q4250206 / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+NP is as easy as detecting unique solutions
@@ Property / cites work: NP is as easy as detecting unique solutions / rank @@
+Normal rank