Ján Katrenic

Publication Activity (10 Years)

Years Active: 2008-2017
Publications (10 Years): 2

Top Topics

Optimal Assignment

Bipartite Graph

Top Venues

Discret. Appl. Math.

Inf. Process. Lett.

Discuss. Math. Graph Theory

Publications

Frantisek Galcík, Ján Katrenic, Gabriel Semanisin
On Computing an Optimal Semi-matching. Algorithmica 78 (3) (2017)
Ján Katrenic
A faster FPT algorithm for 3-path vertex cover. Inf. Process. Lett. 116 (4) (2016)
Frantisek Galcík, Ján Katrenic
-chromatic number. Discret. Appl. Math. 161 (7-8) (2013)
Ján Katrenic, Gabriel Semanisin
Maximum semi-matching problem in bipartite graphs. Discuss. Math. Graph Theory 33 (3) (2013)
Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko
k-path cover. Discret. Appl. Math. 161 (13-14) (2013)
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
Minimum k-path vertex cover. Discret. Appl. Math. 159 (12) (2011)
Frantisek Galcík, Ján Katrenic, Gabriel Semanisin
On Computing an Optimal Semi-matching. WG (2011)
Ján Katrenic, Gabriel Semanisin
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs CoRR (2011)
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer
On computing the minimum 3-path vertex cover and dissociation number of graphs. Theor. Comput. Sci. 412 (50) (2011)
Ján Katrenic, Ingo Schiermeyer
Improved approximation bounds for the minimum rainbow subgraph problem. Inf. Process. Lett. 111 (3) (2011)
Ján Katrenic, Gabriel Semanisin
Finding monotone paths in edge-ordered graphs. Discret. Appl. Math. 158 (15) (2010)
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
Minimum k-path vertex cover CoRR (2010)
Ján Katrenic, Gabriel Semanisin
Complexity of ascent finding problem. SOFSEM (2) (2008)