| 2026 | STACS | The Asymptotic Size of Finite Irreducible Semigroups of Rational Matrices. | Stefan Kiefer, Andrew Ryzhikov |
| 2025 | CSL | Boundedness of Cost Register Automata over the Integer Min-Plus Semiring. | Andrei Draghici, Radoslaw Pirkowski, Andrew Ryzhikov |
| 2025 | MFCS | The Complexity of Reachability Problems in Strongly Connected Finite Automata. | Stefan Kiefer, Andrew Ryzhikov |
| 2025 | STACS | Efficiently Computing the Minimum Rank of a Matrix in a Monoid of Zero-One Matrices. | Stefan Kiefer, Andrew Ryzhikov |
| 2024 | FOSSACS | Reachability in Fixed VASS: Expressiveness and Lower Bounds. | Andrei Draghici, Christoph Haase, Andrew Ryzhikov |
| 2024 | MFCS | Monoids of Upper Triangular Matrices over the Boolean Semiring. | Andrew Ryzhikov, Petra Wolf |
| 2023 | MFCS | Universality and Forall-Exactness of Cost Register Automata with Few Registers. | Laure Daviaud, Andrew Ryzhikov |
| 2021 | STACS | Synchronizing Strongly Connected Partial DFAs. | Mikhail V. Berlinkov, Robert Ferens, Andrew Ryzhikov, Marek Szykula |
| 2019 | DLT | Words of Minimum Rank in Deterministic Finite Automata. | Jarkko Kari, Andrew Ryzhikov, Anton Varonka |
| 2019 | LATA | Palindromic Subsequences in Finite Words. | Clemens Mllner, Andrew Ryzhikov |
| 2018 | MFCS | Finding Short Synchronizing Words for Prefix Codes. | Andrew Ryzhikov, Marek Szykula |