| | Preview | Authors / Editors | Title | Type | Issue Date |
| 21 | | Paulusma, Daniel ; Slivovsky, Friedrich ; Szeider, Stefan | Model Counting for CNF Formulas of Bounded Modular Treewidth | Konferenzbeitrag Inproceedings | 2013 |
| 22 | | de Haan, Ronald ; Roubickova, Anna ; Szeider, Stefan | Parameterized Complexity Results for Plan Reuse | Konferenzbeitrag Inproceedings | 2013 |
| 23 | | Kanj, Iyad ; Szeider, Stefan | On the Subexponential Time Complexity of CSP | Konferenzbeitrag Inproceedings | 2013 |
| 24 | | de Haan, Ronald ; Kanj, Iyad ; Szeider, Stefan | Local Backbones | Konferenzbeitrag Inproceedings | 2013 |
| 25 | | Heule, Marijn ; Szeider, Stefan | A SAT Approach to Clique-Width | Konferenzbeitrag Inproceedings | 2013 |
| 26 | | Pfandler, Andreas ; Rümmele, Stefan ; Szeider, Stefan | Backdoors to Abduction | Konferenzbeitrag Inproceedings | 2013 |
| 27 | | Szeider, Stefan | Parameterized Complexity | Präsentation Presentation | 2013 |
| 28 | | Ganian, Robert | Meta-Kernelization with Structural Parameters | Präsentation Presentation | 2013 |
| 29 | | Szeider, Stefan | SAT Approach to Clique-Width | Präsentation Presentation | 2013 |
| 30 | | Ganian, Robert | Meta-Kernelization with Structural Parameters | Präsentation Presentation | 2013 |
| 31 | | Kucera, Antonin ; Potapov, Igor ; Ciabattoni, Agata ; Szeider, Stefan ; Freivalds, Rusins | MFCS & CSL 2010 Satellite Workshops: Selected Papers, Fundamenta Informaticae 123 | Konferenzband Proceedings | 2013 |
| 32 | | Gutin, Gregory ; Szeider, Stefan | Parameterized and Exact Computation, 8th International Symposium, IPEC 2013 (LNCS 8246) | Konferenzband Proceedings | 2013 |
| 33 | | Szeider, Stefan | Capturing Structure in Hard Combinatorial Problems. | Konferenzbeitrag Inproceedings | 2013 |
| 34 | | Müller, Moritz ; Szeider, Stefan | Revisiting Space in Proof Complexity: Treewidth and Pathwidth | Konferenzbeitrag Inproceedings | 2013 |
| 35 | | Szeider, Stefan | The Parameterized Complexity of Constraint Satisfaction and Reasoning | Konferenzbeitrag Inproceedings | 2013 |
| 36 | | Gaspers, Serge ; Szeider, Stefan | Strong Backdoors to Bounded Treewidth SAT | Konferenzbeitrag Inproceedings | 2013 |
| 37 | | Gaspers, Serge ; Ordyniak, Sebastian ; Ramanujan, M.S. ; Saurabh, Saket ; Szeider, Stefan | Backdoors to q-Horn | Konferenzbeitrag Inproceedings | 2013 |
| 38 | | Misra, Neeldhara ; Ordyniak, Sebastian ; Raman, Venkatesh ; Szeider, Stefan | Upper and Lower Bounds for Weak Backdoor Set Detection | Konferenzbeitrag Inproceedings | 2013 |
| 39 | | Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan | Satisfiability of acyclic and almost acyclic CNF formulas | Artikel Article | 2013 |
| 40 | | Ordyniak, S. ; Szeider, S. | Parameterized Complexity Results for Exact Bayesian Network Structure Learning | Artikel Article | 2013 |