Structural and Complexity Aspects of Line Systems of Graphs. - Jozef Jirásek 002; Pavel Klavík (ISAAC (1), 2010)

On the Complexity of Planar Covering of Small Graphs. - Ondrej Bílka; Jozef Jirásek 002; Pavel Klavík; Martin Tancer; Jan Volec (WG, 2011)

Operations on Self-Verifying Finite Automata. - Jozef Stefan Jirásek; Galina Jirásková; Alexander Szabari (CSR, 2015)

Prefix-Free Subsets of Regular Languages and Descriptional Complexity. - Jozef Stefan Jirásek; Juraj Sebej (DCFS, 2015)

Non-regular Maximal Prefix-Free Subsets of Regular Languages. - Jozef Jirásek Jr. (DLT, 2016)

Kuratowski Algebras Generated by Prefix-Free Languages. - Jozef Jirásek Jr.; Juraj Sebej (CIAA, 2016)

Kuratowski Algebras Generated by Factor-, Subword-, and Suffix-Free Languages. - Jozef Jirásek Jr.; Matús Palmovský; Juraj Sebej (DCFS, 2017)

Computational Complexity of Decision Problems on Self-verifying Finite Automata. - Markus Holzer 001; Sebastian Jakobi; Jozef Jirásek Jr. (DLT, 2018)

Operations on Unambiguous Finite Automata. - Jozef Jirásek Jr.; Galina Jirásková; Juraj Sebej (Int. J. Found. Comput. Sci., 2018)

Kuratowski Algebras Generated by Prefix-, Suffix-, Factor-, and Subword-Free Languages Under Star and Complementation. - Jozef Jirásek Jr.; Matús Palmovský; Juraj Sebej (Int. J. Found. Comput. Sci., 2019)

Space Complexity of Stack Automata Models. - Oscar H. Ibarra; Jozef Jirásek 002; Ian McQuillan; Luca Prigioniero (Int. J. Found. Comput. Sci., 2021)

Visit-Bounded Stack Automata. - Jozef Jirásek 002; Ian McQuillan (Theory Comput. Syst., 2023)