9 citations · 10 across the 4 of their papers we have counts for
4 papers
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 …
On the computational complexity of read once resolution decidability in 2CNF formulas
Hans Kleine Büning, Piotr Wojciechowski, K. Subramani
In this paper, we analyze 2CNF formulas from the perspectives of Read-Once resolution (ROR) refutation schemes. We focus on two types of ROR refutations, viz., variable-once refuta…
Complexity issues in some clustering problems in combinatorial circuits
Zola Donovan, Vahan Mkrtchyan, K. Subramani
The modern integrated circuit is one of the most complex products that has been engineered to-date. It continues to grow in complexity as the years progress. As a result, very larg…
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…