|
| | Preview | Author(s) | Title | Type | Issue Date |
| 1 | | Gutin, Gregory ; Kim, Eun Jung ; Szeider, Stefan ; Yeo, Anders | A Probabilistic Approach to Problems Parameterized Above or Below Tight Bounds | Artikel Article | 2011 |
| 2 | | Kotek, T. ; Makowsky, J.A. | A representation theorem for (q-)holonomic sequences | Artikel Article | 2014 |
| 3 | | Eiben, Eduard ; Ganian, Robert ; Kwon, O-joung | A single-exponential fixed-parameter algorithm for distance-hereditary vertex deletion | Artikel Article  | 2018 |
| 4 | | Gaspers, Serge ; Sorkin, Gregory B. | A universally fastest algorithm for Max 2-Sat, Max 2-CSP, and everything in between | Artikel Article | 2012 |
| 5 | | Gaspers, Serge ; Misra, Neeldhara ; Ordyniak, Sebastian ; Szeider, Stefan ; Živný, Stanislav | Backdoors into heterogeneous classes of SAT and CSP | Artikel Article | 2017 |
| 6 | | Creignou, Nadia ; Papini, Odile ; Pichler, Reinhard ; Woltran, Stefan | Belief revision within fragments of propositional logic | Artikel Article | 2014 |
| 7 | | Bäckström, Christer ; Jonsson, Peter ; Ordyniak, Sebastian ; Szeider, Stefan | A Complete Parameterized Complexity Analysis of Bounded Planning | Artikel Article | Nov-2015 |
| 8 | | Eiter, Thomas ; Ortiz, Magdalena ; Šimkus, Mantas | Conjunctive query answering in the description logic SH using knots | Artikel Article | 2012 |
| 9 | | Samer, Marko ; Szeider, Stefan | Constraint Satisfaction with Bounded Treewidth Revisited | Artikel Article | 2010 |
| 10 | | Hermann, Miki ; Pichler, Reinhard | Counting complexity of propositional abduction | Artikel Article | 2010 |
| 11 | | Brand, Cornelius | Discriminantal subset convolution: Refining exterior-algebraic methods for parameterized algorithms | Article Artikel | 2022 |
| 12 | | Mathieson, Luke ; Szeider, Stefan | Editing Graphs to Satisfy Degree Constraints: A Parameterized Approach | Artikel Article | 2012 |
| 13 | | Dolev, Danny ; Függer, Matthias ; Lenzen, Christoph ; Perner, Martin ; Schmid, Ulrich | HEX: Scaling Honeycombs is Easier than Scaling Clock Trees | Artikel Article | 2016 |
| 14 | | Gajarsky, Jakub ; Hlinený, Petr ; Obdrzalek, Jan ; Ordyniak, Sebastian ; Reidl, Felix ; Rossmanith, Peter ; Villaamil Sanchez, Fernando ; Sikdar, Somnath | Kernelization using structural parameters on sparse graph classes | Artikel Article | 14-Nov-2017 |
| 15 | | Bessy, Stéphane ; Fomin, Fedor V. ; Gaspers, Serge ; Paul, Christophe ; Perez, Anthony ; Saurabh, Saket ; Thomassé, Stéphan | Kernels for Feedback Arc Set In Tournaments | Artikel Article | 2011 |
| 16 | | 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 |
| 17 | | Eiben, Eduard ; Ganian, Robert ; Hamm, Thekla ; Kwon, O-joung | Measuring what matters: Ahybrid approach to dynamic programming with treewidth | Artikel Article | 2021 |
| 18 | | Ganian, Robert ; Slivovsky, Friedrich ; Szeider, Stefan | Meta-kernelization with structural parameters | Artikel Article | 2016 |
| 19 |  | Binucci, Carla ; Di Giacomo, Emilio ; Lenhart, William ; Liotta, Giuseppe ; Montecchiani, Fabrizio ; Nöllenburg, Martin ; Symvonis, Antonios | On the complexity of the storyplan problem | Article Artikel   | Feb-2024 |
| 20 | | Eiben, Eduard ; Ganian, Robert ; Kanj, Iyad ; Ordyniak, Sebastian ; Szeider, Stefan | On the parameterized complexity of clustering problems for incomplete data | Article Artikel | Jun-2023 |
