| 2026 | ICALP | Infinite-State Games with Energy Objectives Beyond Counters. | Irmak Saglam, Georg Zetzsche |
| 2026 | ICALP | Decidability and Complexity Borders of Reachability Problems (Invited Talk). | Georg Zetzsche |
| 2026 | LICS | The Complexity of Downward Closures of Indexed Languages. | Richard Mandel, Corto Mascle, Georg Zetzsche |
| 2026 | TACAS | Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking). | Kilian Lichtner, Pascal Bergstrer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche |
| 2025 | KR | Presburger Functional Synthesis: Complexity and Tractable Normal Forms. | S. Akshay, A. R. Balasubramanian, Supratik Chakraborty, Georg Zetzsche |
| 2025 | LICS | A Complexity Dichotomy for Semilinear Target Sets in Automata with One Counter. | Yousef Shakiba, Henry Sinclair-Banks, Georg Zetzsche |
| 2025 | MFCS | The Complexity of Separability for Semilinear Sets and Parikh Automata. | Elias Rojas Collins, Chris Kcher, Georg Zetzsche |
| 2024 | ICALP | Separability in Bchi VASS and Singly Non-Linear Systems of Inequalities. | Pascal Baumann, Eren Keskin, Roland Meyer, Georg Zetzsche |
| 2024 | ICALP | An Efficient Quantifier Elimination Procedure for Presburger Arithmetic. | Christoph Haase, Shankara Narayanan Krishna, Khushraj Madnani, Om Swostik Mishra, Georg Zetzsche |
| 2024 | LICS | Verifying Unboundedness via Amalgamation. | Ashwani Anand, Sylvain Schmitz, Lia Schtze, Georg Zetzsche |
| 2024 | LICS | Slice closures of indexed languages and word equations with counting constraints. | Laura Ciobanu, Georg Zetzsche |
| 2024 | STACS | Directed Regular and Context-Free Languages. | Moses Ganardi, Irmak Saglam, Georg Zetzsche |
| 2023 | CONCUR | Monus Semantics in Vector Addition Systems with States. | Pascal Baumann, Khushraj Madnani, Filip Mazowiecki, Georg Zetzsche |
| 2023 | CONCUR | Priority Downward Closures. | Ashwani Anand, Georg Zetzsche |
| 2023 | FOSSACS | Unboundedness Problems for Machines with Reversal-Bounded Counters. | Pascal Baumann, Flavio D'Alessandro, Moses Ganardi, Oscar H. Ibarra, Ian McQuillan, Lia Schtze, Georg Zetzsche |
| 2023 | ICALP | Context-Bounded Analysis of Concurrent Programs (Invited Talk). | Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2023 | ICALP | Checking Refinement of Asynchronous Programs Against Context-Free Specifications. | Pascal Baumann, Moses Ganardi, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2023 | STACS | Regular Separability in Bchi VASS. | Pascal Baumann, Roland Meyer, Georg Zetzsche |
| 2022 | ICALP | Reachability in Bidirected Pushdown VASS. | Moses Ganardi, Rupak Majumdar, Andreas Pavlogiannis, Lia Schtze, Georg Zetzsche |
| 2022 | LICS | Ramsey Quantifiers over Automatic Structures: Complexity and Applications to Verification. | Pascal Bergstrer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche |
| 2022 | LICS | The Complexity of Bidirected Reachability in Valence Systems. | Moses Ganardi, Rupak Majumdar, Georg Zetzsche |
| 2022 | MFCS | Membership Problems in Finite Groups. | Markus Lohrey, Andreas Rosowski, Georg Zetzsche |
| 2022 | STACS | Existential Definability over the Subword Ordering. | Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2021 | CONCUR | Scope-Bounded Reachability in Valence Systems. | Aneesh K. Shetty, S. Krishna, Georg Zetzsche |
| 2021 | STACS | A Characterization of Wreath Products Where Knapsack Is Decidable. | Pascal Bergstrer, Moses Ganardi, Georg Zetzsche |
| 2021 | TACAS | General Decidability Results for Asynchronous Shared-Memory Programs: Higher-Order and Beyond. | Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2020 | ICALP | The Complexity of Bounded Context Switching with Dynamic Thread Creation. | Pascal Baumann, Rupak Majumdar, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2020 | ICALP | Rational Subsets of Baumslag-Solitar Groups. | Michal Cadilhac, Dmitry Chistikov, Georg Zetzsche |
| 2020 | ICALP | The Complexity of Knapsack Problems in Wreath Products. | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
| 2020 | LICS | Extensions of ω-Regular Languages. | Mikolaj Bojanczyk, Edon Kelmendi, Rafal Stefanski, Georg Zetzsche |
| 2020 | LICS | An Approach to Regular Separability in Vector Addition Systems. | Wojciech Czerwinski, Georg Zetzsche |
| 2020 | MFCS | Knapsack and the Power Word Problem in Solvable Baumslag-Solitar Groups. | Markus Lohrey, Georg Zetzsche |
| 2019 | FOSSACS | Languages Ordered by the Subword Order. | Dietrich Kuske, Georg Zetzsche |
| 2019 | LICS | Presburger arithmetic with stars, rational subsets of graph groups, and nested zero tests. | Christoph Haase, Georg Zetzsche |
| 2018 | CONCUR | Bounded Context Switching for Valence Systems. | Roland Meyer, Sebastian Muskalla, Georg Zetzsche |
| 2018 | ICALP | Unboundedness Problems for Languages of Vector Addition Systems. | Wojciech Czerwinski, Piotr Hofman, Georg Zetzsche |
| 2018 | LICS | Separability by piecewise testable languages and downward closures beyond subwords. | Georg Zetzsche |
| 2018 | STACS | Knapsack Problems for Wreath Products. | Moses Ganardi, Daniel Knig, Markus Lohrey, Georg Zetzsche |
| 2017 | LICS | Decidability, complexity, and expressiveness of first-order logic over the subword ordering. | Simon Halfon, Philippe Schnoebelen, Georg Zetzsche |
| 2017 | STACS | The Complexity of Knapsack in Graph Groups. | Markus Lohrey, Georg Zetzsche |
| 2016 | ICALP | The Complexity of Downward Closure Comparisons. | Georg Zetzsche |
| 2016 | LICS | The complexity of regular abstractions of one-counter languages. | Mohamed Faouzi Atig, Dmitry Chistikov, Piotr Hofman, K. Narayan Kumar, Prakash Saivasan, Georg Zetzsche |
| 2016 | LICS | First-order logic with reachability for infinite-state systems. | Emanuele D'Osualdo, Roland Meyer, Georg Zetzsche |
| 2016 | STACS | Knapsack in Graph Groups, HNN-Extensions and Amalgamated Products. | Markus Lohrey, Georg Zetzsche |
| 2015 | ICALP | An Approach to Computing Downward Closures. | Georg Zetzsche |
| 2015 | STACS | Computing Downward Closures for Stacked Counter Automata. | Georg Zetzsche |
| 2014 | MFCS | The Monoid of Queue Actions. | Martin Huschenbett, Dietrich Kuske, Georg Zetzsche |
| 2014 | STACS | On Boolean closed full trios and rational Kripke frames. | Markus Lohrey, Georg Zetzsche |
| 2013 | ICALP | Rational Subsets and Submonoids of Wreath Products. | Markus Lohrey, Benjamin Steinberg, Georg Zetzsche |
| 2013 | ICALP | Silent Transitions in Automata with Storage. | Georg Zetzsche |
| 2013 | MFCS | Semilinearity and Context-Freeness of Languages Accepted by Valence Automata. | P. Buckheister, Georg Zetzsche |
| 2011 | DLT | A Sufficient Condition for Erasing Productions to Be Avoidable. | Georg Zetzsche |
| 2011 | ICALP | On the Capabilities of Grammars, Automata, and Transducers Controlled by Monoids. | Georg Zetzsche |
| 2010 | ICALP | On Erasing Productions in Random Context Grammars. | Georg Zetzsche |
| 2009 | DLT | Erasing in Petri Net Languages and Matrix Grammars. | Georg Zetzsche |