( en | de | ru )

 

Disambiguation of "Rümmele, Stefan"

Author of the publication

copydeleteadd this publication to your clipboard
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.

, , , and . ISAAC, volume 92 of LIPIcs, page 37:1-37:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2017)

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.

Annette Rümmele

Petra Rümmele

Frank Rümmele

Edgar Rümmele

Klaus Rümmele

 

Other publications of authors with the same name

Turbocharging Treewidth Heuristics., , , , and . IPEC, volume 63 of LIPIcs, page 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Belief Merging within Fragments of Propositional Logic., , , and . ACM Trans. Comput. Log., 17 (3): 20 (2016)Multicut on Graphs of Bounded Clique-Width., , , and . COCOA, volume 7402 of Lecture Notes in Computer Science, page 115-126. Springer, (2012)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough., , , and . KR, AAAI Press, (2010)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough, , , and . CoRR, (2012)An Extension-Based Approach to Belief Revision in Abstract Argumentation., , , , and . IJCAI, page 2926-2932. AAAI Press, (2015)Tractable answer-set programming with weight constraints: bounded treewidth is not enough., , , and . Theory Pract. Log. Program., 14 (2): 141-164 (2014)Merging in the Horn Fragment., , and . ACM Trans. Comput. Log., 18 (1): 6:1-6:32 (2017)An extension-based approach to belief revision in abstract argumentation., , , , and . Int. J. Approx. Reason., (2018)Counting and Enumeration Problems with Bounded Treewidth., , and . LPAR (Dakar), volume 6355 of Lecture Notes in Computer Science, page 387-404. Springer, (2010)