9 citations · 9 across the 2 of their papers we have counts for
2 papers
cs.DM2019
Parameterized algorithms for Partial vertex covers in bipartite graphs
Vahan Mkrtchyan, Garik Petrosyan, K. Subramani
In the weighted partial vertex cover problem (WPVC), we are given a graph , cost function , profit function , and positive integers …
cs.CC2013★ 9 cited
On Partial Vertex Cover on Bipartite Graphs and Trees
Bugra Caskurlu, K. Subramani
It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs is open. I…