12 citations · 15 across the 2 of their papers we have counts for
2 papers
cs.DS2022★ 3 cited
Threshold Treewidth and Hypertree Width
Andre Schidler, Robert Ganian, Manuel Sorge +1
Treewidth and hypertree width have proven to be highly successful structural parameters in the context of the Constraint Satisfaction Problem (CSP). When either of these parameters…
cs.LO2012★ 12 cited
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough
Reinhard Pichler, Stefan Rümmele, Stefan Szeider +1
Cardinality constraints or, more generally, weight constraints are well recognized as an important extension of answer-set programming. Clearly, all common algorithmic tasks relate…