Minimum k-path vertex cover B Brešar, F Kardoš, J Katrenič, G Semanišin Discrete Applied Mathematics 159 (12), 1189-1195, 2011 | 190 | 2011 |

On computing the minimum 3-path vertex cover and dissociation number of graphs F Kardoš, J Katrenič, I Schiermeyer Theoretical Computer Science 412 (50), 7009-7017, 2011 | 96 | 2011 |

On the vertex k-path cover B Brešar, M Jakovac, J Katrenič, G Semanišin, A Taranenko Discrete Applied Mathematics 161 (13-14), 1943-1949, 2013 | 70 | 2013 |

A faster FPT algorithm for 3-path vertex cover J Katrenič Information Processing Letters 116 (4), 273-278, 2016 | 47 | 2016 |

On computing an optimal semi-matching F Galčík, J Katrenič, G Semanišin International Workshop on Graph-Theoretic Concepts in Computer Science, 250-261, 2011 | 17* | 2011 |

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs) J Katrenic, G Semanisin arXiv preprint arXiv:1103.1091, 2011 | 14 | 2011 |

A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs J Katrenic, G Semanisin arXiv preprint arXiv:1103.1091, 2011 | 13 | 2011 |

Improved approximation bounds for the minimum rainbow subgraph problem J Katrenič, I Schiermeyer Information processing letters 111 (3), 110-114, 2011 | 13 | 2011 |

Finding monotone paths in edge-ordered graphs J Katrenič, G Semanišin Discrete applied mathematics 158 (15), 1624-1632, 2010 | 10 | 2010 |

A note on approximating the b-chromatic number F Galčík, J Katrenič Discrete Applied Mathematics 161 (7-8), 1137-1140, 2013 | 5 | 2013 |

Complexity of ascent finding problem. J Katrenic, G Semanisin SOFSEM (2), 70-77, 2008 | 2 | 2008 |