From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.

S. Gaspers, J. Gudmundsson, J. Mestre, и S. Rümmele. ISAAC, том 92 из LIPIcs, стр. 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.

Annette Rümmele

Petra Rümmele

Frank Rümmele

Klaus Rümmele

Edgar Rümmele

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

Turbocharging Treewidth Heuristics.S. Gaspers, J. Gudmundsson, M. Jones, J. Mestre, и S. Rümmele. IPEC, том 63 из LIPIcs, стр. 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, (2016)Belief Merging within Fragments of Propositional Logic.N. Creignou, O. Papini, S. Rümmele, и S. Woltran. ACM Trans. Comput. Log., 17 (3): 20 (2016)Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough.R. Pichler, S. Rümmele, S. Szeider, и S. Woltran. KR, AAAI Press, (2010)Multicut on Graphs of Bounded Clique-Width.M. Lackner, R. Pichler, S. Rümmele, и S. Woltran. COCOA, том 7402 из Lecture Notes in Computer Science, стр. 115-126. Springer, (2012)Counting and Enumeration Problems with Bounded Treewidth.R. Pichler, S. Rümmele, и S. Woltran. LPAR (Dakar), том 6355 из Lecture Notes in Computer Science, стр. 387-404. Springer, (2010)Benchmarking Database Systems for Graph Pattern Matching.N. Pobiedina, S. Rümmele, S. Skritek, и H. Werthner. DEXA (1), том 8644 из Lecture Notes in Computer Science, стр. 226-241. Springer, (2014)On the Parameterized Complexity of Belief Revision.A. Pfandler, S. Rümmele, J. Wallner, и S. Woltran. IJCAI, стр. 3149-3155. AAAI Press, (2015)Belief Revision with Bounded Treewidth.R. Pichler, S. Rümmele, и S. Woltran. LPNMR, том 5753 из Lecture Notes in Computer Science, стр. 250-263. Springer, (2009)A Dynamic-Programming Based ASP-Solver.M. Morak, R. Pichler, S. Rümmele, и S. Woltran. JELIA, том 6341 из Lecture Notes in Computer Science, стр. 369-372. Springer, (2010)A New Tree-Decomposition Based Algorithm for Answer Set Programming.M. Morak, N. Musliu, R. Pichler, S. Rümmele, и S. Woltran. ICTAI, стр. 916-918. IEEE Computer Society, (2011)

BibSonomy

Disambiguation