On treewidth and minimum fill-in of asteroidal triple-free graphs
Ordal'94 Selected papers from the conference on Orders, algorithms and applications
When is the evaluation of conjunctive queries tractable?
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
Treewidth and Minimum Fill-in: Grouping the Minimal Separators
SIAM Journal on Computing
Constraint solving via fractional edge covers
SODA '06 Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm
The complexity of homomorphism and constraint satisfaction problems seen from the other side
Journal of the ACM (JACM)
Exact Algorithms for Treewidth and Minimum Fill-In
SIAM Journal on Computing
Treewidth Computation and Extremal Combinatorics
ICALP '08 Proceedings of the 35th international colloquium on Automata, Languages and Programming, Part I
Set Partitioning via Inclusion-Exclusion
SIAM Journal on Computing
Tractable hypergraph properties for constraint satisfaction and conjunctive queries
Proceedings of the forty-second ACM symposium on Theory of computing
| Hi-index | 0.89 |
Hypergraph width measures are important in studying the complexity of constraint satisfaction problems (CSPs). We present a general exact exponential algorithm for a large variety of these measures. As a consequence, we obtain algorithms which, for a hypergraph H on n vertices and m hyperedges, compute its generalized hypertree-width in time O^@?(2^n) and its fractional hypertree-width in time O(1.734601^n@?m).