Ganian, R., Hliněný, P., Langer, A., Obdržálek, J., Rossmanith, P., & Sikdar, S. (2014). Lower bounds on the complexity of MSO₁ model-checking. Journal of Computer and System Sciences, 80(1), 180–194. https://doi.org/10.1016/j.jcss.2013.07.005 ( reposiTUm)

Gaspers, S., & Szeider, S. (2014). Guarantees and limits of preprocessing in constraint satisfaction and reasoning. Artificial Intelligence, 216, 1–19. https://doi.org/10.1016/j.artint.2014.06.006 ( reposiTUm)

Ganian, R., Hliněný, P., Kneis, J., Langer, A., Obdržálek, J., & Rossmanith, P. (2014). Digraph Width Measures in Parameterized Algorithmics. Discrete Applied Mathematics, 168, 88–107. https://doi.org/10.1016/j.dam.2013.10.038 ( reposiTUm)

Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity Results for Exact Bayesian Network Structure Learning. Journal of Artificial Intelligence Research, 46, 263–302. https://doi.org/10.1613/jair.3744 ( reposiTUm)

Ordyniak, S., Paulusma, D., & Szeider, S. (2013). Satisfiability of acyclic and almost acyclic CNF formulas. Theoretical Computer Science, 481, 85–99. https://doi.org/10.1016/j.tcs.2012.12.039 ( reposiTUm)

Dvořák, W., Ordyniak, S., & Szeider, S. (2012). Augmenting Tractable Fragments of Abstract Argumentation. Artificial Intelligence, 186, 157–173. https://doi.org/10.1016/j.artint.2012.03.002 ( reposiTUm)

Gaspers, S., & Sorkin, G. B. (2012). A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between. Journal of Computer and System Sciences, 78(1), 305–335. https://doi.org/10.1016/j.jcss.2011.05.010 ( reposiTUm)

Gaspers, S., & Liedloff, M. (2012). A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set. DISCRETE MATHEMATICS AND THEORETICAL COMPUTER SCIENCE, 78–89. https://doi.org/10.1007/11917496_8 ( reposiTUm)

Gaspers, S., Kratsch, D., & Liedloff, M. (2012). On Independent Sets and Bicliques in Graphs. Algorithmica, 62(3–4), 637–658. https://doi.org/10.1007/s00453-010-9474-1 ( reposiTUm)

Fellows, M. R., Gaspers, S., & Rosamond, F. A. (2012). Parameterizing by the Number of Numbers. Theory of Computing Systems, 50(4), 675–693. https://doi.org/10.1007/s00224-011-9367-y ( reposiTUm)

van ’t Hof, P., Kamiński, M., Paulusma, D., Szeider, S., & Thilikos, D. M. (2012). On Graph Contractions and Induced Minors. Discrete Applied Mathematics, 160(6), 799–809. https://doi.org/10.1016/j.dam.2010.05.005 ( reposiTUm)

PICHLER, R., RÜMMELE, S., SZEIDER, S., & WOLTRAN, S. (2012). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough. Theory and Practice of Logic Programming, 14(2), 141–164. https://doi.org/10.1017/s1471068412000099 ( reposiTUm)

Gutin, G., Kim, E. J., Soleimanfallah, A., Szeider, S., & Yeo, A. (2012). Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. Algorithmica, 64(1), 112–125. https://doi.org/10.1007/s00453-011-9548-8 ( reposiTUm)

Alon, N., Gutin, G., Kim, E. J., Szeider, S., & Yeo, A. (2011). Solving MAX-r-SAT Above a Tight Lower Bound. Algorithmica, 61(3), 638–655. https://doi.org/10.1007/s00453-010-9428-7 ( reposiTUm)

Kim, E. J., Ordyniak, S., & Szeider, S. (2011). Algorithms and Complexity Results for Persuasive Argumentation. Artificial Intelligence, 175(9–10), 1722–1736. https://doi.org/10.1016/j.artint.2011.03.001 ( reposiTUm)

