The design and analysis of algorithms
The design and analysis of algorithms
On the efficiency of polynomial time approximation schemes
Information Processing Letters
An algorithm for the Tutte polynomials of graphs of bounded treewidth
Discrete Mathematics
Colored Tutte polynomials and Kaufman brackets for graphs of bounded tree width
SODA '01 Proceedings of the twelfth annual ACM-SIAM symposium on Discrete algorithms
Discrete Applied Mathematics - Special issue on international workshop of graph-theoretic concepts in computer science WG'98 conference selected papers
Vertex cover: further observations and further improvements
Journal of Algorithms
Information Processing Letters
Deciding First-Order Properties of Locally Tree-Decomposalbe Graphs
ICAL '99 Proceedings of the 26th International Colloquium on Automata, Languages and Programming
Resolution is Not Automatizable Unless W[P] is Tractable
FOCS '01 Proceedings of the 42nd IEEE symposium on Foundations of Computer Science
Evaluating the Tutte Polynomial for Graphs of Bounded Tree-Width
Combinatorics, Probability and Computing
Parameterized Complexity
Approximation Algorithms for Some Parameterized Counting Problems
ISAAC '02 Proceedings of the 13th International Symposium on Algorithms and Computation
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Efficient algorithms for counting parameterized list H-colorings
Journal of Computer and System Sciences
The parameterized complexity of probability amplification
Information Processing Letters
The parameterized complexity of enumerating frequent itemsets
IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation
| Hi-index | 0.00 |
Parameterized complexity has, so far, been largely confined to consideration of computational problems as decision or search problems. However, it is becoming evident that the parameterized point of view can lead to new insight into counting problems. The goal of this article is to introduce a formal framework in which one may consider parameterized counting problems.