default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDBernhard Bliem
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2020
[j9]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: 35-80 (2020)- [j8]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): 837-862 (2020)
2010 – 2019
- 2019
- [c13]Bernhard Bliem, Matti Järvisalo:
Centrality Heuristics for Exact Model Counting. ICTAI 2019: 59-63 - 2018
- [j7]Bernhard Bliem
, Stefan Woltran:
Complexity of Secure Sets. Algorithmica 80(10): 2909-2940 (2018) - [j6]Bernhard Bliem, Stefan Woltran:
Equivalence between answer-set programs under (partially) fixed input. Ann. Math. Artif. Intell. 83(3-4): 277-295 (2018) - [j5]Bernhard Bliem, Stefan Woltran:
Defensive alliances in graphs of bounded treewidth. Discret. Appl. Math. 251: 334-339 (2018) - [j4]Michael Abseher, Bernhard Bliem, Markus Hecher, Marius Moldovan, Stefan Woltran:
Dynamic Programming on Tree Decompositions with D-FLAT. Künstliche Intell. 32(2-3): 191-192 (2018) - [c12]Bernhard Bliem:
ASP Programs with Groundings of Small Treewidth. FoIKS 2018: 97-113 - 2017
- [j3]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Implementing Courcelle's Theorem in a declarative framework for dynamic programming. J. Log. Comput. 27(4): 1067-1094 (2017) - [c11]Bernhard Bliem:
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. ICLP (Technical Communications) 2017: 12:1-12:12 - [c10]Bernhard Bliem, Marius Moldovan, Michael Morak, Stefan Woltran:
The Impact of Treewidth on ASP Grounding and Solving. IJCAI 2017: 852-858 - [p1]Bernhard Bliem:
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. Ausgezeichnete Informatikdissertationen 2017: 31-40 - [i4]Bernhard Bliem, Stefan Woltran:
Defensive Alliances in Graphs of Bounded Treewidth. CoRR abs/1707.04251 (2017) - 2016
- [j2]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
D-FLAT2: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy. Fundam. Informaticae 147(1): 27-61 (2016) - [c9]Bernhard Bliem, Günther Charwat, Markus Hecher, Stefan Woltran:
Subset Minimization in Dynamic Programming on Tree Decompositions. AAAI Workshop: Beyond NP 2016 - [c8]Bernhard Bliem, Markus Hecher, Stefan Woltran:
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions. COMMA 2016: 107-118 - [c7]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. ECAI 2016: 1105-1113 - [c6]Bernhard Bliem, Stefan Woltran:
Equivalence Between Answer-Set Programs Under (Partially) Fixed Input. FoIKS 2016: 95-111 - [c5]Bernhard Bliem, Robert Bredereck, Rolf Niedermeier:
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels. IJCAI 2016: 102-108 - [c4]Bernhard Bliem, Benjamin Kaufmann, Torsten Schaub, Stefan Woltran:
ASP for Anytime Dynamic Programming on Tree Decompositions. IJCAI 2016: 979-986 - [i3]Bernhard Bliem, Sebastian Ordyniak, Stefan Woltran:
Clique-Width and Directed Width Measures for Answer-Set Programming. CoRR abs/1606.09449 (2016) - 2015
- [c3]Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. WG 2015: 64-77 - 2014
- [c2]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: 558-572 - [i2]Bernhard Bliem, Stefan Woltran:
Complexity of Secure Sets. CoRR abs/1411.6549 (2014) - 2013
- [c1]Bernhard Bliem, Reinhard Pichler, Stefan Woltran:
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem. IPEC 2013: 28-40 - 2012
- [j1]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): 445-464 (2012) - [i1]Bernhard Bliem, Michael Morak, Stefan Woltran:
D-FLAT: Declarative Problem Solving Using Tree Decompositions and Answer-Set Programming. CoRR abs/1210.1931 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:46 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
