Subset Synchronization of Transitive Automata. - Vojtech Vorel (AFL, 2014)

Detecting Short Reset Words Parameterized by Number of States. - Vojtech Vorel (CoRR, 2014)

Parameterized Complexity of Synchronization and Road Coloring. - Vojtech Vorel; Adam Roman (Discret. Math. Theor. Comput. Sci., 2015)

An Extremal Series of Eulerian Synchronizing Automata. - Marek Szykula; Vojtech Vorel (DLT, 2016)

Subset Synchronization and Careful Synchronization of Binary Finite Automata. - Vojtech Vorel (Int. J. Found. Comput. Sci., 2016)

Complexity of a problem concerning reset words for Eulerian binary automata. - Vojtech Vorel (Inf. Comput., 2017)

Two Results on Discontinuous Input Processing. - Vojtech Vorel (J. Autom. Lang. Comb., 2017)

Characterization and complexity results on jumping finite automata. - Henning Fernau; Meenakshi Paramasivan; Markus L. Schmid; Vojtech Vorel (Theor. Comput. Sci., 2017)

On Basic Properties of Jumping Finite Automata. - Vojtech Vorel (Int. J. Found. Comput. Sci., 2018)

A new Lower Bound for Reset Threshold of Binary Synchronizing Automata with Sink. - Dmitry S. Ananichev; Vojtech Vorel (J. Autom. Lang. Comb., 2019)

Complexity of road coloring with prescribed reset words. - Vojtech Vorel; Adam Roman (J. Comput. Syst. Sci., 2019)

A lower bound on CNF encodings of the at-most-one constraint. - Petr Kucera; Petr Savický; Vojtech Vorel (Theor. Comput. Sci., 2019)

Lower Bounds on Avoiding Thresholds. - Robert Ferens; Marek Szykula; Vojtech Vorel (MFCS, 2021)