Bernhard Bliem

Publication Activity (10 Years)

Years Active: 2012-2020
Publications (10 Years): 21

Top Topics

Dynamic Programming

Complexity Bounds

Answer Set Programming

Bounded Treewidth

Top Venues

J. Log. Comput.

Publications

Bernhard Bliem, Michael Morak, Marius Moldovan, Stefan Woltran
The Impact of Treewidth on Grounding and Solving of Answer Set Programs. J. Artif. Intell. Res. 67 (2020)
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Stefan Woltran
Computing secure sets in graphs using answer set programming. J. Log. Comput. 30 (4) (2020)
Bernhard Bliem, Matti Järvisalo
Centrality Heuristics for Exact Model Counting. ICTAI (2019)
Bernhard Bliem
ASP Programs with Groundings of Small Treewidth. FoIKS (2018)
Bernhard Bliem, Stefan Woltran
Complexity of Secure Sets. Algorithmica 80 (10) (2018)
Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran
Dynamic Programming on Tree Decompositions with D-FLAT. Künstliche Intell. 32 (2-3) (2018)
Bernhard Bliem, Stefan Woltran
Equivalence between answer-set programs under (partially) fixed input. Ann. Math. Artif. Intell. 83 (3-4) (2018)
Bernhard Bliem, Stefan Woltran
Defensive alliances in graphs of bounded treewidth. Discret. Appl. Math. 251 (2018)
Bernhard Bliem
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. Ausgezeichnete Informatikdissertationen (2017)
Bernhard Bliem
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. ICLP (Technical Communications) (2017)
Bernhard Bliem, Reinhard Pichler, Stefan Woltran
Implementing Courcelle's Theorem in a declarative framework for dynamic programming. J. Log. Comput. 27 (4) (2017)
Bernhard Bliem, Stefan Woltran
Defensive Alliances in Graphs of Bounded Treewidth. CoRR (2017)
Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran
The Impact of Treewidth on ASP Grounding and Solving. IJCAI (2017)
Bernhard Bliem, Robert Bredereck, Rolf Niedermeier
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI (2016)
Bernhard Bliem, Stefan Woltran
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. FoIKS (2016)
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
Clique-Width and Directed Width Measures for Answer-Set Programming. CoRR (2016)
Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran
ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI (2016)
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Informaticae 147 (1) (2016)
Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran
Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP (2016)
Bernhard Bliem, Markus Hecher, Stefan Woltran
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA (2016)
Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran
Clique-Width and Directed Width Measures for Answer-Set Programming. ECAI (2016)
Bernhard Bliem, Stefan Woltran
Complexity of Secure Sets. WG (2015)
Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran
The D-FLAT System for Dynamic Programming on Tree Decompositions. JELIA (2014)
Bernhard Bliem, Stefan Woltran
Complexity of Secure Sets. CoRR (2014)
Bernhard Bliem, Reinhard Pichler, Stefan Woltran
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. IPEC (2013)
Bernhard Bliem, Michael Morak, Stefan Woltran
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming CoRR (2012)
Bernhard Bliem, Michael Morak, Stefan Woltran
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. Theory Pract. Log. Program. 12 (4-5) (2012)