Szeider, S. (2011). Monadic Second Order Logic on Graphs with Local Cardinality Constraints. ACM Transactions on Computational Logic, 12(2), 1–21. https://doi.org/10.1145/1877714.1877718 ( reposiTUm)

Szeider, S. (2011). The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT. Discrete Optimization, 8(1), 139–145. http://hdl.handle.net/20.500.12708/162540 ( reposiTUm)

Gutin, G., Kim, E. J., Szeider, S., & Yeo, A. (2011). A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds. Journal of Computer and System Sciences, 77(2), 422–429. https://doi.org/10.1016/j.jcss.2010.06.001 ( reposiTUm)

Atserias, A., Fichte, J. K., & Thurley, M. (2011). Clause-learning algorithms with many restarts and bounded-width resolution. Journal of Artificial Intelligence Research, 40, 353–373. https://doi.org/10.1613/jair.3152 ( reposiTUm)

Broersma, H., Dantchev, S. S., Johnson, M., & Szeider, S. (2010). Journal of Discrete Algorithms 8(2) - Editorial. Journal of Discrete Algorithms, 8(2), iii–iv. https://doi.org/10.1016/s1570-8667(10)00008-0 ( reposiTUm)

Bova, S., Ganian, R., & Szeider, S. (2014). Model Checking Existential Logic on Partially Ordered Sets. In CSL-LICS 2014. Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS), Vienna, Austria. ACM New York, NY, USA. http://hdl.handle.net/20.500.12708/55811 ( reposiTUm)

Endriss, U., de Haan, R., & Szeider, S. (2014). Parameterized Complexity Results for Agenda Safety in Judgment Aggregation. In COMSOC 2014. International Workshop on Computational Social Choice (COMSOC), Krakow, Poland. http://hdl.handle.net/20.500.12708/55806 ( reposiTUm)

Kanj, I., de Haan, R., & Szeider, S. (2014). Subexponential Time Complexity of CSP with Global Constraints. In CP 2014 (pp. 272–288). LNCS / Springer. http://hdl.handle.net/20.500.12708/55810 ( reposiTUm)

Gaspers, S., Misra, N., Ordyniak, S., Szeider, S., & Zivný, S. (2014). Backdoors into Heterogeneous Classes of SAT and CSP. In AAAI 2014 (pp. 2652–2658). http://hdl.handle.net/20.500.12708/55809 ( reposiTUm)

Slivovsky, F., & Szeider, S. (2014). Dependency Schemes and Q-resolution. In SAT 2014 (pp. 269–284). LNCS / Springer. http://hdl.handle.net/20.500.12708/55816 ( reposiTUm)

Kim, E. J., Ordyniak, S., & Szeider, S. (2014). The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation. In TAFA 2013 (pp. 158–175). LNAI / Springer. http://hdl.handle.net/20.500.12708/55815 ( reposiTUm)

Bova, S., & Chen, H. (2014). The Complexity of Width Minimization for Existential Positive Queries. In ICDT 2014 (pp. 235–244). http://hdl.handle.net/20.500.12708/55813 ( reposiTUm)

Bova, S., Ganian, R., & Szeider, S. (2014). Quantified Conjunctive Queries on Partially Ordered Sets. In IPEC 2014 (pp. 122–134). LNCS / Springer. http://hdl.handle.net/20.500.12708/55812 ( reposiTUm)

de Haan, R., & Szeider, S. (2014). Fixed-Parameter Tractable Reductions to SAT. In SAT 2014 (pp. 85–102). LNCS / Springer. http://hdl.handle.net/20.500.12708/55808 ( reposiTUm)

de Haan, R., & Szeider, S. (2014). The Parameterized Complexity of Reasoning Problems Beyond NP. In KR 2014 (pp. 82–91). http://hdl.handle.net/20.500.12708/55807 ( reposiTUm)

