58 citations · 327 across the 60 of their papers we have counts for
Showing 2006 · cs.DSShow all
2 papers · 2 filters
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…
cs.DS2006★ 3 cited
Fixed-Parameter Complexity of Minimum Profile Problems
Gregory Gutin, Stefan Szeider, Anders Yeo
Let be a graph. An ordering of is a bijection $α: V\dom \{1,2,..., |V|\}.$ For a vertex in , its closed neighborhood is T…