Quickly excluding a planar graph
Journal of Combinatorial Theory Series B
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
On the algebraic structure of combinatorial problems
Theoretical Computer Science
List homomorphisms to reflexive graphs
Journal of Combinatorial Theory Series B
Conjunctive-query containment and constraint satisfaction
Journal of Computer and System Sciences - Special issue on the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on principles of database systems
Complexity and Approximation: Combinatorial Optimization Problems and Their Approximability Properties
The Approximability of Constraint Satisfaction Problems
SIAM Journal on Computing
The Parameterized Complexity of Counting Problems
FOCS '02 Proceedings of the 43rd Symposium on Foundations of Computer Science
The Optimal Cost Chromatic Partition Problem for Trees and Interval Graphs
WG '96 Proceedings of the 22nd International Workshop on Graph-Theoretic Concepts in Computer Science
The complexity of counting homomorphisms seen from the other side
Theoretical Computer Science
Full Constraint Satisfaction Problems
SIAM Journal on Computing
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Bi-arc graphs and the complexity of list homomorphisms
Journal of Graph Theory
Communication: Level of repair analysis and minimum cost homomorphisms of graphs
Discrete Applied Mathematics
Generalised integer programming based on logically defined relations
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Constraint optimization problems and bounded tree-width revisited
CPAIOR'12 Proceedings of the 9th international conference on Integration of AI and OR Techniques in Constraint Programming for Combinatorial Optimization Problems
Hi-index | 0.00 |
We study the complexity of structurally restricted homomorphism and constraint satisfaction problems. For every class of relational structures C, let LHOM(C, _) be the problem of deciding whether a structure A ∈ C has a homomorphism to a given arbitrary structure B, when each element in A is only allowed a certain subset of elements of B as its image. We prove, under a certain complexity-theoretic assumption, that this list homomorphism problem is solvable in polynomial time if and only if all structures in C have bounded tree-width. The result is extended to the connected list homomorphism, edge list homomorphism, minimum cost homomorphism and maximum solution problems. We also show an inapproximability result for the minimum cost homomorphism problem.