The FacetedDBLP logo    Search for: in:

Disable automatic phrases ?     Syntactic query expansion: ?

Publications of "Bernhard Bliem" ( http://dblp.L3S.de/Authors/Bernhard_Bliem )

  Author page on DBLP  Author page in RDF  Community of Bernhard Bliem in ASPL-2

Publication years (Num. hits)
2012-2017 (19) 2018 (5)
Publication types (Num. hits)
article(11) inproceedings(13)
GrowBag graphs for keyword ? (Num. hits/coverage)

Group by:
No Growbag Graphs found.

Results
Found 25 publication records. Showing 24 according to the selection in the facets
Hits ? Authors Title Venue Year Link Author keywords
1Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran Dynamic Programming on Tree Decompositions with D-FLAT. Search on Bibsonomy KI The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Equivalence between answer-set programs under (partially) fixed input. Search on Bibsonomy Ann. Math. Artif. Intell. The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. Search on Bibsonomy Algorithmica The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Defensive alliances in graphs of bounded treewidth. Search on Bibsonomy Discrete Applied Mathematics The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem ASP Programs with Groundings of Small Treewidth. Search on Bibsonomy FoIKS The full citation details ... 2018 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Defensive Alliances in Graphs of Bounded Treewidth. Search on Bibsonomy CoRR The full citation details ... 2017 DBLP  BibTeX  RDF
1Bernhard Bliem, Reinhard Pichler, Stefan Woltran Implementing Courcelle's Theorem in a declarative framework for dynamic programming. Search on Bibsonomy J. Log. Comput. The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. Search on Bibsonomy ICLP (Technical Communications) The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. Search on Bibsonomy Ausgezeichnete Informatikdissertationen The full citation details ... 2017 DBLP  BibTeX  RDF
1Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran The Impact of Treewidth on ASP Grounding and Solving. Search on Bibsonomy IJCAI The full citation details ... 2017 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Search on Bibsonomy Fundam. Inform. The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. Search on Bibsonomy CoRR The full citation details ... 2016 DBLP  BibTeX  RDF
1Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran Subset Minimization in Dynamic Programming on Tree Decompositions. Search on Bibsonomy AAAI Workshop: Beyond NP The full citation details ... 2016 DBLP  BibTeX  RDF
1Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran Clique-Width and Directed Width Measures for Answer-Set Programming. Search on Bibsonomy ECAI The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Markus Hecher, Stefan Woltran On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. Search on Bibsonomy COMMA The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. Search on Bibsonomy FoIKS The full citation details ... 2016 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran ASP for Anytime Dynamic Programming on Tree Decompositions. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Bernhard Bliem, Robert Bredereck, Rolf Niedermeier Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. Search on Bibsonomy IJCAI The full citation details ... 2016 DBLP  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. Search on Bibsonomy WG The full citation details ... 2015 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Stefan Woltran Complexity of Secure Sets. Search on Bibsonomy CoRR The full citation details ... 2014 DBLP  BibTeX  RDF
1Michael Abseher, Bernhard Bliem, Günther Charwat, Frederico Dusberger, Markus Hecher, Stefan Woltran The D-FLAT System for Dynamic Programming on Tree Decompositions. Search on Bibsonomy JELIA The full citation details ... 2014 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Reinhard Pichler, Stefan Woltran Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. Search on Bibsonomy IPEC The full citation details ... 2013 DBLP  DOI  BibTeX  RDF
1Bernhard Bliem, Michael Morak, Stefan Woltran D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming Search on Bibsonomy CoRR The full citation details ... 2012 DBLP  BibTeX  RDF
1Bernhard Bliem, Michael Morak, Stefan Woltran D-FLAT: Declarative problem solving using tree decompositions and answer-set programming. Search on Bibsonomy TPLP The full citation details ... 2012 DBLP  DOI  BibTeX  RDF
Displaying result #1 - #24 of 24 (100 per page; Change: )
Valid XHTML 1.1! Valid CSS! [Valid RSS]
Maintained by Jörg Diederich.
Based upon DBLP by Michael Ley.
open data data released under the ODC-BY 1.0 license