Ján Katrenic

According to our database, Ján Katrenic authored at least 11 papers between 2008 and 2017.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of three.

2017

On Computing an Optimal Semi-matching.

Frantisek Galcík, Ján Katrenic, Gabriel Semanisin

Algorithmica, 2017

2016

A faster FPT algorithm for 3-path vertex cover.

Ján Katrenic

Inf. Process. Lett., 2016

2013

Maximum semi-matching problem in bipartite graphs.

Ján Katrenic, Gabriel Semanisin

Discuss. Math. Graph Theory, 2013

A note on approximating the <i>b</i>-chromatic number.

Frantisek Galcík, Ján Katrenic

Discret. Appl. Math., 2013

On the vertex <i>k</i>k-path cover.

Bostjan Bresar, Marko Jakovac, Ján Katrenic, Gabriel Semanisin, Andrej Taranenko

Discret. Appl. Math., 2013

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

Improved approximation bounds for the minimum rainbow subgraph problem.

Ján Katrenic, Ingo Schiermeyer

Inf. Process. Lett., 2011

Minimum k-path vertex cover.

Bostjan Bresar, Frantisek Kardos, Ján Katrenic, Gabriel Semanisin

Discret. Appl. Math., 2011

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs

Ján Katrenic, Gabriel Semanisin

CoRR, 2011

2010

Finding monotone paths in edge-ordered graphs.

Ján Katrenic, Gabriel Semanisin

Discret. Appl. Math., 2010

2008

Complexity of ascent finding problem.

Ján Katrenic, Gabriel Semanisin

Proceedings of the SOFSEM 2008: Theory and Practice of Computer Science, 34th Conference on Current Trends in Theory and Practice of Computer Science, Nový Smokovec, Slovakia, January 19-25, 2008, Volume II, 2008