| No. |
Title |
Author |
Year |
| 1 |
Existential Definability over the Subword Ordering |
Baumann, Pascal et al. |
2022 |
| 2 |
Membership Problems in Finite Groups |
Lohrey, Markus et al. |
2022 |
| 3 |
Reachability in Bidirected Pushdown VASS |
Ganardi, Moses et al. |
2022 |
| 4 |
A Characterization of Wreath Products Where Knapsack Is Decidable |
Bergsträßer, Pascal et al. |
2021 |
| 5 |
Scope-Bounded Reachability in Valence Systems |
Shetty, Aneesh K. et al. |
2021 |
| 6 |
Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups |
Lohrey, Markus et al. |
2020 |
| 7 |
Rational Subsets of Baumslag-Solitar Groups |
Cadilhac, Michaël et al. |
2020 |
| 8 |
The Complexity of Bounded Context Switching with Dynamic Thread Creation |
Baumann, Pascal et al. |
2020 |
| 9 |
The Complexity of Knapsack Problems in Wreath Products |
Figelius, Michael et al. |
2020 |
| 10 |
Regular Separability and Intersection Emptiness Are Independent Problems |
Thinniyam, Ramanathan S. et al. |
2019 |
| 11 |
Bounded Context Switching for Valence Systems |
Meyer, Roland et al. |
2018 |
| 12 |
Knapsack Problems for Wreath Products |
Ganardi, Moses et al. |
2018 |
| 13 |
Unboundedness Problems for Languages of Vector Addition Systems |
Czerwinski, Wojciech et al. |
2018 |
| 14 |
The Complexity of Knapsack in Graph Groups |
Lohrey, Markus et al. |
2017 |
| 15 |
Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products |
Lohrey, Markus et al. |
2016 |
| 16 |
The Complexity of Downward Closure Comparisons |
Zetzsche, Georg |
2016 |
| 17 |
Computing Downward Closures for Stacked Counter Automata |
Zetzsche, Georg |
2015 |
| 18 |
On Boolean closed full trios and rational Kripke frames |
Lohrey, Markus et al. |
2014 |
