SIAM Journal on 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
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
The complexity of counting graph homomorphisms
Proceedings of the ninth international conference on on Random structures and algorithms
Introduction to Algorithms
(H, C, K)-Coloring: Fast, Easy, and Hard Cases
MFCS '01 Proceedings of the 26th International Symposium on Mathematical Foundations of Computer Science
Parameterized Counting Problems
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
The Parameterized Complexity of Counting Problems
SIAM Journal on Computing
The restrictive H-coloring problem
Discrete Applied Mathematics - Structural decompositions, width parameters, and graph labelings (DAS 5)
Parameterized counting algorithms for general graph covering problems
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Finding odd cycle transversals
Operations Research Letters
Parameterized Complexity
Finding small separators in linear time via treewidth reduction
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
We study the fixed parameter tractability of the counting version of a parameterization of the restrictive list H-coloring problem. The parameterization is defined by fixing the number of preimages of a subset C of the vertices in H through a weight assignment K on C. We show the fixed parameter tractability of counting the number of list (H,C,K)-colorings, for the case in which (H,C,K) is simple. We introduce the concept of compactor and a new algorithmic technique, compactor enumeration, that allow us to design fixed parameter algorithms for parameterized counting problems.