Kanj, I., de Haan, R., & Szeider, S. (2014). Small Unsatisfiable Subsets in Constraint Satisfaction. In IEEE-ICTAI 2014. The IEEE International Conference on Tools with Artificial Intelligence, Special Track on SAT and CSP Technologies (ICTAI), Washington D.C., United States of America (the). http://hdl.handle.net/20.500.12708/55734 ( reposiTUm)

Gaspers, S., Ordyniak, S., Ramanujan, M. S., Saurabh, S., & Szeider, S. (2013). Backdoors to q-Horn. In N. Portier & T. Wilke (Eds.), 30th Symposium on Theoretical Aspects of Computer Science (STACS´13) (pp. 67–79). Dagstuhl Publishing. http://hdl.handle.net/20.500.12708/54875 ( reposiTUm)

Slivovsky, F., & Szeider, S. (2013). Model Counting for Formulas of Bounded Clique-Width. In L. Cai, S.-W. Cheng, & T.-W. Lam (Eds.), Algorithms and Computation (pp. 677–687). Springer / LNCS. https://doi.org/10.1007/978-3-642-45030-3_63 ( reposiTUm)

Heule, M., & Szeider, S. (2013). A SAT Approach to Clique-Width. In M. Järvisalo & A. Van Gelder (Eds.), Theory and Applications of Satisfiability Testing - SAT 2013 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings. Springer / LNCS. https://doi.org/10.1007/978-3-642-39071-5_24 ( reposiTUm)

de Haan, R., Roubickova, A., & Szeider, S. (2013). Parameterized Complexity Results for Plan Reuse. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 224–231). AAAI Press. http://hdl.handle.net/20.500.12708/54863 ( reposiTUm)

Gaspers, S., & Szeider, S. (2013). Strong Backdoors to Bounded Treewidth SAT. In O. Reingold (Ed.), 2013 IEEE 54th Annual Symposium on Foundations of Computer Science. IEEE. https://doi.org/10.1109/focs.2013.59 ( reposiTUm)

Ganian, R., & Obdrálek, J. (2013). Expanding the Expressive Power of Monadic Second-Order Logic on Restricted Graph Classes. In T. Lecroq & L. Mouchard (Eds.), Combinatorial Algorithms - 24th International Workshop (pp. 164–177). Springer / LNCS. http://hdl.handle.net/20.500.12708/54878 ( reposiTUm)

Ganian, R., Hlinený, P., Král, D., Obdrálek, J., Schwartz, J., & Teska, J. (2013). FO Model Checking of Interval Graphs. In Automata, Languages, and Programming - 40th International Colloquium (pp. 250–262). Springer / LNCS. http://hdl.handle.net/20.500.12708/54877 ( reposiTUm)

Misra, N., Ordyniak, S., Raman, V., & Szeider, S. (2013). Upper and Lower Bounds for Weak Backdoor Set Detection. In M. Järvisalo & A. Van Gelder (Eds.), Theory and Applications of Satisfiability Testing - SAT 2013 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings. Springer / LNCS. https://doi.org/10.1007/978-3-642-39071-5_29 ( reposiTUm)

de Haan, R., Kanj, I., & Szeider, S. (2013). Local Backbones. In M. Järvisalo & A. Van Gelder (Eds.), Theory and Applications of Satisfiability Testing - SAT 2013 16th International Conference, Helsinki, Finland, July 8-12, 2013, Proceedings. LNCS / Springer. https://doi.org/10.1007/978-3-642-39071-5_28 ( reposiTUm)

Ganian, R., Slivovsky, F., & Szeider, S. (2013). Meta-kernelization with Structural Parameters. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 457–468). Springer / LNCS. https://doi.org/10.1007/978-3-642-40313-2_41 ( reposiTUm)

