A Basic Parameterized Complexity Primer (Q2908536): Difference between revisions

@@ Property / cites work @@
+Crown structures for vertex cover kernelization
@@ Property / cites work: Crown structures for vertex cover kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Scalable parallel algorithms for FPT problems
@@ Property / cites work: Scalable parallel algorithms for FPT problems / rank @@
+Normal rank
@@ 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 @@
+Q3579375
@@ Property / cites work: Q3579375 / 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 @@
+Studies in Computational Aspects of Voting
@@ Property / cites work: Studies in Computational Aspects of Voting / rank @@
+Normal rank
@@ Property / cites work @@
+Q4845370
@@ Property / cites work: Q4845370 / 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 @@
+Fixed-Parameter Tractability of Treewidth and Pathwidth
+Normal rank
@@ Property / cites work @@
+On Problems without Polynomial Kernels (Extended Abstract)
+Normal rank
@@ Property / cites work @@
+On problems without polynomial kernels
@@ Property / cites work: On problems without polynomial kernels / rank @@
+Normal rank
@@ Property / cites work @@
+Beyond <i>NP</i>-completeness for problems of bounded width (extended abstract)
+Normal rank
@@ Property / cites work @@
+(Meta) Kernelization
@@ Property / cites work: (Meta) Kernelization / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
+Normal rank
@@ Property / cites work @@
+On Interpolation and Automatization for Frege Systems
+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 @@
+The complexity of polynomial-time approximation
@@ Property / cites work: The complexity of polynomial-time approximation / rank @@
+Normal rank
@@ Property / cites work @@
+Q4535023
@@ Property / cites work: Q4535023 / rank @@
+Normal rank
@@ Property / cites work @@
+On the existence of subexponential parameterized algorithms
+Normal rank
@@ Property / cites work @@
+Solving large FPT problems on coarse-grained parallel machines
+Normal rank
@@ Property / cites work @@
+Q4952619
@@ Property / cites work: Q4952619 / rank @@
+Normal rank
@@ Property / cites work @@
+Tight lower bounds for certain parameterized NP-hard problems
+Normal rank
@@ Property / cites work @@
+Lower bounds for kernelizations and other preprocessing procedures
+Normal rank
@@ Property / cites work @@
+Parameterized Complexity and Subexponential-Time Computability
+Normal rank
@@ Property / cites work @@
+A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
+Normal rank
@@ Property / cites work @@
+Improved upper bounds for vertex cover
@@ Property / cites work: Improved upper bounds for vertex cover / rank @@
+Normal rank
@@ Property / cites work @@
+A Parameterized Halting Problem
@@ Property / cites work: A Parameterized Halting Problem / rank @@
+Normal rank
@@ Property / cites work @@
+An Isomorphism Between Subexponential and Parameterized Complexity Theory
+Normal rank
@@ Property / cites work @@
+Q4520519
@@ Property / cites work: Q4520519 / rank @@
+Normal rank
@@ Property / cites work @@
+The Birth and Early Years of Parameterized Complexity
+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 @@
+Fundamentals of parameterized complexity
@@ Property / cites work: Fundamentals of parameterized complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Q4501141
@@ Property / cites work: Q4501141 / rank @@
+Normal rank
@@ Property / cites work @@
+Parameterized approximation of dominating set problems
+Normal rank
@@ Property / cites work @@
+Parameterized circuit complexity and the \(W\) hierarchy
+Normal rank
@@ Property / cites work @@
+Bounded fixed-parameter tractability and reducibility
+Normal rank
@@ Property / cites work @@
+Confronting intractability via parameters
@@ Property / cites work: Confronting intractability via parameters / rank @@
+Normal rank
@@ Property / cites work @@
+Paths, Trees, and Flowers
@@ Property / cites work: Paths, Trees, and Flowers / rank @@
+Normal rank
@@ Property / cites work @@
+Q2768362
@@ Property / cites work: Q2768362 / 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 @@
+Clique-width minimization is NP-hard
@@ Property / cites work: Clique-width minimization is NP-hard / rank @@
+Normal rank
@@ Property / cites work @@
+Clique-Width is NP-Complete
@@ Property / cites work: Clique-Width is NP-Complete / rank @@
+Normal rank
@@ Property / cites work @@
+Q4736854
@@ Property / cites work: Q4736854 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4255109
@@ Property / cites work: Q4255109 / rank @@
+Normal rank
@@ Property / cites work @@
+Intractability of Clique-Width Parameterizations
@@ Property / cites work: Intractability of Clique-Width Parameterizations / rank @@
+Normal rank
@@ Property / cites work @@
+Infeasibility of instance compression and succinct PCPs for NP
+Normal rank
@@ Property / cites work @@
+Deciding first-order properties of locally tree-decomposable structures
+Normal rank
@@ Property / cites work @@
+Q4198056
@@ Property / cites work: Q4198056 / rank @@
+Normal rank
@@ Property / cites work @@
+Backdoors to Satisfaction
@@ Property / cites work: Backdoors to Satisfaction / rank @@
+Normal rank
@@ Property / cites work @@
+Q4474112
@@ Property / cites work: Q4474112 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2762493
@@ Property / cites work: Q2762493 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3118384
@@ Property / cites work: Q3118384 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding topological subgraphs is fixed-parameter tractable
+Normal rank
@@ Property / cites work @@
+Constraint Satisfaction Problems Parameterized above or below Tight Bounds: A Survey
+Normal rank
@@ Property / cites work @@
+A faster FPT algorithm for the maximum agreement forest problem
+Normal rank
@@ Property / cites work @@
+Ordering by Divisibility in Abstract Algebras
@@ Property / cites work: Ordering by Divisibility in Abstract Algebras / rank @@
+Normal rank
@@ Property / cites work @@
+Matroid tree-width
@@ Property / cites work: Matroid tree-width / 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 @@
+Heuristic algorithms in computational molecular biology
+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 @@
+Kernelization – Preprocessing with a Guarantee
@@ Property / cites work: Kernelization – Preprocessing with a Guarantee / rank @@
+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 @@
+Parameterized counting problems
@@ Property / cites work: Parameterized counting problems / rank @@
+Normal rank
@@ Property / cites work @@
+A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
+Normal rank
@@ Property / cites work @@
+Randomized Approximations of Parameterized Counting Problems
+Normal rank
@@ Property / cites work @@
+Q5710169
@@ Property / cites work: Q5710169 / rank @@
+Normal rank
@@ Property / cites work @@
+A general method to speed up fixed-parameter-tractable algorithms
+Normal rank
@@ Property / cites work @@
+Vertex packings: Structural properties and algorithms
+Normal rank
@@ Property / cites work @@
+Q4250206
@@ Property / cites work: Q4250206 / rank @@
+Normal rank
@@ Property / cites work @@
+Finding odd cycle transversals.
@@ Property / cites work: Finding odd cycle transversals. / rank @@
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Über eine Eigenschaft der ebenen Komplexe
@@ Property / cites work: Über eine Eigenschaft der ebenen Komplexe / rank @@
+Normal rank