Fast Counting with Bounded Treewidth. - Michael Jakl; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPAR, 2008)

Belief Revision with Bounded Treewidth. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPNMR, 2009)

Multicut Algorithms via Tree Decompositions. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (CIAC, 2010)

A Dynamic-Programming Based ASP-Solver. - Michael Morak; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (JELIA, 2010)

Counting and Enumeration Problems with Bounded Treewidth. - Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LPAR (Dakar), 2010)

A New Tree-Decomposition Based Algorithm for Answer Set Programming. - Michael Morak; Nysret Musliu; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (ICTAI, 2011)

The Parameterized Complexity of Abduction. - Michael R. Fellows; Andreas Pfandler; Frances A. Rosamond; Stefan Rümmele (AAAI, 2012)

Multicut on Graphs of Bounded Clique-Width. - Martin Lackner; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (COCOA, 2012)

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. - Michael Morak; Nysret Musliu; Reinhard Pichler; Stefan Rümmele; Stefan Woltran (LION, 2012)

Backdoors to Abduction. - Andreas Pfandler; Stefan Rümmele; Stefan Szeider (IJCAI, 2013)

Benchmarking Database Systems for Graph Pattern Matching. - Nataliia Pobiedina; Stefan Rümmele; Sebastian Skritek; Hannes Werthner (DEXA (1), 2014)

Tractable answer-set programming with weight constraints: bounded treewidth is not enough. - Reinhard Pichler; Stefan Rümmele; Stefan Szeider; Stefan Woltran (Theory Pract. Log. Program., 2014)

On the Parameterized Complexity of Belief Revision. - Andreas Pfandler; Stefan Rümmele; Johannes Peter Wallner; Stefan Woltran (IJCAI, 2015)

Belief Merging within Fragments of Propositional Logic. - Nadia Creignou; Odile Papini; Stefan Rümmele; Stefan Woltran (ACM Trans. Comput. Log., 2016)

The Parameterized Complexity of Positional Games. - Édouard Bonnet; Serge Gaspers; Antonin Lambilliotte; Stefan Rümmele; Abdallah Saffidine (ICALP, 2017)

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. - Serge Gaspers; Joachim Gudmundsson; Julián Mestre; Stefan Rümmele (ISAAC, 2017)

Merging in the Horn Fragment. - Adrian Haret; Stefan Rümmele; Stefan Woltran (ACM Trans. Comput. Log., 2017)

Minesweeper with Limited Moves. - Serge Gaspers; Stefan Rümmele; Abdallah Saffidine; Kevin Tran (AAAI, 2018)

When is Red-Blue Nonblocker Fixed-Parameter Tractable? - Serge Gaspers; Joachim Gudmundsson; Michael Horton 001; Stefan Rümmele (LATIN, 2018)

An extension-based approach to belief revision in abstract argumentation. - Martin Diller; Adrian Haret; Thomas Linsbichler; Stefan Rümmele; Stefan Woltran (Int. J. Approx. Reason., 2018)

Turbocharging Treewidth Heuristics. - Serge Gaspers; Joachim Gudmundsson; Mitchell Jones; Julián Mestre; Stefan Rümmele (Algorithmica, 2019)