( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Dynamic Programming on Tree Decompositions with D-FLAT.

, , , , и . Künstliche Intell., 32 (2-3): 191-192 (2018)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed.

Thomas Bliem

Günter Bliemel

Barbara Bliem

Daniela Bliem

Christopher Franz Randolf Peter Bliemel

 

Другие публикации лиц с тем же именем

Complexity of Secure Sets., и . WG, том 9224 из Lecture Notes in Computer Science, стр. 64-77. Springer, (2015)Equivalence between answer-set programs under (partially) fixed input., и . Ann. Math. Artif. Intell., 83 (3-4): 277-295 (2018)Implementing Courcelle's Theorem in a declarative framework for dynamic programming., , и . J. Log. Comput., 27 (4): 1067-1094 (2017)Complexity of Efficient and Envy-Free Resource Allocation: Few Agents, Resources, or Utility Levels., , и . IJCAI, стр. 102-108. IJCAI/AAAI Press, (2016)D-FLAT: Declarative problem solving using tree decompositions and answer-set programming., , и . Theory Pract. Log. Program., 12 (4-5): 445-464 (2012)Subset Minimization in Dynamic Programming on Tree Decompositions., , , и . AAAI Workshop: Beyond NP, том WS-16-05 из AAAI Technical Report, AAAI Press, (2016)978-1-57735-759-9.Complexity of Secure Sets., и . CoRR, (2014)Declarative Dynamic Programming as an Alternative Realization of Courcelle's Theorem., , и . IPEC, том 8246 из Lecture Notes in Computer Science, стр. 28-40. Springer, (2013)Computing secure sets in graphs using answer set programming., , , , и . J. Log. Comput., 30 (4): 837-862 (2020)Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs.. ICLP (Technical Communications), том 58 из OASIcs, стр. 12:1-12:12. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)