Name Card

Full name Familienname, Vorname
Bliem, Bernhard
 
Main Affiliation Organisations­zuordnung
 

Own Publications Eigene Publikationen

Results 1-20 of 30 (Search time: 0.005 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Abseher, Michael ; Bliem, Bernhard ; Charwat, Günther ; Dusberger, Frederico ; Woltran, Stefan Computing Secure Sets in Graphs using Answer Set ProgrammingArtikel Article Jun-2020
2Bliem, Bernhard ; Morak, Michael ; Moldovan, Marius ; Woltran, Stefan The Impact of Treewidth on Grounding and Solving of Answer Set ProgramsArtikel Article 2020
3Bliem, Bernhard ; Woltran, Stefan Defensive alliances in graphs of bounded treewidthArtikel Article 31-Dec-2018
4Bliem, Bernhard ; Woltran, Stefan Complexity of Secure SetsArtikel Article 2018
5Bliem, Bernhard ASP Programs with Groundings of Small TreewidthKonferenzbeitrag Inproceedings 2018
6Bliem, Bernhard ; Woltran, Stefan Equivalence between answer-set programs under (partially) fixed inputArtikel Article 2018
7Abseher, Michael ; Hecher, Markus ; Moldovan, Marius ; Woltran, Stefan ; Bliem, Bernhard Dynamic Programming on Tree Decompositions with {D-FLAT}Artikel Article 2018
8Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan The Impact of Treewidth on ASP Grounding and SolvingKonferenzbeitrag Inproceedings 2017
9Bliem, Bernhard ; Pichler, Reinhard ; Woltran, Stefan Implementing Courcelle's Theorem in a declarative framework for dynamic programmingArtikel Article 2017
10Bliem Bernhard - 2017 - Treewidth in non-ground answer set solving and alliance...pdf.jpgBliem, Bernhard Treewidth in non-ground answer set solving and alliance problems in graphsThesis Hochschulschrift 2017
11Moldovan, Marius ; Bliem, Bernhard ; Morak, Michael ; Woltran, Stefan ; Bliem, Bernhard The Impact of Treewidth on {ASP} Grounding and SolvingKonferenzbeitrag Inproceedings 2017
12Bichler, Manuel ; Bliem, Bernhard ; Moldovan, Marius ; Morak, Michael ; Woltran, Stefan Treewidth-Preserving Modeling in ASPBericht Report2016
13Bliem, Bernhard ; Woltran, Stefan Equivalence Between Answer-Set Programs Under (Partially) Fixed InputKonferenzbeitrag Inproceedings 2016
14Bliem, Bernhard ; Bredereck, Robert ; Niedermeier, Rolf Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility LevelsKonferenzbeitrag Inproceedings 2016
15Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan ASP for Anytime Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
16Bliem, Bernhard ; Hecher, Markus ; Woltran, Stefan On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
17Bliem, Bernhard ; Woltran, Stefan Complexity of Secure SetsKonferenzbeitrag Inproceedings 2016
18Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan Subset Minimization in Dynamic Programming on Tree DecompositionsKonferenzbeitrag Inproceedings 2016
19Bliem, Bernhard ; Kaufmann, Benjamin ; Schaub, Torsten ; Woltran, Stefan ASP for Anytime Dynamic Programming on Tree Decompositions (Extended Abstract)Konferenzbeitrag Inproceedings 2016
20Bliem, Bernhard ; Charwat, Günther ; Hecher, Markus ; Woltran, Stefan D-FLAT^2: Subset Minimization in Dynamic Programming on Tree Decompositions Made EasyArtikel Article 2016

Contributing Publications Mitbeteiligte Publikationen

Results 1-1 of 1 (Search time: 0.001 seconds).

PreviewAuthor(s)TitleTypeIssue Date
1Hecher Markus - 2015 - Optimizing second-level dynamic programming algorithms...pdf.jpgHecher, Markus Optimizing second-level dynamic programming algorithms : the D-FLAT 2 system: encodings and experimental evaluationThesis Hochschulschrift 2015