Complexity of ascent finding problem. - Ján Katrenic; Gabriel Semanisin (SOFSEM (2), 2008)

Finding monotone paths in edge-ordered graphs. - Ján Katrenic; Gabriel Semanisin (Discret. Appl. Math., 2010)

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs - Ján Katrenic; Gabriel Semanisin (CoRR, 2011)

Minimum k-path vertex cover. - Bostjan Bresar; Frantisek Kardos; Ján Katrenic; Gabriel Semanisin (Discret. Appl. Math., 2011)

Improved approximation bounds for the minimum rainbow subgraph problem. - Ján Katrenic; Ingo Schiermeyer (Inf. Process. Lett., 2011)

On computing the minimum 3-path vertex cover and dissociation number of graphs. - Frantisek Kardos; Ján Katrenic; Ingo Schiermeyer (Theor. Comput. Sci., 2011)

On the vertex kk-path cover. - Bostjan Bresar; Marko Jakovac; Ján Katrenic; Gabriel Semanisin; Andrej Taranenko (Discret. Appl. Math., 2013)

A note on approximating the b-chromatic number. - Frantisek Galcík; Ján Katrenic (Discret. Appl. Math., 2013)

Maximum semi-matching problem in bipartite graphs. - Ján Katrenic; Gabriel Semanisin (Discuss. Math. Graph Theory, 2013)

A faster FPT algorithm for 3-path vertex cover. - Ján Katrenic (Inf. Process. Lett., 2016)

On Computing an Optimal Semi-matching. - Frantisek Galcík; Ján Katrenic; Gabriel Semanisin (Algorithmica, 2017)