Fichte, J., & Szeider, S. (2013). Backdoors to Normality for Disjunctive Logic Programs. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 320–327). AAAI Press. http://hdl.handle.net/20.500.12708/54865 ( reposiTUm)

Kanj, I., & Szeider, S. (2013). On the Subexponential Time Complexity of CSP. In M. desJardins & M. Littman (Eds.), Proceedings of the 27th AAAI Conference on Artificial Intelligence (AAAI´13) (pp. 459–465). AAAI Press. http://hdl.handle.net/20.500.12708/54867 ( reposiTUm)

Pfandler, A., Rümmele, S., & Szeider, S. (2013). Backdoors to Abduction. In F. Rossi (Ed.), Proceedings of the Twenty-Third International Joint Conference on Artificial Intelligence (pp. 1046–1052). AAAI Press. http://hdl.handle.net/20.500.12708/54790 ( reposiTUm)

Paulusma, D., Slivovsky, F., & Szeider, S. (2013). Model Counting for CNF Formulas of Bounded Modular Treewidth. In N. Portier & T. Wilke (Eds.), 30th Symposium on Theoretical Aspects of Computer Science (STACS´13) (pp. 55–66). Dagstuhl Publishing. http://hdl.handle.net/20.500.12708/54874 ( reposiTUm)

Szeider, S. (2013). The Parameterized Complexity of Constraint Satisfaction and Reasoning. In H. Tompits, S. Abreu, J. Oetsch, J. Pührer, D. Seipel, M. Umeda, & A. Wolf (Eds.), Applications of Declarative Programming and Knowledge Management (pp. 27–37). Springer / LNCS. https://doi.org/10.1007/978-3-642-41524-1_2 ( reposiTUm)

Szeider, S. (2013). Capturing Structure in Hard Combinatorial Problems. In Proceedings of the International Conference on Tools with Artificial Intelligence (ICTAI). The IEEE International Conference on Tools with Artificial Intelligence, Special Track on SAT and CSP Technologies (ICTAI), Washington D.C., USA, Non-EU. http://hdl.handle.net/20.500.12708/54879 ( reposiTUm)

Slivovsky, F., & Szeider, S. (2013). Variable Dependencies and Q-Resolution. In F. Lonsing & M. Seidl (Eds.), International Workshop on Quantified Boolean Formulas 2013 Informal Workshop Report (pp. 22–29). http://hdl.handle.net/20.500.12708/54888 ( reposiTUm)

Müller, M., & Szeider, S. (2013). Revisiting Space in Proof Complexity: Treewidth and Pathwidth. In K. Chatterjee & J. Sgall (Eds.), Mathematical Foundations of Computer Science 2013 (pp. 704–716). Springer / LNCS. https://doi.org/10.1007/978-3-642-40313-2_62 ( reposiTUm)

Bäckström, C., Jonsson, P., Ordyniak, S., & Szeider, S. (2013). Parameterized Complexity and Kernel Bounds for Hard Planning Problems. In P. G. Spirakis & M. Serna (Eds.), Algorithms and Complexity 8th International Conference, CIAC 2013, Barcelona, Spain, May 22-24, 2013. Proceedings. Springer / LNCS. https://doi.org/10.1007/978-3-642-38233-8_2 ( reposiTUm)

Slivovsky, F., & Szeider, S. (2012). Computing Resolution-Path Dependencies in Linear Time ,. In A. Cimatti & R. Sebastiani (Eds.), Theory and Applications of Satisfiability Testing – SAT 2012 (pp. 58–71). LNCS / Springer. https://doi.org/10.1007/978-3-642-31612-8_6 ( reposiTUm)

Gaspers, S., & Szeider, S. (2012). Strong Backdoors to Nested Satisfiability. In A. Cimatti & R. Sebastiani (Eds.), Proceedings of the Fifteen International Conference on Theory and Applications of Satisfiability Testing (SAT 2012) (pp. 58–71). LNCS / Springer. http://hdl.handle.net/20.500.12708/54319 ( reposiTUm)

