Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
Stefan Rümmele
2010 – today
- 2013
[i2]- 2012
- [c10]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele: The Parameterized Complexity of Abduction. AAAI 2012
- [c9]Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut on Graphs of Bounded Clique-Width. COCOA 2012: 115-126
- [c8]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION 2012: 130-144
- [i1]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR abs/1204.3040 (2012)
- 2011
- [c7]Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI 2011: 916-918
- 2010
- [c6]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Multicut Algorithms via Tree Decompositions. CIAC 2010: 167-179
- [c5]Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: A Dynamic-Programming Based ASP-Solver. JELIA 2010: 369-372
- [c4]Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran: Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR 2010
- [c3]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) 2010: 387-404
2000 – 2009
- 2009
- [c2]Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Belief Revision with Bounded Treewidth. LPNMR 2009: 250-263
- 2008
- [c1]Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran: Fast Counting with Bounded Treewidth. LPAR 2008: 436-450
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2013-05-03 21:38 CEST by the dblp team