Bernhard Bliem
Orcid: 0000-0002-2898-2830
According to our database1,
Bernhard Bliem
authored at least 21 papers
between 2012 and 2020.
Collaborative distances:
Collaborative distances:
Timeline
2012
2013
2014
2015
2016
2017
2018
2019
2020
0
1
2
3
4
5
6
7
1
2
4
1
1
1
1
1
2
5
1
1
Legend:
Book In proceedings Article PhD thesis Dataset OtherLinks
Online presence:
-
on orcid.org
On csauthors.net:
Bibliography
2020
J. Artif. Intell. Res., 2020
2019
Proceedings of the 31st IEEE International Conference on Tools with Artificial Intelligence, 2019
2018
Ann. Math. Artif. Intell., 2018
Proceedings of the Foundations of Information and Knowledge Systems, 2018
2017
J. Log. Comput., 2017
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017
Proceedings of the Technical Communications of the 33rd International Conference on Logic Programming, 2017
Proceedings of the Ausgezeichnete Informatikdissertationen 2017, 2017
2016
D-FLAT<sup>2</sup>: Subset Minimization in Dynamic Programming on Tree Decompositions Made Easy.
Fundam. Informaticae, 2016
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels.
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence, 2016
Proceedings of the ECAI 2016 - 22nd European Conference on Artificial Intelligence, 29 August-2 September 2016, The Hague, The Netherlands, 2016
On Efficiently Enumerating Semi-Stable Extensions via Dynamic Programming on Tree Decompositions.
Proceedings of the Computational Models of Argument, 2016
Proceedings of the Beyond NP, 2016
2014
Proceedings of the Logics in Artificial Intelligence - 14th European Conference, 2014
2013
Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem.
Proceedings of the Parameterized and Exact Computation - 8th International Symposium, 2013
2012
D-FLAT: Declarative problem solving using tree decompositions and answer-set programming.
Theory Pract. Log. Program., 2012