An application of the Planar Separator Theorem to counting problems

Authors:
S. S. Ravi;H.B. Hunt, III
Affiliations:
State Univ. of New York at Albany, Albany, NY;State Univ. of New York at Albany, Albany, NY
Venue:
Information Processing Letters
Year:
1987

Exploiting structure in quantified formulas

Journal of Algorithms
Graph separators: a parameterized view

Journal of Computer and System Sciences - Special issue on Parameterized computation and complexity
Exact Max 2-Sat: Easier and Faster

SOFSEM '07 Proceedings of the 33rd conference on Current Trends in Theory and Practice of Computer Science
Theory and application of width bounded geometric separators

Journal of Computer and System Sciences
Theory and application of width bounded geometric separator

STACS'06 Proceedings of the 23rd Annual conference on Theoretical Aspects of Computer Science
On the effective enumerability of NP problems

IWPEC'06 Proceedings of the Second international conference on Parameterized and Exact Computation

Hi-index	0.89