Fomin, F. V., Gaspers, S., Golovach, P., Suchan, K., Szeider, S., van Leeuwen, E. J., Vatshelle, M., & Villanger, Y. (2012). k-Gap Interval Graphs. In D. Fernández-Baca (Ed.), LATIN 2012: Theoretical Informatics (pp. 350–361). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-29344-3_30 ( reposiTUm)

Gaspers, S., Kim, E. J., Ordyniak, S., Saurabh, S., & Szeider, S. (2012). Don’t Be Strict in Local Search! In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 486–492). AAAI Press. http://hdl.handle.net/20.500.12708/54316 ( reposiTUm)

Gaspers, S., Koivisto, M., Liedloff, M., Ordyniak, S., & Szeider, S. (2012). On Finding Optimal Polytrees. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 750–756). AAAI Press. http://hdl.handle.net/20.500.12708/54315 ( reposiTUm)

Gaspers, S., & Szeider, S. (2012). Backdoors to Acyclic SAT. In Automata, Languages, and Programming (pp. 363–374). Springer-Verlag. https://doi.org/10.1007/978-3-642-31594-7_31 ( reposiTUm)

Kim, E. J., & Ordyniak, S. (2012). Valued-Based Argumentation for Tree-like Value Graphs. In B. Verheij, S. Szeider, & S. Woltran (Eds.), Fourth International Conference on Computational Models of Argument (Comma 2012) (pp. 378–389). IOS Press. http://hdl.handle.net/20.500.12708/54321 ( reposiTUm)

Fichte, J., & Szeider, S. (2012). Backdoors to Normality for Disjunctive Logic Programs. In Y. Lierler & M. Fink (Eds.), Proceedings of the 5th Workshop on Answer Set Programming and Other Computing Paradigms (ASPOCP 2012) (pp. 99–113). http://hdl.handle.net/20.500.12708/54323 ( reposiTUm)

Fichte, J. K. (2012). The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. In D. Lassiter & M. Slavkovik (Eds.), New Directions in Logic, Language, and Computation ESSLLI 2010 and ESSLLI 2011 Student Sessions, Selected Papers (pp. 78–90). Springer LNCS. https://doi.org/10.1007/978-3-642-31467-4_6 ( reposiTUm)

Dvořák, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. In E. Hüllermeier, S. Link, T. Fober, & B. Seeger (Eds.), Scalable Uncertainty Management 6th International Conference, SUM 2012, Marburg, Germany, September 17-19, 2012, Proceedings (pp. 85–98). Lecture Notes in Computer Science / Springer. https://doi.org/10.1007/978-3-642-33362-0_7 ( reposiTUm)

Bäckström, C., Chen, Y., Jonsson, P., Ordyniak, S., & Szeider, S. (2012). The Complexity of Planning Revisited - A Parameterized Analysis. In J. Hoffmann & B. Selman (Eds.), Proceedings of the 26th Conference on Artificial Intelligence (AAAI 2012) (pp. 1735–1741). AAAI Press. http://hdl.handle.net/20.500.12708/54314 ( reposiTUm)

Gaspers, S., & Szeider, S. (2011). The Parameterized Complexity of Local Consistency. In Principles and Practice of Constraint Programming – CP 2011 (pp. 302–316). Lecture Notes in Computer Science, Springer. https://doi.org/10.1007/978-3-642-23786-7_24 ( reposiTUm)

Szeider, S. (2011). Limits of Preprocessing. In Proceedings of the Twenty-Fifth Conference on Artificial Intelligence (AAAI 2011) (pp. 93–98). http://hdl.handle.net/20.500.12708/53759 ( reposiTUm)

