( en | de | ru )

 

Disambiguation of "Katrenic, Ján"

Author of the publication

copydeleteadd this publication to your clipboard
Complexity of ascent finding problem.

, and . SOFSEM (2), page 70-77. Safarik University, Kosice, Slovakia, (2008)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

Ján Poliak

Validierung von satellitenbasierten Eisenbahnortungssystemen. TU Braunschweig, (2009)

Rolf Alexander Jánosi

Ildikó Marianne Jánossy

Géza János

András Jánossy

 

Other publications of authors with the same name

A faster FPT algorithm for 3-path vertex cover.. Inf. Process. Lett., 116 (4): 273-278 (2016)Improved approximation bounds for the minimum rainbow subgraph problem., and . Inf. Process. Lett., 111 (3): 110-114 (2011)Maximum semi-matching problem in bipartite graphs., and . Discussiones Mathematicae Graph Theory, 33 (3): 559-569 (2013)On the vertex kk-path cover., , , , and . Discret. Appl. Math., 161 (13-14): 1943-1949 (2013)Minimum k-path vertex cover, , , and . CoRR, (2010)On Computing an Optimal Semi-matching., , and . WG, volume 6986 of Lecture Notes in Computer Science, page 250-261. Springer, (2011)On computing the minimum 3-path vertex cover and dissociation number of graphs., , and . Theor. Comput. Sci., 412 (50): 7009-7017 (2011)Minimum k-path vertex cover., , , and . Discret. Appl. Math., 159 (12): 1189-1195 (2011)On Computing an Optimal Semi-matching., , and . Algorithmica, 78 (3): 896-913 (2017)A note on approximating the b-chromatic number., and . Discret. Appl. Math., 161 (7-8): 1137-1140 (2013)