Stefan Rümmele

According to our database, Stefan Rümmele authored at least 21 papers between 2008 and 2018.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2018

When is Red-Blue Nonblocker Fixed-Parameter Tractable?

Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele

Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Minesweeper with Limited Moves.

Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran

Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017

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

Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele

Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Parameterized Complexity of Positional Games.

Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine

Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016

Turbocharging Treewidth Heuristics.

Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele

Proceedings of the 11th International Symposium on Parameterized and Exact Computation, 2016

2015

On the Parameterized Complexity of Belief Revision.

Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

Merging in the Horn Fragment.

Adrian Haret, Stefan Rümmele, Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

An Extension-Based Approach to Belief Revision in Abstract Argumentation.

Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014

Belief merging within fragments of propositional logic.

Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran

Proceedings of the ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic, 2014

Benchmarking Database Systems for Graph Pattern Matching.

Nataliia Pobiedina, Stefan Rümmele, Sebastian Skritek, Hannes Werthner

Proceedings of the Database and Expert Systems Applications, 2014

2013

Backdoors to Abduction.

Andreas Pfandler, Stefan Rümmele, Stefan Szeider

Proceedings of the IJCAI 2013, 2013

2012

Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.

Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Multicut on Graphs of Bounded Clique-Width.

Martin Lackner, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Combinatorial Optimization and Applications, 2012

The Parameterized Complexity of Abduction.

Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele

Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011

A New Tree-Decomposition Based Algorithm for Answer Set Programming.

Michael Morak, Nysret Musliu, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010

Counting and Enumeration Problems with Bounded Treewidth.

Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough.

Reinhard Pichler, Stefan Rümmele, Stefan Szeider, Stefan Woltran

Proceedings of the Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, 2010

A Dynamic-Programming Based ASP-Solver.

Michael Morak, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Multicut Algorithms via Tree Decompositions.

Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009

Belief Revision with Bounded Treewidth.

Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008

Fast Counting with Bounded Treewidth.

Michael Jakl, Reinhard Pichler, Stefan Rümmele, Stefan Woltran

Proceedings of the Logic for Programming, 2008