Gaspers, S., Liedloff, M., Stein, M., & Suchan, K. (2011). Complexity of Splits Reconstruction for Low-Degree Trees. In Graph-Theoretic Concepts in Computer Science (pp. 167–178). Lecture Notes in Computer Science, Springer. https://doi.org/10.1007/978-3-642-25870-1_16 ( reposiTUm)

Fichte, J. (2011). The Good, the Bad, and the Odd: Cycles in Answer-Set Programs. In Proceedings of the 2011 ESSLLI Student Session (23rd European Summer School in Logic, Language, & Information) (p. 9). http://hdl.handle.net/20.500.12708/53765 ( reposiTUm)

Ordyniak, S., Paulusma, D., & Szeider, S. (2011). Satisfiability of Acyclic and almost Acyclic CNF Formulas (II). In Theory and Applications of Satisfiability Testing - SAT 2011 (pp. 47–60). Lecture Notes in Computer Science. https://doi.org/10.1007/978-3-642-21581-0_6 ( reposiTUm)

Fichte, J., & Szeider, S. (2011). Backdoors to Tractable Answer-Set Programming. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 863–868). http://hdl.handle.net/20.500.12708/53762 ( reposiTUm)

Gaspers, S., & Szeider, S. (2011). Kernels for Global Constraints. In Proceedings of the 22nd International Joint Conference on Artificial Intelligence (IJCAI 2011) (pp. 540–545). http://hdl.handle.net/20.500.12708/53760 ( reposiTUm)

Ordyniak, S., & Szeider, S. (2011). Augmenting Tractable Fragments of Abstract Argumentation. In T. Walsh (Ed.), Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence (pp. 1033–1038). http://hdl.handle.net/20.500.12708/53761 ( reposiTUm)

Fellows, M. R., Gaspers, S., & Rosamond, F. A. (2010). Parameterizing by the Number of Numbers. In Parameterized and Exact Computation (pp. 123–134). Springer LNCS. https://doi.org/10.1007/978-3-642-17493-3_13 ( reposiTUm)

Kim, E. J., Ordyniak, S., & Szeider, S. (2010). Algorithms and Complexity Results for Persuasive Argumentation. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Proceedings of Third International Conference on Computational Models of Argument (COMMA 2010) (pp. 311–322). IOS Press. http://hdl.handle.net/20.500.12708/53322 ( reposiTUm)

Dvorak, W., Szeider, S., & Woltran, S. (2010). Reasoning in Argumentation Frameworks of Bounded Clique-Width. In P. Baroni, F. Cerutti, M. Giacomin, & G. R. Simari (Eds.), Proceedings of COMMA 2010 (pp. 219–230). IOS Press. http://hdl.handle.net/20.500.12708/53323 ( reposiTUm)

Ordyniak, S., & Szeider, S. (2010). Algorithms and Complexity Results for Exact Bayesian Structure Learning. In P. Grünwald & P. Spirtes (Eds.), Proceedings of the 26th Conference on Uncertainty in Artificial Intelligence (UAI 2010) (pp. 401–408). AUAI Press. http://hdl.handle.net/20.500.12708/53324 ( reposiTUm)

Alon, N., Gutin, G., Kim, E. J., Szeider, S., & Yeo, A. (2010). Solving MAX-r-SAT Above a Tight Lower Bound. In M. Charikar (Ed.), Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 511–517). ACM-SIAM. http://hdl.handle.net/20.500.12708/53318 ( reposiTUm)

Gutin, G., Kim, E. J., Soleimanfallah, A., Szeider, S., & Yeo, A. (2010). Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming. In V. Raman & S. Saurabh (Eds.), Parameterized and Exact Computation (pp. 158–169). Springer. https://doi.org/10.1007/978-3-642-17493-3_16 ( reposiTUm)

Ordyniak, S., Paulusma, D., & Szeider, S. (2010). Satisfiability of Acyclic and Almost Acyclic CNF Formulas. In K. Lodaya & M. Mahajan (Eds.), IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS 2010) (pp. 84–95). Leibniz International Proceedings in Informatics (LIPIcs). https://doi.org/10.4230/LIPIcs.FSTTCS.2010.84 ( reposiTUm)

