| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Gaspers, Serge ; Misra, Neeldhara ; Ordyniak, Sebastian ; Szeider, Stefan ; Zivný, Stanislav | Backdoors into Heterogeneous Classes of SAT and CSP | Konferenzbeitrag Inproceedings | 2014 |
| 2 | | Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan | The Complexity of Repairing, Adjusting, and Aggregating of Extensions in Abstract Argumentation | Konferenzbeitrag Inproceedings | 2014 |
| 3 | | Gaspers, Serge ; Ordyniak, Sebastian ; Ramanujan, M.S. ; Saurabh, Saket ; Szeider, Stefan | Backdoors to q-Horn | Konferenzbeitrag Inproceedings | 2013 |
| 4 | | Misra, Neeldhara ; Ordyniak, Sebastian ; Raman, Venkatesh ; Szeider, Stefan | Upper and Lower Bounds for Weak Backdoor Set Detection | Konferenzbeitrag Inproceedings | 2013 |
| 5 | | Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan | Satisfiability of acyclic and almost acyclic CNF formulas | Artikel Article | 2013 |
| 6 | | Ordyniak, S. ; Szeider, S. | Parameterized Complexity Results for Exact Bayesian Network Structure Learning | Artikel Article | 2013 |
| 7 | | Bäckström, Christer ; Jonsson, Peter ; Ordyniak, Sebastian ; Szeider, Stefan | Parameterized Complexity and Kernel Bounds for Hard Planning Problems | Konferenzbeitrag Inproceedings | 2013 |
| 8 | | Gaspers, Serge ; Kim, Eun Jung ; Ordyniak, Sebastian ; Saurabh, Saket ; Szeider, Stefan | Don't Be Strict in Local Search! | Konferenzbeitrag Inproceedings | 2012 |
| 9 | | Gaspers, Serge ; Koivisto, Mikko ; Liedloff, Mathieu ; Ordyniak, Sebastian ; Szeider, Stefan | On Finding Optimal Polytrees | Konferenzbeitrag Inproceedings | 2012 |
| 10 | | Kim, Eun Jung ; Ordyniak, Sebastian | Valued-Based Argumentation for Tree-like Value Graphs | Konferenzbeitrag Inproceedings | 2012 |
| 11 | | Dvořák, Wolfgang ; Ordyniak, Sebastian ; Szeider, Stefan | Augmenting Tractable Fragments of Abstract Argumentation | Artikel Article | 2012 |
| 12 | | Bäckström, Christer ; Chen, Yue ; Jonsson, Peter ; Ordyniak, Sebastian ; Szeider, Stefan | The Complexity of Planning Revisited - A Parameterized Analysis | Konferenzbeitrag Inproceedings | 2012 |
| 13 | | Ordyniak, Sebastian ; Szeider, Stefan | Augmenting Tractable Fragments of Abstract Argumentation | Konferenzbeitrag Inproceedings | 2011 |
| 14 | | Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan | Satisfiability of Acyclic and almost Acyclic CNF Formulas (II) | Konferenzbeitrag Inproceedings | 2011 |
| 15 | | Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan | Algorithms and Complexity Results for Persuasive Argumentation | Artikel Article | 2011 |
| 16 | | Ordyniak, Sebastian ; Paulusma, Daniel ; Szeider, Stefan | Satisfiability of Acyclic and Almost Acyclic CNF Formulas | Konferenzbeitrag Inproceedings | 2010 |
| 17 | | Kim, Eun Jun ; Ordyniak, Sebastian ; Szeider, Stefan | Algorithms and Complexity Results for Persuasive Argumentation | Konferenzbeitrag Inproceedings | 2010 |
| 18 | | Ordyniak, Sebastian ; Szeider, Stefan | Algorithms and Complexity Results for Exact Bayesian Structure Learning | Konferenzbeitrag Inproceedings | 2010 |