Stefan Rümmele

Publication Activity (10 Years)

Years Active: 2008-2019
Publications (10 Years): 11

Top Topics

Parameterized Complexity

Propositional Logic

Bounded Treewidth

Top Venues

ACM Trans. Comput. Log.

Publications

Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. Algorithmica 81 (2) (2019)
Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN (2018)
Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran
Minesweeper with Limited Moves. AAAI (2018)
Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran
An extension-based approach to belief revision in abstract argumentation. Int. J. Approx. Reason. 93 (2018)
Adrian Haret, Stefan Rümmele, Stefan Woltran
Merging in the Horn Fragment. ACM Trans. Comput. Log. 18 (1) (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR (2017)
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
The Parameterized Complexity of Positional Games. ICALP (2017)
Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC (2017)
Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine
The Parameterized Complexity of Positional Games. CoRR (2017)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17 (3) (2016)
Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele
Turbocharging Treewidth Heuristics. IPEC (2016)
Adrian Haret, Stefan Rümmele, Stefan Woltran
Merging in the Horn Fragment. IJCAI (2015)
Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran
An Extension-Based Approach to Belief Revision in Abstract Argumentation. IJCAI (2015)
Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran
On the Parameterized Complexity of Belief Revision. IJCAI (2015)
Nataliia Pobiedina, Stefan Rümmele, Sebastian Skritek, Hannes Werthner
Benchmarking Database Systems for Graph Pattern Matching. DEXA (1) (2014)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief merging within fragments of propositional logic. CoRR (2014)
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
Tractable answer-set programming with weight constraints: bounded treewidth is not enough. Theory Pract. Log. Program. 14 (2) (2014)
Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran
Belief merging within fragments of propositional logic. ECAI (2014)
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Backdoors to Abduction CoRR (2013)
Andreas Pfandler, Stefan Rümmele, Stefan Szeider
Backdoors to Abduction. IJCAI (2013)
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming. LION (2012)
Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Multicut on Graphs of Bounded Clique-Width. COCOA (2012)
Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele
The Parameterized Complexity of Abduction. AAAI (2012)
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough CoRR (2012)
Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
A New Tree-Decomposition Based Algorithm for Answer Set Programming. ICTAI (2011)
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Multicut Algorithms via Tree Decompositions. CIAC (2010)
Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
A Dynamic-Programming Based ASP-Solver. JELIA (2010)
Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran
Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. KR (2010)
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Counting and Enumeration Problems with Bounded Treewidth. LPAR (Dakar) (2010)
Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Belief Revision with Bounded Treewidth. LPNMR (2009)
Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran
Fast Counting with Bounded Treewidth. LPAR (2008)