| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Kanj, Iyad ; de Haan, Ronald ; Szeider, Stefan | Small Unsatisfiable Subsets in Constraint Satisfaction | Konferenzbeitrag Inproceedings | 2014 |
| 2 | | Gaspers, Serge ; Szeider, Stefan | Guarantees and limits of preprocessing in constraint satisfaction and reasoning | Artikel Article | 2014 |
| 3 | | PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN | Tractable answer-set programming with weight constraints: bounded treewidth is not enough | Artikel Article | 2014 |
| 4 | | Endriss, Ulle ; de Haan, Ronald ; Szeider, Stefan | Parameterized Complexity Results for Agenda Safety in Judgment Aggregation | Konferenzbeitrag Inproceedings | 2014 |
| 5 | | de Haan, Ronald ; Szeider, Stefan | Fixed-Parameter Tractable Reductions to SAT | Konferenzbeitrag Inproceedings | 2014 |
| 6 | | Gaspers, Serge ; Misra, Neeldhara ; Ordyniak, Sebastian ; Szeider, Stefan ; Zivný, Stanislav | Backdoors into Heterogeneous Classes of SAT and CSP | Konferenzbeitrag Inproceedings | 2014 |
| 7 | | de Haan, Ronald ; Szeider, Stefan | The Parameterized Complexity of Reasoning Problems Beyond NP | Konferenzbeitrag Inproceedings | 2014 |
| 8 | | Kanj, Iyad ; de Haan, Ronald ; Szeider, Stefan | Subexponential Time Complexity of CSP with Global Constraints | Konferenzbeitrag Inproceedings | 2014 |
| 9 | | Bova, Simone ; Ganian, Robert ; Szeider, Stefan | Model Checking Existential Logic on Partially Ordered Sets | Konferenzbeitrag Inproceedings | 2014 |
| 10 | | Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation | Konferenzbeitrag Inproceedings | 2014 |
| 11 | | Bova, Simone ; Ganian, Robert ; Szeider, Stefan | Quantified Conjunctive Queries on Partially Ordered Sets | Konferenzbeitrag Inproceedings | 2014 |
| 12 | | Slivovsky, Friedrich ; Szeider, Stefan | Dependency Schemes and Q-resolution | Konferenzbeitrag Inproceedings | 2014 |
| 13 | | Slivovsky, Friedrich ; Szeider, Stefan | Model Counting for Formulas of Bounded Clique-Width | Konferenzbeitrag Inproceedings | 2013 |
| 14 | | Fichte, Johannes ; Szeider, Stefan | Backdoors to Normality for Disjunctive Logic Programs | Konferenzbeitrag Inproceedings | 2013 |
| 15 | | Ganian, Robert ; Slivovsky, Friedrich ; Szeider, Stefan | Meta-kernelization with Structural Parameters | Konferenzbeitrag Inproceedings | 2013 |
| 16 | | Paulusma, Daniel ; Slivovsky, Friedrich ; Szeider, Stefan | Model Counting for CNF Formulas of Bounded Modular Treewidth | Konferenzbeitrag Inproceedings | 2013 |
| 17 | | de Haan, Ronald ; Roubickova, Anna ; Szeider, Stefan | Parameterized Complexity Results for Plan Reuse | Konferenzbeitrag Inproceedings | 2013 |
| 18 | | Kanj, Iyad ; Szeider, Stefan | On the Subexponential Time Complexity of CSP | Konferenzbeitrag Inproceedings | 2013 |
| 19 | | de Haan, Ronald ; Kanj, Iyad ; Szeider, Stefan | Local Backbones | Konferenzbeitrag Inproceedings | 2013 |
| 20 | | Heule, Marijn ; Szeider, Stefan | A SAT Approach to Clique-Width | Konferenzbeitrag Inproceedings | 2013 |