10 citations · 10 across the 2 of their papers we have counts for
4 papers
Defensive Alliances in Graphs of Bounded Treewidth
Bernhard Bliem, Stefan Woltran
A set S of vertices of a graph is a defensive alliance if, for each element of S, the majority of its neighbors is in S. The problem of finding a defensive alliance of minimum size…
Clique-Width and Directed Width Measures for Answer-Set Programming
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
Disjunctive Answer Set Programming (ASP) is a powerful declarative programming paradigm whose main decision problems are located on the second level of the polynomial hierarchy. Id…
Complexity of Secure Sets
Bernhard Bliem, Stefan Woltran
A secure set in a graph is defined as a set of vertices such that for any the majority of vertices in the neighborhood of belongs to . It is known that de…
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming
Bernhard Bliem, Michael Morak, Stefan Woltran
In this work, we propose Answer-Set Programming (ASP) as a tool for rapid prototyping of dynamic programming algorithms based on tree decompositions. In fact, many such algorithms…