Graph minors. V. Excluding a planar graph
Journal of Combinatorial Theory Series B
Relational queries computable in polynomial time
Information and Control
Complexity of finding embeddings in a k-tree
SIAM Journal on Algebraic and Discrete Methods
Easy problems for tree-decomposable graphs
Journal of Algorithms
The spatial complexity of oblivious k-probe Hash functions
SIAM Journal on Computing
Graph rewriting: an algebraic and logic approach
Handbook of theoretical computer science (vol. B)
Monotone monadic SNP and constraint satisfaction
STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Graph minors. XIII: the disjoint paths problem
Journal of Combinatorial Theory Series B
Fixed-parameter tractability and completeness II: on completeness for W[1]
Theoretical Computer Science
Journal of the ACM (JACM)
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
Embedding graphs in an arbitrary surface in linear time
STOC '96 Proceedings of the twenty-eighth annual ACM symposium on Theory of computing
A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
SIAM Journal on Computing
On the complexity of database queries (extended abstract)
PODS '97 Proceedings of the sixteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Conjunctive-query containment and constraint satisfaction
PODS '98 Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Treewidth: Algorithmoc Techniques and Results
MFCS '97 Proceedings of the 22nd International Symposium on Mathematical Foundations of Computer Science
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Finding Minimally Weighted Subgraphs
WG '90 Proceedings of the 16rd International Workshop on Graph-Theoretic Concepts in Computer Science
Linear Time Solvable Optimization Problems on Graphs of Bounded Clique Width
WG '98 Proceedings of the 24th International Workshop on Graph-Theoretic Concepts in 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
Optimal implementation of conjunctive queries in relational data bases
STOC '77 Proceedings of the ninth annual ACM symposium on Theory of computing
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
Graph minors. XVI. excluding a non-planar graph
Journal of Combinatorial Theory Series B
Parameterized Complexity
A Parametric Analysis of the State Explosion Problem in Model Checking
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Fast Counting with Bounded Treewidth
LPAR '08 Proceedings of the 15th International Conference on Logic for Programming, Artificial Intelligence, and Reasoning
Monadic datalog over finite structures of bounded treewidth
ACM Transactions on Computational Logic (TOCL)
Counting and enumeration problems with bounded treewidth
LPAR'10 Proceedings of the 16th international conference on Logic for programming, artificial intelligence, and reasoning
Exploiting bounded treewidth with datalog (a survey)
Datalog'10 Proceedings of the First international conference on Datalog Reloaded
| Hi-index | 0.00 |
Descriptive Complexity Theory studies the complexity of problems of the following type: Given a finite structure A and a sentence Τ of some logic L, decide if A satisfies Τ? In this survey we discuss the parameterized complexity of such problems. Basically, this means that we ask under which circumstances we have an algorithm solving the problem in time f(|Τ|)||A||c, where f is a computable function and c 0 a constant. We argue that the parameterized perspective is most appropriate for analyzing typical practical problems of the above form, which appear for example in database theory, automated verification, and artificial intelligence.