Nonconstructive advances in polynomial-time complexity
Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
A linear time algorithm for finding tree-decompositions of small treewidth
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
STOC '94 Proceedings of the twenty-sixth annual ACM symposium on Theory of computing
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
Efficient and constructive algorithms for the pathwidth and treewidth of graphs
Journal of Algorithms
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Parameterized circuit complexity and the W hierarchy
Theoretical Computer Science
A polynomial time approximation scheme for general multiprocessor job scheduling (extended abstract)
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
A Linear Time Algorithm for Embedding Graphs in an Arbitrary Surface
SIAM Journal on Discrete Mathematics
Parameterizing above guaranteed values: MaxSat and MaxCut
Journal of Algorithms
The maximum subforest problem: approximation and exact algorithms
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
A PTAS for the multiple knapsack problem
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
A general method to speed up fixed-parameter-tractable algorithms
Information Processing Letters
On Interpolation and Automatization for Frege Systems
SIAM Journal on Computing
Polynomial-time approximation schemes for geometric graphs
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Deciding first-order properties of locally tree-decomposable structures
Journal of the ACM (JACM)
Which problems have strongly exponential complexity?
Journal of Computer and System Sciences
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
Parameterized complexity of finding subgraphs with hereditary properties
Theoretical Computer Science
The Parameterized Complexity of Counting Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Parameterized Complexity of Some Problems in Logic and Linguistics
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
The Complexity of First-Order and Monadic Second-Order Logic Revisited
LICS '02 Proceedings of the 17th Annual IEEE Symposium on Logic in Computer Science
Subexponential Parameterized Algorithms Collapse the W-Hierarchy
ICALP '01 Proceedings of the 28th International Colloquium on Automata, Languages and Programming,
Fixed-Parameter Intractability II (Extended Abstract)
STACS '93 Proceedings of the 10th Annual Symposium on Theoretical Aspects of Computer Science
Generalized Model-Checking Problems for First-Order Logic
STACS '01 Proceedings of the 18th Annual Symposium on Theoretical Aspects of Computer Science
Describing Parameterized Complexity Classes
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Nearly linear time approximation schemes for Euclidean TSP and other geometric problems
FOCS '97 Proceedings of the 38th Annual Symposium on Foundations of Computer Science
Polynomial time approximation schemes for Euclidean TSP and other geometric problems
FOCS '96 Proceedings of the 37th Annual Symposium on Foundations of Computer Science
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Solving large FPT problems on coarse-grained parallel machines
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
On the existence of subexponential parameterized algorithms
Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Clique-width minimization is NP-hard
Proceedings of the thirty-eighth annual ACM symposium on Theory of computing
Scalable Parallel Algorithms for FPT Problems
Algorithmica
European Journal of Combinatorics - Special issue on Eurocomb'03 - graphs and combinatorial structures
A Faster FPT Algorithm for the Maximum Agreement Forest Problem
Theory of Computing Systems
The Complexity of Polynomial-Time Approximation
Theory of Computing Systems
Crown Structures for Vertex Cover Kernelization
Theory of Computing Systems
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
An Isomorphism Between Subexponential and Parameterized Complexity Theory
SIAM Journal on Computing
Approximation of Natural W[P]-Complete Minimisation Problems Is Hard
CCC '08 Proceedings of the 2008 IEEE 23rd Annual Conference on Computational Complexity
An analogue of the Myhill-Nerode theorem and its use in computing finite-basis characterizations
SFCS '89 Proceedings of the 30th Annual Symposium on Foundations of Computer Science
Inferring evolutionary history from DNA sequences
SFCS '90 Proceedings of the 31st Annual Symposium on Foundations of Computer Science
SFCS '94 Proceedings of the 35th Annual Symposium on Foundations of Computer Science
On Problems without Polynomial Kernels (Extended Abstract)
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Parameterized approximation of dominating set problems
Information Processing Letters
Exact Solutions for Closest String and Related Problems
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
On problems without polynomial kernels
Journal of Computer and System Sciences
SIAM Journal on Discrete Mathematics
Tight lower bounds for certain parameterized NP-hard problems
Information and Computation
FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Improved upper bounds for vertex cover
Theoretical Computer Science
Infeasibility of instance compression and succinct PCPs for NP
Journal of Computer and System Sciences
Heuristic algorithms in computational molecular biology
Journal of Computer and System Sciences
Intractability of Clique-Width Parameterizations
SIAM Journal on Computing
Lower Bounds for Kernelizations and Other Preprocessing Procedures
Theory of Computing Systems
Finding topological subgraphs is fixed-parameter tractable
Proceedings of the forty-third annual ACM symposium on Theory of computing
Randomized approximations of parameterized counting problems
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
Finding odd cycle transversals
Operations Research Letters
Fixed-Parameter tractability, a prehistory,
The Multivariate Algorithmic Revolution and Beyond
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
The impact of parameterized complexity to interdisciplinary problem solving
The Multivariate Algorithmic Revolution and Beyond
Kernelization --- preprocessing with a guarantee
The Multivariate Algorithmic Revolution and Beyond
Parameterized complexity and subexponential-time computability
The Multivariate Algorithmic Revolution and Beyond
Fixed-Parameter tractability of treewidth and pathwidth
The Multivariate Algorithmic Revolution and Beyond
Graph minors and parameterized algorithm design
The Multivariate Algorithmic Revolution and Beyond
Constraint satisfaction problems parameterized above or below tight bounds: a survey
The Multivariate Algorithmic Revolution and Beyond
The Multivariate Algorithmic Revolution and Beyond
Studies in computational aspects of voting: open problems of downey and fellows
The Multivariate Algorithmic Revolution and Beyond
A parameterized halting problem
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
Parallel vertex cover: a case study in dynamic load balancing
AusPDC '11 Proceedings of the Ninth Australasian Symposium on Parallel and Distributed Computing - Volume 118
The Bidimensionality Theory and Its Algorithmic Applications 1
The Computer Journal
Combinatorial Optimization on Graphs of Bounded Treewidth
The Computer Journal
The birth and early years of parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
| Hi-index | 0.00 |
This article was prepared for Mike Fellows Festschrift for his 60th Birthday. Since many of the contributed articles revolve around the concept of parameterized complexity, it seems reasonable to give the reader a (short) primer to this area. It is not intended as a complete survey of this very broad area in its current state; rather it is intended to give a flavour of the techniques used and the directions taken. Whilst not doing the area justice, the basics of the techniques for proving tractability, establishing hardness, and the philosophy are given. The basics from this paper will be amplified by many other articles in this Festschrift. Much fuller accounts can be found in the books Downey-Fellows [DF98, DFta], Niedermeier [Nie06], Flum-Grohe [FG06], the two issues of the Computer Journal[DFL08] and the recent survey Downey-Thilikos [DTH11].