Searching all approximate covers and their distance using finite automata. - Ondrej Guth; Borivoj Melichar; Miroslav Balík (ITAT, 2008)

On the Right-Seed Array of a String. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (COCOON, 2011)

On left and right seeds of a string. - Michalis Christou; Maxime Crochemore; Ondrej Guth; Costas S. Iliopoulos; Solon P. Pissis (J. Discrete Algorithms, 2012)

Computing All Approximate Enhanced Covers with the Hamming Distance. - Ondrej Guth (Stringology, 2016)

Co-Teaching Computer Science Across Borders: Human-Centric Learning at Scale. - Chris Piech; Lisa Yan; Lisa Einstein; Ana Saavedra; Baris Bozkurt; Eliska Sestáková; Ondrej Guth; Nick McKeown (L@S, 2020)

On approximate enhanced covers under Hamming distance. - Ondrej Guth (Discret. Appl. Math., 2020)

Automata Approach to Inexact Tree Pattern Matching Using 1-degree Edit Distance. - Eliska Sestáková; Ondrej Guth; Jan Janousek (Stringology, 2021)

On Expressive Power of Regular Expressions with Subroutine Calls and Lookaround Assertions. - Ondrej Guth (PSC, 2023)

Inexact tree pattern matching with 1-degree edit distance using finite automata. - Eliska Sestáková; Ondrej Guth; Jan Janousek (Discret. Appl. Math., 2023)