Main areas:
- CNF encodings of CSP constraints
- Pattern matching in graphs
- Complexity of synchronization (i.e., reset words) and the Černý conjecture
- Simple machines with discontinuous input processing

Other interests:
- NP-completeness, parameterized complexity
- Undecidable problems
- Mathematical logic

Journal papers:

H. Fernau, M. Schmid, M. Pa­ra­ma­si­van, V. Vorel	Characterization and Complexity Results on Jumping Finite Automata	2017	Theoretical Computer Science, 679:31-52, 2017	ArXiv
V. Vorel	Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (Based on LATA 2014)	2017	Information and Computation, 253(3): 497-509, 2017	PDF
V. Vorel	Subset Synchronization and Careful Synchronization of Binary Finite Automata (Based on AFL 2014)	2016	International Journal of Foundations of Computer Science, 27(5):557-577, 2016	BibTeX dmtcs.org PDF
V. Vorel, A. Roman	Parameterized complexity of synchronization and road coloring	2015	Discrete Mathematics and Theoretical Computer Science, 17(1):307-330, 2015	BibTeX dmtcs.org PDF
V. Vorel	On Basic Properties of Jumping Finite Automata	2018	International Journal of Foundations of Computer Science, 29(1):1-15, 2018	BibTeX ArXiv
V. Vorel, A. Roman	Complexity of Road Coloring with Prescribed Reset Words (Based on LATA 2015)	2019	Journal of Computer and System Sciences, 104:342-358, 2019	PDF

Conferences:

M. Szykuła, V. Vorel	An Extremal Series of Eulerian Synchronizing Automata	DLT 2016	In: Developments in Language Theory, LNCS, volume 9840, pages 380-392. Springer	PDF
V. Vorel	Two Results on Discontinuous Input Processing	DCFS 2016	In: Descriptional Complexity of Formal Systems, LNCS, volume 9777, pages 205–216. Springer	PDF BibTeX ArXiv
V. Vorel	Uncertainty and Synchronization	CSA 2016	short talk	PDF (abstract) slides (PDF)
V. Vorel, A. Roman	Complexity of Road Coloring with Prescribed Reset Words (Please, use the journal version!)	LATA 2015	In: Language and Automata Theory and Applications, LNCS, volume 8977, pages 161-172. Springer	BibTeX DOI PDF (published) PDF (extended) slides (PDF)
V. Vorel	Complexity of a Problem Concerning Reset Words for Eulerian Binary Automata (Please, use the journal version!)	LATA 2014	In: Language and Automata Theory and Applications, LNCS, volume 8370, pages 576-587. Springer	BibTeX DOI PDF slides (PDF)
V. Vorel	Subset Synchronization of Transitive Automata (Please, use the journal version!)	AFL 2014	In: Proceedings 14th International Conference on Automata and Formal Languages, AFL 2014, pages 370-381	BibTeX DOI PDF  slides (PDF)