The following pages link to Bernhard Bliem (Q722533):
Displaying 15 items.
- Complexity of secure sets (Q722534) (← links)
- Defensive alliances in graphs of bounded treewidth (Q1627877) (← links)
- ASP programs with groundings of small treewidth (Q1647477) (← links)
- Equivalence between answer-set programs under (partially) fixed input (Q1783736) (← links)
- Equivalence Between Answer-Set Programs Under (Partially) Fixed Input (Q2807074) (← links)
- Complexity of Secure Sets (Q2827802) (← links)
- Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem (Q2867070) (← links)
- The D-FLAT System for Dynamic Programming on Tree Decompositions (Q2938522) (← links)
- Implementing Courcelle's Theorem in a declarative framework for dynamic programming (Q3133156) (← links)
- Computing secure sets in graphs using answer set programming (Q3304090) (← links)
- Clique-Width and Directed Width Measures for Answer-Set Programming (Q4576239) (← links)
- D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy (Q4589187) (← links)
- D-FLAT: Declarative problem solving using tree decompositions and answer-set programming (Q4911127) (← links)
- The Impact of Treewidth on Grounding and Solving of Answer Set Programs (Q5208864) (← links)
- Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs (Q5240230) (← links)
