Pichler, R., Polleres, A., Skritek, S., & Woltran, S. (2013). Complexity of redundancy detection on RDF graphs in the presence of rules, constraints, and queries. Semantic Web: Interoperability, Usability, Applicability, 4(4), 351–393. http://hdl.handle.net/20.500.12708/155572 ( reposiTUm)

Letelier, A., Pérez, J., Pichler, R., & Skritek, S. (2013). Static Analysis and Optimization of Semantic Web Queries. ACM Transactions on Database Systems, 38(4), 1–45. https://doi.org/10.1145/2500130 ( reposiTUm)

Pichler, R., & Skritek, S. (2013). Tractable counting of the answers to conjunctive queries. Journal of Computer and System Sciences, 79(6), 984–1001. https://doi.org/10.1016/j.jcss.2013.01.012 ( reposiTUm)

Dvořák, W., Pichler, R., & Woltran, S. (2012). Towards fixed-parameter tractable algorithms for abstract argumentation. Artificial Intelligence, 186, 1–37. https://doi.org/10.1016/j.artint.2012.03.005 ( reposiTUm)

Egly, U., Gaggl, S., & Woltran, S. (2010). Answer-Set Programming Encodings for Argumentation Frameworks. Argument and Computation, 1(2), 147–177. http://hdl.handle.net/20.500.12708/167366 ( reposiTUm)

Roth, A., & Skritek, S. (2013). Peer Data Management. In P. G. Kolaitis, M. Lenzerini, & N. Schweikardt (Eds.), Data Exchange, Integration, and Streams (pp. 185–215). Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany. https://doi.org/10.4230/DFU.Vol5.10452.185 ( reposiTUm)

Creignou, N., Papini, O., Pichler, R., & Woltran, S. (2012). Belief Revision within Fragments of Propositional Logic. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54154 ( reposiTUm)

Erdély, G., Lackner, M., & Pfandler, A. (2012). The Complexity of Nearly Single-Peaked Consistency. In F. Brandt & P. Faliszewski (Eds.), Proceedings of fourth int. conference on Computational Social Choice (p. 12). http://hdl.handle.net/20.500.12708/54178 ( reposiTUm)

Lackner, M., & Pfandler, A. (2012). Fixed-Parameter Algorithms for Finding Minimal Models. In G. Brewka, T. Eiter, & S. McIlraith (Eds.), Proceedings of 13#^{th} int. conf. on Principles of Knowledge Representation and Reasoning (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/54179 ( reposiTUm)

Lackner, M., Pichler, R., Rümmele, S., & Woltran, S. (2012). Multicut on Graphs of Bounded Clique-Width. In G. Lin (Ed.), Combinatorial Optimization and Applications (pp. 115–126). Springer. https://doi.org/10.1007/978-3-642-31770-5_11 ( reposiTUm)

Fellows, M. R., Pfandler, A., Rosamond, F. A., & Rümmele, S. (2012). The Parameterized Complexity of Abduction. In J. Hoffmann & B. Selman (Eds.), Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence (pp. 743–749). AAAI Press. http://hdl.handle.net/20.500.12708/54202 ( reposiTUm)

Dvorak, W., Dunne, P. E., & Woltran, S. (2011). Parametric Properties of Ideal Semantics. In T. Walsh (Ed.), Proceedings of the 22#^{nd} Int. Joint Conference on Artificial Intelligence (p. 6). AAAI Press. http://hdl.handle.net/20.500.12708/53671 ( reposiTUm)

Pichler, R., & Skritek, S. (2011). The Complexity of Evaluating Tuple Generating Dependencies. In T. Milo (Ed.), Proceedings of the 14#^{th} International Conference on Database Theory (p. 12). ACM. http://hdl.handle.net/20.500.12708/53675 ( reposiTUm)

Pichler, R., Rümmele, S., & Woltran, S. (2010). Multicut Algorithms via Tree Decompositions. In T. Calamoneri & J. Diaz (Eds.), Algorithms and Complexity : 7th International Conference, CIAC 2010, Rome, Italy, May 26-28, 2010, Proceedings (pp. 167–179). LNCS, Springer. https://doi.org/10.1007/978-3-642-13073-1_16 ( reposiTUm)

Dvorak, W., Pichler, R., & Woltran, S. (2010). Towards Fixed-Parameter Tractable Algorithms for Argumentation. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 11). AAAI Press. http://hdl.handle.net/20.500.12708/53170 ( reposiTUm)

Faber, W., & Woltran, S. (2009). A Framework for Programming with Module Consequences. In M. De Vos & T. Schaub (Eds.), Proc. of the 2#^{nd} International Workshop on Software Engineering for Answer Set Programming (SEA’09) (pp. 34–48). http://hdl.handle.net/20.500.12708/52763 ( reposiTUm)

Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-Reasoning. In A. Herzig & B. Johnston (Eds.), Proc. of the IJCAI-09 Workshop on Nonmonotonic Reasoning, Action and Change (NRAC’09) (pp. 33–40). ePress of the University of Technology, Sydney. http://hdl.handle.net/20.500.12708/52762 ( reposiTUm)

Pichler, R., Rümmele, S., & Woltran, S. (2009). Belief Revision with Bounded Treewidth. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 250–263). Springer. https://doi.org/10.1007/978-3-642-04238-6_22 ( reposiTUm)

Faber, W., & Woltran, S. (2009). Manifold Answer-Set Programs for Meta-reasoning. In E. Erdem, F. Lin, & T. Schaub (Eds.), Logic Programming and Nonmonotonic Reasoning: 10th International Conference, LPNMR 2009, Potsdam, Germany, September 14-18, 2009, Proceedings (pp. 115–128). Springer. https://doi.org/10.1007/978-3-642-04238-6_12 ( reposiTUm)

Dvořák, W., Gottlob, G., Pichler, R., & Woltran, S. (2009). Alternation as a programming paradigm. In A. Porto & F. J. Lopez-Fraguas (Eds.), Proceedings of the 11th ACM SIGPLAN conference on Principles and practice of declarative programming - PPDP ’09. ACM Press. https://doi.org/10.1145/1599410.1599419 ( reposiTUm)

Jakl, M., Pichler, R., & Woltran, S. (2009). Answer-Set Programming with Bounded Tree Width. In C. Boutilier (Ed.), Proc. of the Twenty-First Int. Joint Conference on Artificial Intelligence (pp. 816–822). AAAI Press. http://hdl.handle.net/20.500.12708/52743 ( reposiTUm)

Delgrande, J. P., Schaub, T., Tompits, H., & Woltran, S. (2009). Merging Logic Programs under Answer Set Semantics. In P. M. Hill & D. S. Warren (Eds.), Logic Programming: 25th International Conference, ICLP 2009, Pasadena, CA, USA, July 14-17, 2009, Proceedings (pp. 160–174). Springer. https://doi.org/10.1007/978-3-642-02846-5_17 ( reposiTUm)

Dvorak, W., Pichler, R., & Woltran, S. (2011). Towards Fixed-Parameter Tractable Algorithms for Abstract Argumentation (DBAI-TR-2011-74). http://hdl.handle.net/20.500.12708/37126 ( reposiTUm)

Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. CoRR - Computing Research Repository. https://doi.org/10.48550/arXiv.1204.3040 ( reposiTUm)