| 2025 | SOFSEM | On Pumping Problems for Unary Regular Languages. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2024 | DLT | The Pumping Lemma for Context-Free Languages is Undecidable. | Hermann Gruber, Markus Holzer, Christian Rauch |
| 2021 | FCT | On Minimizing Regular Expressions Without Kleene Star. | Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2021 | MFCS | Optimal Regular Expressions for Palindromes of Given Length. | Hermann Gruber, Markus Holzer |
| 2018 | DLT | On Minimal Grammar Problems for Finite Languages. | Hermann Gruber, Markus Holzer, Simon Wolfsteiner |
| 2010 | LATA | Simplifying Regular Expressions. | Hermann Gruber, Stefan Gulan |
| 2009 | DLT | Tight Bounds on the Descriptional Complexity of Regular Expressions. | Hermann Gruber, Markus Holzer |
| 2008 | DLT | Provably Shorter Regular Expressions from Deterministic Finite Automata. | Hermann Gruber, Markus Holzer |
| 2008 | FOSSACS | Optimal Lower Bounds on Regular Expression Size Using Communication Complexity. | Hermann Gruber, Jan Johannsen |
| 2008 | ICALP | Finite Automata, Digraph Connectivity, and Regular Expression Size. | Hermann Gruber, Markus Holzer |
| 2007 | DLT | Inapproximability of Nondeterministic State and Transition Complexity Assuming P=!NP. | Hermann Gruber, Markus Holzer |
| 2007 | FUN | Sorting the Slow Way: An Analysis of Perversely Awful Randomized Sorting Algorithms. | Hermann Gruber, Markus Holzer, Oliver Ruepp |
| 2007 | LATA | Computational Complexity of NFA Minimization for Finite and Unary Languages. | Hermann Gruber, Markus Holzer |
| 2007 | MCU | More on the Size of Higman-Haines Sets: Effective Constructions. | Hermann Gruber, Markus Holzer, Martin Kutrib |
| 2006 | DLT | Finding Lower Bounds for Nondeterministic State Complexity Is Hard. | Hermann Gruber, Markus Holzer |
| 2005 | DLT | On Timed Automata with Discrete Time - Structural and Language Theoretical Characterization. | Hermann Gruber, Markus Holzer, Astrid Kiehn, Barbara Knig |