Pichler, R., Rümmele, S., Szeider, S., & Woltran, S. (2010). Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth Is not Enough. In F. Lin, U. Sattler, & M. Truszczynski (Eds.), Proc. of KR 2010 (p. 10). AAAI Press. http://hdl.handle.net/20.500.12708/53171 ( reposiTUm)

Szeider, S. (2010). Not So Easy Problems For Tree Decomposable Graphs. In Selected and revised papers of ICDM 2008 (pp. 179–190). Ramanujan Mathematical Society (RMS). http://hdl.handle.net/20.500.12708/53531 ( reposiTUm)

Gaspers, S., & Szeider, S. (2012). Backdoors to Satisfaction. In H. L. Bodlaender, R. G. Downey, F. Fomin, & D. Marx (Eds.), The Multivariate Algorithmic Revolution and Beyond (pp. 287–317). Springer LNCS. https://doi.org/10.1007/978-3-642-30891-8_15 ( reposiTUm)

Fellows, M. R., Gaspers, S., & Rosamond, F. (2011). Multivariate Complexity Theory. In E. K. Blum & A. V. Aho (Eds.), Computer Science (pp. 269–293). Springer. https://doi.org/10.1007/978-1-4614-1168-0_13 ( reposiTUm)

Gutin, G., & Szeider, S. (Eds.). (2013). Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246). Springer-Verlag. http://hdl.handle.net/20.500.12708/23746 ( reposiTUm)

MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123. (2013). In A. Kucera, I. Potapov, A. Ciabattoni, S. Szeider, & R. Freivalds (Eds.), Fundamenta Informaticae. IOS Press. http://hdl.handle.net/20.500.12708/23747 ( reposiTUm)

Verheij, B., Szeider, S., & Woltran, S. (Eds.). (2012). Fourth International Conference on Computational Models of Argument (COMMA 2012). IOS Press. http://hdl.handle.net/20.500.12708/23575 ( reposiTUm)

Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Contemporary Trends in Theoretical Computer Science (STTI 2013), Prague, Czech Republic, EU. http://hdl.handle.net/20.500.12708/85671 ( reposiTUm)

Ganian, R. (2013). Meta-Kernelization with Structural Parameters. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/85670 ( reposiTUm)

Szeider, S. (2013). SAT Approach to Clique-Width. Workshop on Graph Classes, Optimization, and Width Parameters (GROW), Santorini Island, Greece, EU. http://hdl.handle.net/20.500.12708/85669 ( reposiTUm)

Szeider, S. (2013). Parameterized Complexity. the International SAT/SMT Summer School, Espoo, Finland, EU. http://hdl.handle.net/20.500.12708/85668 ( reposiTUm)

Szeider, S. (2012). The Parameterized Complexity of Propositional Satisfiability. Statistical Mechanics of Unsatisfiability and Glasses, Ferry Stockholm-Mariehamn and Hotel Arkipelag, Mariehamn, Åland, EU. http://hdl.handle.net/20.500.12708/85422 ( reposiTUm)

Szeider, S. (2012). Parameterized Complexity. The Logic and Interactions Winter School, CIRM, Marseille, France, EU. http://hdl.handle.net/20.500.12708/85423 ( reposiTUm)

Szeider, S. (2012). Parameterized Complexity Results for Probabilistic Network Structure Learning. Workshop on Applications of Parameterized Algorithms and Complexit, Warwick, UK, EU. http://hdl.handle.net/20.500.12708/85421 ( reposiTUm)

Dvorak, W., Szeider, S., & Woltran, S. (2012). Abstract Argumentation via Monadic Second Order Logic. (DBAI-TR-2012-79). http://hdl.handle.net/20.500.12708/37417 ( reposiTUm)