| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Ganian, Robert ; Hliněný, Petr ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter ; Sikdar, Somnath | Lower bounds on the complexity of MSO₁ model-checking | Artikel Article | Feb-2014 |
| 2 | | Ganian, Robert ; Hliněný, Petr ; Kneis, Joachim ; Langer, Alexander ; Obdržálek, Jan ; Rossmanith, Peter | Digraph Width Measures in Parameterized Algorithmics | Artikel Article | 2014 |
| 3 | | Gaspers, Serge ; Szeider, Stefan | Guarantees and limits of preprocessing in constraint satisfaction and reasoning | Artikel Article | 2014 |
| 4 | | PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN | Tractable answer-set programming with weight constraints: bounded treewidth is not enough | Artikel Article | 2014 |
| 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 | | Dvořák, Wolfgang ; Ordyniak, Sebastian ; Szeider, Stefan | Augmenting Tractable Fragments of Abstract Argumentation | Artikel Article | 2012 |
| 8 | | Gaspers, Serge ; Liedloff, Mathieu | A Branch-and-Reduce Algorithm for Finding a Minimum Independent Dominating Set | Artikel Article | 2012 |
| 9 | | Gaspers, Serge ; Kratsch, Dieter ; Liedloff, Mathieu | On Independent Sets and Bicliques in Graphs | Artikel Article | 2012 |
| 10 | | PICHLER, REINHARD ; RÜMMELE, STEFAN ; SZEIDER, STEFAN ; WOLTRAN, STEFAN | Tractable Answer-Set Programming with Weight Constraints: Bounded Treewidth is not Enough | Artikel Article | 2012 |
| 11 | | Gutin, Gregory ; Kim, Eun Jung ; Soleimanfallah, Arezou ; Szeider, Stefan ; Yeo, Anders | Parameterized Complexity Results for General Factors in Bipartite Graphs with an Application to Constraint Programming | Artikel Article | 2012 |
| 12 | | van ’t Hof, Pim ; Kamiński, Marcin ; Paulusma, Daniël ; Szeider, Stefan ; Thilikos, Dimitrios M. | On Graph Contractions and Induced Minors | Artikel Article | 2012 |
| 13 | | Gaspers, Serge ; Sorkin, Gregory B. | A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between | Artikel Article | 2012 |
| 14 | | Fellows, Michael R. ; Gaspers, Serge ; Rosamond, Frances A. | Parameterizing by the Number of Numbers | Artikel Article | 2012 |
| 15 | | Alon, Noga ; Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders | Solving MAX-r-SAT Above a Tight Lower Bound | Artikel Article | 2011 |
| 16 | | Kim, Eun Jung ; Ordyniak, Sebastian ; Szeider, Stefan | Algorithms and Complexity Results for Persuasive Argumentation | Artikel Article | 2011 |
| 17 | | Atserias, A. ; Fichte, J. K. ; Thurley, M. | Clause-learning algorithms with many restarts and bounded-width resolution | Artikel Article | 2011 |
| 18 | | Szeider, Stefan | Monadic Second Order Logic on Graphs with Local Cardinality Constraints | Artikel Article | 2011 |
| 19 | | Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders | A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds | Artikel Article | 2011 |
| 20 | | Szeider, Stefan | The Parameterized Complexity of k-Flip Local Search for SAT and MAX SAT | Artikel Article | 2011 |