Ján Katrenič

List of research outcomes

This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!

Publication	Date of Publication	Type
On computing an optimal semi-matching Algorithmica	2017-10-09	Paper
A faster FPT algorithm for 3-path vertex cover Information Processing Letters	2016-01-05	Paper
On the vertex \(k\)-path cover Discrete Applied Mathematics	2014-04-22	Paper
Maximum semi-matching problem in bipartite graphs Discussiones Mathematicae. Graph Theory	2013-10-31	Paper
A note on approximating the \(b\)-chromatic number Discrete Applied Mathematics	2013-04-25	Paper
Improved approximation bounds for the minimum rainbow subgraph problem Information Processing Letters	2013-04-04	Paper
On computing an optimal semi-matching Graph-Theoretic Concepts in Computer Science	2011-12-16	Paper
On computing the minimum 3-path vertex cover and dissociation number of graphs Theoretical Computer Science	2011-12-07	Paper
Minimum \(k\)-path vertex cover Discrete Applied Mathematics	2011-08-10	Paper
Finding monotone paths in edge-ordered graphs Discrete Applied Mathematics	2010-11-05	Paper

Research outcomes over time

This page was built for person: Ján Katrenič