Stefan Rümmele

Orcid: 0000-0002-8679-6913

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

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2019
Turbocharging Treewidth Heuristics.
Algorithmica, 2019

2018
An extension-based approach to belief revision in abstract argumentation.
Int. J. Approx. Reason., 2018

When is Red-Blue Nonblocker Fixed-Parameter Tractable?
Proceedings of the LATIN 2018: Theoretical Informatics, 2018

Minesweeper with Limited Moves.
Proceedings of the Thirty-Second AAAI Conference on Artificial Intelligence, 2018

2017
Merging in the Horn Fragment.
ACM Trans. Comput. Log., 2017

Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements.
Proceedings of the 28th International Symposium on Algorithms and Computation, 2017

The Parameterized Complexity of Positional Games.
Proceedings of the 44th International Colloquium on Automata, Languages, and Programming, 2017

2016
Belief Merging within Fragments of Propositional Logic.
ACM Trans. Comput. Log., 2016

2015
On the Parameterized Complexity of Belief Revision.
Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015

2014
Tractable answer-set programming with weight constraints: bounded treewidth is not enough.
Theory Pract. Log. Program., 2014

Benchmarking Database Systems for Graph Pattern Matching.
Proceedings of the Database and Expert Systems Applications, 2014

2013
Backdoors to Abduction.
Proceedings of the IJCAI 2013, 2013

2012
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming.
Proceedings of the Learning and Intelligent Optimization - 6th International Conference, 2012

Multicut on Graphs of Bounded Clique-Width.
Proceedings of the Combinatorial Optimization and Applications, 2012

The Parameterized Complexity of Abduction.
Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, 2012

2011
A New Tree-Decomposition Based Algorithm for Answer Set Programming.
Proceedings of the IEEE 23rd International Conference on Tools with Artificial Intelligence, 2011

2010
Counting and Enumeration Problems with Bounded Treewidth.
Proceedings of the Logic for Programming, Artificial Intelligence, and Reasoning, 2010

A Dynamic-Programming Based ASP-Solver.
Proceedings of the Logics in Artificial Intelligence - 12th European Conference, 2010

Multicut Algorithms via Tree Decompositions.
Proceedings of the Algorithms and Complexity, 7th International Conference, 2010

2009
Belief Revision with Bounded Treewidth.
Proceedings of the Logic Programming and Nonmonotonic Reasoning, 2009

2008
Fast Counting with Bounded Treewidth.
Proceedings of the Logic for Programming, 2008


  Loading...