43 citations · 55 across the 3 of their papers we have counts for
3 papers
cs.DS2007★ 43 cited
A Backtracking-Based Algorithm for Computing Hypertree-Decompositions
Georg Gottlob, Marko Samer
Hypertree decompositions of hypergraphs are a generalization of tree decompositions of graphs. The corresponding hypertree-width is a measure for the cyclicity and therefore tracta…
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.DM2006★ 3 cited
Complexity and Applications of Edge-Induced Vertex-Cuts
Marko Samer, Stefan Szeider
Motivated by hypergraph decomposition algorithms, we introduce the notion of edge-induced vertex-cuts and compare it with the well-known notions of edge-cuts and vertex-cuts. We in…