Bernhard Bliem

Available identifiers

zbMath Open bliem.bernhardMaRDI QIDQ722533

List of research outcomes

Publication	Date of Publication	Type
Computing secure sets in graphs using answer set programming	2020-08-05	Paper
The Impact of Treewidth on Grounding and Solving of Answer Set Programs	2020-01-22	Paper
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs	2019-10-24	Paper
Defensive alliances in graphs of bounded treewidth	2018-12-03	Paper
Equivalence between answer-set programs under (partially) fixed input	2018-09-21	Paper
Complexity of secure sets	2018-07-26	Paper
Clique-Width and Directed Width Measures for Answer-Set Programming	2018-07-12	Paper
ASP programs with groundings of small treewidth	2018-06-26	Paper
Implementing Courcelle's Theorem in a declarative framework for dynamic programming	2018-02-13	Paper
D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy	2017-11-09	Paper
Complexity of Secure Sets	2016-10-21	Paper
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input	2016-05-19	Paper
The D-FLAT System for Dynamic Programming on Tree Decompositions	2015-01-14	Paper
Declarative Dynamic Programming as an Alternative Realization of Courcelle’s Theorem	2013-12-10	Paper
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming	2013-03-13	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: Bernhard Bliem