| An extension-based approach to belief revision in abstract argumentation M Diller, A Haret, T Linsbichler, S Rümmele, S Woltran International Journal of Approximate Reasoning 93, 395-423, 2018 | 67 | 2018 |
| Backdoors to abduction A Pfandler, S Rümmele, S Szeider arXiv preprint arXiv:1304.5961, 2013 | 37 | 2013 |
| Counting and enumeration problems with bounded treewidth R Pichler, S Rümmele, S Woltran International Conference on Logic for Programming Artificial Intelligence …, 2010 | 25 | 2010 |
| Tractable answer-set programming with weight constraints: bounded treewidth is not enough R Pichler, S Rümmele, S Szeider, S Woltran arXiv preprint arXiv:1204.3040, 2012 | 22 | 2012 |
| A dynamic-programming based ASP-solver M Morak, R Pichler, S Rümmele, S Woltran European Workshop on Logics in Artificial Intelligence, 369-372, 2010 | 19 | 2010 |
| Fast counting with bounded treewidth M Jakl, R Pichler, S Rümmele, S Woltran International Conference on Logic for Programming Artificial Intelligence …, 2008 | 18 | 2008 |
| Merging in the Horn fragment A Haret, S Rümmele, S Woltran ACM Transactions on Computational Logic (TOCL) 18 (1), 1-32, 2017 | 14 | 2017 |
| The parameterized complexity of abduction M Fellows, A Pfandler, F Rosamond, S Rümmele Proceedings of the AAAI Conference on Artificial Intelligence 26 (1), 2012 | 14 | 2012 |
| Benchmarking database systems for graph pattern matching N Pobiedina, S Rümmele, S Skritek, H Werthner International Conference on Database and Expert Systems Applications, 226-241, 2014 | 13 | 2014 |
| Evaluating tree-decomposition based algorithms for answer set programming M Morak, N Musliu, R Pichler, S Rümmele, S Woltran International Conference on Learning and Intelligent Optimization, 130-144, 2012 | 13 | 2012 |
| Multicut algorithms via tree decompositions R Pichler, S Rümmele, S Woltran International Conference on Algorithms and Complexity, 167-179, 2010 | 13 | 2010 |
| Belief merging within fragments of propositional logic N Creignou, O Papini, S Rümmele, S Woltran ACM Transactions on Computational Logic (TOCL) 17 (3), 1-28, 2016 | 12 | 2016 |
| Belief revision with bounded treewidth R Pichler, S Rümmele, S Woltran International Conference on Logic Programming and Nonmonotonic Reasoning …, 2009 | 12 | 2009 |
| Turbocharging treewidth heuristics S Gaspers, J Gudmundsson, M Jones, J Mestre, S Rümmele Algorithmica 81 (2), 439-475, 2019 | 9 | 2019 |
| Multicut on graphs of bounded clique-width M Lackner, R Pichler, S Rümmele, S Woltran International Conference on Combinatorial Optimization and Applications, 115-126, 2012 | 8 | 2012 |
| The parameterized complexity of positional games É Bonnet, S Gaspers, A Lambilliotte, S Rümmele, A Saffidine arXiv preprint arXiv:1704.08536, 2017 | 6 | 2017 |
| A New Tree-Decomposition Based Algorithm for Answer Set Programming. M Morak, N Musliu, R Pichler, S Rümmele, S Woltran ICTAI 11, 916-918, 2011 | 6 | 2011 |
| On the parameterized complexity of belief revision A Pfandler, S Rümmele, JP Wallner, S Woltran Twenty-Fourth International Joint Conference on Artificial Intelligence, 2015 | 4 | 2015 |
| Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements S Gaspers, J Gudmundsson, J Mestre, S Rümmele arXiv preprint arXiv:1709.10285, 2017 | 2 | 2017 |
| Analysis of Business Models in Industrial Enterprises producing Discrete Goods for the B2B Sector S Rümmele Wien, 2019 | | 2019 |
Serge GaspersAssociate Professor, UNSW Sydney, AustraliaVerified email at cse.unsw.edu.au
