| 2026 | LICS | Constructing Small Monadic Decompositions in Presburger Arithmetic. | Moses Ganardi, Marin Ricros |
| 2026 | STACS | On the Complexity of Computing Strahler Numbers. | Moses Ganardi, Markus Lohrey |
| 2026 | TACAS | Fast Ramsey Quantifier Elimination in LIRA (with applications to liveness checking). | Kilian Lichtner, Pascal Bergstrer, Moses Ganardi, Anthony W. Lin, Georg Zetzsche |
| 2024 | STACS | Directed Regular and Context-Free Languages. | Moses Ganardi, Irmak Saglam, 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 | LICS | Revisiting Membership Problems in Subclasses of Rational Relations. | Pascal Bergstrer, Moses Ganardi |
| 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 | SODA | Pattern Matching on Grammar-Compressed Strings in Linear Time. | Moses Ganardi, Pawel Gawrychowski |
| 2022 | STACS | Existential Definability over the Subword Ordering. | Pascal Baumann, Moses Ganardi, Ramanathan S. Thinniyam, Georg Zetzsche |
| 2021 | ESA | Compression by Contracting Straight-Line Programs. | Moses Ganardi |
| 2021 | STACS | A Characterization of Wreath Products Where Knapsack Is Decidable. | Pascal Bergstrer, Moses Ganardi, Georg Zetzsche |
| 2020 | CSL | Automatic Equivalence Structures of Polynomial Growth. | Moses Ganardi, Bakhadyr Khoussainov |
| 2020 | ICALP | The Complexity of Knapsack Problems in Wreath Products. | Michael Figelius, Moses Ganardi, Markus Lohrey, Georg Zetzsche |
| 2019 | CSR | Derandomization for Sliding Window Algorithms with Strict Correctness. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2019 | FOCS | Balancing Straight-Line Programs. | Moses Ganardi, Artur Jez, Markus Lohrey |
| 2019 | ISAAC | Sliding Window Property Testing for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey, Tatiana Starikovskaya |
| 2019 | STACS | Visibly Pushdown Languages over Sliding Windows. | Moses Ganardi |
| 2018 | ICALP | Randomized Sliding Window Algorithms for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | LATA | Sliding Window Algorithms for Regular Languages. | Moses Ganardi, Danny Hucke, Markus Lohrey |
| 2018 | MFCS | Sliding Windows over Context-Free Languages. | Moses Ganardi, Artur Jez, Markus Lohrey |
| 2018 | STACS | Automata Theory on Sliding Windows. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey, Konstantinos Mamouras |
| 2018 | STACS | Knapsack Problems for Wreath Products. | Moses Ganardi, Daniel Knig, Markus Lohrey, Georg Zetzsche |
| 2017 | STACS | Circuit Evaluation for Finite Semirings. | Moses Ganardi, Danny Hucke, Daniel Knig, Markus Lohrey |
| 2016 | CSL | On the Parallel Complexity of Bisimulation on Finite Systems. | Moses Ganardi, Stefan Gller, Markus Lohrey |
| 2016 | LATIN | Tree Compression Using String Grammars. | Moses Ganardi, Danny Hucke, Markus Lohrey, Eric Noeth |
| 2015 | FOSSACS | Parity Games of Bounded Tree- and Clique-Width. | Moses Ganardi |