167 citations · 179 across the 2 of their papers we have counts for
2 papers
cs.DS2011★ 12 cited
A generalization of Hopcroft-Karp algorithm for semi-matchings and covers in bipartite graphs (Maximum semi-matching problem in bipartite graphs)
Ján Katrenic, Gabriel Semanisin
An -semi-matching in a bipartite graph is a set of edges such that each vertex is incident with at most edges of , and ea…
math.CO2010★ 167 cited
Minimum k-path vertex cover
Boštjan Brešar, František Kardoš, Ján Katrenič +1
A subset S of vertices of a graph G is called a k-path vertex cover if every path of order k in G contains at least one vertex from S. Denote by ψ_k(G) the minimum cardinality of a…