NP is as easy as detecting unique solutions
Theoretical Computer Science
Nonconstructive advances in polynomial-time complexity
Information Processing Letters
Nonconstructive tools for proving polynomial-time decidability
Journal of the ACM (JACM)
On search decision and the efficiency of polynomial-time algorithms
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
On polynomial-time bounded truth-table reducibility of NP sets to sparse sets
SIAM Journal on Computing
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
Parameterized learning complexity
COLT '93 Proceedings of the sixth annual conference on Computational learning theory
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
The parameterized complexity of sequence alignment and consensus
Theoretical Computer Science
Fixed-Parameter Tractability and Completeness I: Basic Results
SIAM Journal on Computing
On the complexity of bounded-variable queries (extended abstract)
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Fixed-parameter tractability of graph modification problems for hereditary properties
Information Processing Letters
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
Threshold dominating sets and an improved characterization of W[2]
Theoretical Computer Science
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
Checking that finite state concurrent programs satisfy their linear specification
POPL '85 Proceedings of the 12th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
On the Structure of Polynomial Time Reducibility
Journal of the ACM (JACM)
The Parametrized Complexity of Some Fundamental Problems in Coding Theory
SIAM Journal on Computing
The parameterized complexity of database queries
PODS '01 Proceedings of the twentieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
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 for the database theorist
ACM SIGMOD Record
The Parameterized Complexity of Some Problems in Logic and Linguistics
LFCS '94 Proceedings of the Third International Symposium on Logical Foundations of Computer Science
Fixed-Parameter Complexity and Cryptography
AAECC-10 Proceedings of the 10th International Symposium on Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
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
Parameterized Complexity of Finding Subgraphs with Hereditary Properties
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Theoretical Computer Science - Australasian computer science
Perspectives on database theory
FOCS '95 Proceedings of the 36th Annual Symposium on Foundations of Computer Science
The complexity of relational query languages (Extended Abstract)
STOC '82 Proceedings of the fourteenth annual ACM symposium on Theory of computing
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Parameterized Complexity Theory (Texts in Theoretical Computer Science. An EATCS Series)
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
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
On the complexity of fixed parameter problems
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
Conferences vs. journals in computing research
Communications of the ACM - Security in the Browser
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
What's next? future directions in parameterized complexity
The Multivariate Algorithmic Revolution and Beyond
A basic parameterized complexity primer
The Multivariate Algorithmic Revolution and Beyond
The exponential time hypothesis and the parameterized clique problem
IPEC'12 Proceedings of the 7th international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |
Through the hazy lens of (my) memory, I will try to reconstruct how Mike Fellows and I, together with some co-authors in some cases, came up with the basic papers in parameterized complexity.