Ján Katrenič

Minimum <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si1.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path vertex cover

Boštjan Brešar, František Kardoš, Ján Katrenič et al. · Discrete Applied Mathematics · 2011 · 162 citations · Full text

Math Xmlns, Geometric Graph Theory, Geometric Algorithm +5

On computing the minimum 3-path vertex cover and dissociation number of graphs

František Kardoš, Ján Katrenič, Ingo Schiermeyer · Theoretical Computer Science · 2011 · 87 citations

Geometric Graph Theory, Engineering, Graph Theory +11

On the vertex <mml:math xmlns:mml="http://www.w3.org/1998/Math/MathML" altimg="si7.gif" display="inline" overflow="scroll"><mml:mi>k</mml:mi></mml:math>-path cover

Boštjan Brešar, Marko Jakovac, Ján Katrenič et al. · Discrete Applied Mathematics · 2013 · 61 citations

Math Xmlns, Geometric Graph Theory, Graph Theory +8

A faster FPT algorithm for 3-path vertex cover

Ján Katrenič · Information Processing Letters · 2015 · 50 citations

Geometric Modeling, Computational Science, Engineering +10

Maximum semi-matching problem in bipartite graphs

Ján Katrenič, Gabriel Semanišin · Discussiones Mathematicae Graph Theory · 2013 · 12 citations · Full text