Jozef Jirásek

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

Ondrej Bílka, Jozef Jirásek, Pavel Klavík, Martin Tancer, Jan Volec: On the Complexity of Planar Covering of Small Graphs. CoRR abs/1108.0064 (2011)

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

Peter Gurský, Tomás Horváth, Peter Vojtás, Jozef Jirásek, Stanislav Krajci, Robert Novotny, Jana Pribolová, Veronika Vaneková: User Preference Web Search -- Experiments with a System Connecting Web and User. Computing and Informatics 28(4): 515-553 (2009)

Jozef Jirásek, Galina Jirásková, Alexander Szabari: Deterministic blow-UPS of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Int. J. Found. Comput. Sci. 19(3): 617-631 (2008)

Peter Gurský, Tomás Horváth, Jozef Jirásek, Robert Novotny, Jana Pribolová, Veronika Vaneková, Peter Vojtás: Knowledge Processing for Web Search - An Integrated Model and Experiments. Scalable Computing: Practice and Experience 9(1) (2008)

Jozef Jirásek, Galina Jirásková, Alexander Szabari: Deterministic Blow-Ups of Minimal Nondeterministic Finite Automata over a Fixed Alphabet. Developments in Language Theory 2007: 254-265

Peter Gurský, Tomás Horváth, Jozef Jirásek, Stanislav Krajci, Robert Novotny, Veronika Vaneková, Peter Vojtás: Knowledge Processing for Web Search - An Integrated Model. IDC 2007: 96-104

Jozef Jirásek, Galina Jirásková, Alexander Szabari: State complexity of concatenation and complementation. Int. J. Found. Comput. Sci. 16(3): 511-529 (2005)

Jozef Jirásek: Arc reversal in nonhamiltonian circulant oriented graphs. Journal of Graph Theory 49(1): 59-68 (2005)

Jozef Jirásek, Galina Jirásková, Alexander Szabari: State Complexity of Concatenation and Complementation of Regular Languages. CIAA 2004: 178-189

Jozef Jirásek: Some remarks on Ádám's conjecture for simple directed graphs. Discrete Mathematics 108(1-3): 327-332 (1992)