Ján Katrenic

13 papers B 1Journal 11Unranked 1
YearRankTypeTitle / Venue / Authors
2017 J jnl
On Computing an Optimal Semi-matching.
Algorithmica
Frantisek Galcík, Ján Katrenic, Gabriel Semanisin
2016 J jnl
A faster FPT algorithm for 3-path vertex cover.
Inf. Process. Lett.
Ján Katrenic
2013 J jnl
A note on approximating the
Discret. Appl. Math.
Frantisek Galcík, Ján Katrenic
2013 J jnl
Maximum semi-matching problem in bipartite graphs.
Discuss. Math. Graph Theory
Ján Katrenic, Gabriel Semanisin
2013 J jnl
On the vertex
Discret. Appl. Math.
Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko
2011 J jnl
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs
CoRR
Ján Katrenic, Gabriel Semanisin
2011 J jnl
Improved approximation bounds for the minimum rainbow subgraph problem.
Inf. Process. Lett.
Ján Katrenic, Ingo Schiermeyer
2011 J jnl
Minimum k-path vertex cover.
Discret. Appl. Math.
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
2011 B conf
On Computing an Optimal Semi-matching.
WG
Frantisek Galcík, Ján Katrenic, Gabriel Semanisin
2011 J jnl
On computing the minimum 3-path vertex cover and dissociation number of graphs.
Theor. Comput. Sci.
Frantisek Kardos, Ján Katrenic, Ingo Schiermeyer
2010 J jnl
Finding monotone paths in edge-ordered graphs.
Discret. Appl. Math.
Ján Katrenic, Gabriel Semanisin
2010 J jnl
Minimum k-path vertex cover
CoRR
Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin
2008 — conf
Complexity of ascent finding problem.
SOFSEM (2)
Ján Katrenic, Gabriel Semanisin