default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDStefan Rümmele
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2019
[j5]Serge Gaspers, Joachim Gudmundsson
, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. Algorithmica 81(2): 439-475 (2019)- 2018
- [j4]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: 395-423 (2018) - [c21]Serge Gaspers, Stefan Rümmele, Abdallah Saffidine, Kevin Tran:
Minesweeper with Limited Moves. AAAI 2018: 860-867 - [c20]Serge Gaspers, Joachim Gudmundsson, Michael Horton, Stefan Rümmele:
When is Red-Blue Nonblocker Fixed-Parameter Tractable? LATIN 2018: 515-528 - 2017
- [j3]Adrian Haret, Stefan Rümmele, Stefan Woltran:
Merging in the Horn Fragment. ACM Trans. Comput. Log. 18(1): 6:1-6:32 (2017) - [c19]Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine:
The Parameterized Complexity of Positional Games. ICALP 2017: 90:1-90:14 - [c18]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. ISAAC 2017: 37:1-37:13 - [i5]Édouard Bonnet, Serge Gaspers, Antonin Lambilliotte, Stefan Rümmele, Abdallah Saffidine:
The Parameterized Complexity of Positional Games. CoRR abs/1704.08536 (2017) - [i4]Serge Gaspers, Joachim Gudmundsson, Julián Mestre, Stefan Rümmele:
Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements. CoRR abs/1709.10285 (2017) - 2016
- [j2]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief Merging within Fragments of Propositional Logic. ACM Trans. Comput. Log. 17(3): 20 (2016) - [c17]Serge Gaspers, Joachim Gudmundsson, Mitchell Jones, Julián Mestre, Stefan Rümmele:
Turbocharging Treewidth Heuristics. IPEC 2016: 13:1-13:13 - 2015
- [c16]Martin Diller, Adrian Haret, Thomas Linsbichler, Stefan Rümmele, Stefan Woltran:
An Extension-Based Approach to Belief Revision in Abstract Argumentation. IJCAI 2015: 2926-2932 - [c15]Adrian Haret, Stefan Rümmele, Stefan Woltran:
Merging in the Horn Fragment. IJCAI 2015: 3041-3047 - [c14]Andreas Pfandler, Stefan Rümmele, Johannes Peter Wallner, Stefan Woltran:
On the Parameterized Complexity of Belief Revision. IJCAI 2015: 3149-3155 - 2014
- [j1]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): 141-164 (2014) - [c13]Nataliia Pobiedina, Stefan Rümmele, Sebastian Skritek, Hannes Werthner:
Benchmarking Database Systems for Graph Pattern Matching. DEXA (1) 2014: 226-241 - [c12]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. ECAI 2014: 231-236 - [i3]Nadia Creignou, Odile Papini, Stefan Rümmele, Stefan Woltran:
Belief merging within fragments of propositional logic. CoRR abs/1404.6445 (2014) - 2013
- [c11]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. IJCAI 2013: 1046-1052 - [i2]Andreas Pfandler, Stefan Rümmele, Stefan Szeider:
Backdoors to Abduction. CoRR abs/1304.5961 (2013) - 2012
- [c10]Michael R. Fellows, Andreas Pfandler, Frances A. Rosamond, Stefan Rümmele:
The Parameterized Complexity of Abduction. AAAI 2012: 743-749 - [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
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-08-05 21:20 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
