Stefan Rümmele
Research Associate
Address | Computer Science and Engineering Building K17 UNSW Sydney NSW 2052 Australia |
---|---|
s.rummele@unsw.edu.au | |
Room | 501G |
Bonnet É, Gaspers S, Lambilliotte A, Rümmele S and Saffidine A (2017), "The Parameterized Complexity of Positional Games", CoRR. Vol. abs/1704.08536 |
Gaspers S, Gudmundsson J, Mestre J and Rümmele S (2017), "Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements", CoRR. Vol. abs/1709.10285 |
Bonnet É, Gaspers S, Lambilliotte A, Rümmele S and Saffidine A (2017), "The Parameterized Complexity of Positional Games", In 44th International Colloquium on Automata, Languages, and Programming, ICALP 2017, July 10-14, 2017, Warsaw, Poland. Vol. 80, pp. 90:1-90:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
Gaspers S, Gudmundsson J, Mestre J and Rümmele S (2017), "Barrier Coverage with Non-uniform Lengths to Minimize Aggregate Movements", In 28th International Symposium on Algorithms and Computation, ISAAC 2017. To appear. [PDF] |
Haret A, Rümmele S and Woltran S (2017), "Merging in the Horn Fragment", ACM Trans. Comput. Log.. Vol. 18(1), pp. 6:1-6:32. |
Gaspers S, Gudmundsson J, Jones M, Mestre J and Rümmele S (2016), "Turbocharging Treewidth Heuristics", In 11th International Symposium on Parameterized and Exact Computation, IPEC 2016, August 24-26, 2016, Aarhus, Denmark. Vol. 63, pp. 13:1-13:13. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik. |
Creignou N, Papini O, Rümmele S and Woltran S (2016), "Belief Merging within Fragments of Propositional Logic", ACM Trans. Comput. Log.. Vol. 17(3), pp. 20:1-20:28. |
Diller M, Haret A, Linsbichler T, Rümmele S and Woltran S (2015), "An Extension-Based Approach to Belief Revision in Abstract Argumentation", In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. , pp. 2926-2932. AAAI Press. |
Haret A, Rümmele S and Woltran S (2015), "Merging in the Horn Fragment", In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. , pp. 3041-3047. AAAI Press. |
Pfandler A, Rümmele S, Wallner JP and Woltran S (2015), "On the Parameterized Complexity of Belief Revision", In Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence, IJCAI 2015, Buenos Aires, Argentina, July 25-31, 2015. , pp. 3149-3155. AAAI Press. |
Haret A, Rümmele S and Woltran S (2015), "Merging in the Horn Fragment" (DBAI-TR-2015-91) |
Creignou N, Papini O, Rümmele S and Woltran S (2014), "Belief merging within fragments of propositional logic", CoRR. Vol. abs/1404.6445 |
Pobiedina N, Rümmele S, Skritek S and Werthner H (2014), "Benchmarking Database Systems for Graph Pattern Matching", In Database and Expert Systems Applications - 25th International Conference, DEXA 2014, Munich, Germany, September 1-4, 2014. Proceedings, Part I. Vol. 8644, pp. 226-241. Springer. |
Creignou N, Papini O, Rümmele S and Woltran S (2014), "Belief merging within fragments of propositional logic", In ECAI 2014 - 21st European Conference on Artificial Intelligence, 18-22 August 2014, Prague, Czech Republic - Including Prestigious Applications of Intelligent Systems (PAIS 2014). , pp. 231-236. IOS Press. |
Creignou N, Papini O, Rümmele S and Woltran S (2014), "Belief merging within fragments of propositional logic", In 15th International Workshop on Non-Monotonic Reasoning (NMR 2014), Vienna, Austria, July 17-19, 2014.
[PDF] |
Pichler R, Rümmele S, Szeider S and Woltran S (2014), "Tractable answer-set programming with weight constraints: bounded treewidth is not enough", TPLP. Vol. 14(2), pp. 141-164. |
Pfandler A, Rümmele S and Szeider S (2013), "Backdoors to Abduction", CoRR. Vol. abs/1304.5961 |
Pfandler A, Rümmele S and Szeider S (2013), "Backdoors to Abduction", In IJCAI 2013, Proceedings of the 23rd International Joint Conference on Artificial Intelligence, Beijing, China, August 3-9, 2013. IJCAI/AAAI. |
Fellows MR, Pfandler A, Rosamond FA and Rümmele S (2012), "The Parameterized Complexity of Abduction", In Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, July 22-26, 2012, Toronto, Ontario, Canada. , pp. 743-749. AAAI Press. |
Lackner M, Pichler R, Rümmele S and Woltran S (2012), "Multicut on Graphs of Bounded Clique-Width", In Combinatorial Optimization and Applications - 6th International Conference, COCOA 2012, Banff, AB, Canada, August 5-9, 2012. Proceedings. Vol. 7402, pp. 115-126. Springer. |
Pichler R, Rümmele S, Szeider S and Woltran S (2012), "Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough", CoRR. Vol. abs/1204.3040 |
Morak M, Musliu N, Pichler R, Rümmele S and Woltran S (2012), "Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming", In Learning and Intelligent Optimization - 6th International Conference, LION 6, Paris, France, January 16-20, 2012, Revised Selected Papers. Vol. 7219, pp. 130-144. Springer. |
Morak M, Musliu N, Pichler R, Rümmele S and Woltran S (2011), "A New Tree-Decomposition Based Algorithm for Answer Set Programming", In IEEE 23rd International Conference on Tools with Artificial Intelligence, ICTAI 2011, Boca Raton, FL, USA, November 7-9, 2011. , pp. 916-918. IEEE. |
Morak M, Musliu N, Pichler R, Rümmele S and Woltran S (2011), "Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming" (DBAI-TR-2011-73) |
Pichler R, Rümmele S and Woltran S (2010), "Multicut Algorithms via Tree Decompositions", In Algorithms and Complexity, 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010. Proceedings. Vol. 6078, pp. 167-179. Springer. |
Morak M, Pichler R, Rümmele S and Woltran S (2010), "A Dynamic-Programming Based ASP-Solver", In Logics in Artificial Intelligence - 12th European Conference, JELIA 2010, Helsinki, Finland, September 13-15, 2010. Proceedings. Vol. 6341, pp. 369-372. Springer. |
Pichler R, Rümmele S, Szeider S and Woltran S (2010), "Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough", In Principles of Knowledge Representation and Reasoning: Proceedings of the Twelfth International Conference, KR 2010, Toronto, Ontario, Canada, May 9-13, 2010. , pp. 508-517. AAAI Press. |
Pichler R, Rümmele S and Woltran S (2010), "Counting and Enumeration Problems with Bounded Treewidth", In Logic for Programming, Artificial Intelligence, and Reasoning - 16th International Conference, LPAR-16, Dakar, Senegal, April 25-May 1, 2010, Revised Selected Papers. Vol. 6355, pp. 387-404. Springer. |
Pichler R, Rümmele S and Woltran S (2010), "Multicut Algorithms via Tree Decompositions" (DBAI-TR-2010-67) |
Pichler R, Rümmele S and Woltran S (2009), "Belief Revision with Bounded Treewidth", In Logic Programming and Nonmonotonic Reasoning, 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009. Proceedings. Vol. 5753, pp. 250-263. Springer. |
Jakl M, Pichler R, Rümmele S and Woltran S (2008), "Fast Counting with Bounded Treewidth", In Logic for Programming, Artificial Intelligence, and Reasoning, 15th International Conference, LPAR 2008, Doha, Qatar, November 22-27, 2008. Proceedings. Vol. 5330, pp. 436-450. Springer. |
Jakl M, Pichler R, Rümmele S and Woltran S (2008), "Fast Counting with Bounded Treewidth" (DBAI-TR-2008-61) |