Author of the publication

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. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

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