9 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.DS2009
A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds
G. Gutin, E. J. Kim, S. Szeider +1
We introduce a new approach for establishing fixed-parameter tractability of problems parameterized above tight lower bounds. To illustrate the approach we consider three problems…
cs.DS2006★ 9 cited
A Fixed-Parameter Algorithm for #SAT with Parameter Incidence Treewidth
Marko Samer, Stefan Szeider
We present an efficient fixed-parameter algorithm for #SAT parameterized by the incidence treewidth, i.e., the treewidth of the bipartite graph whose vertices are the variables and…