1 citations · 1 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.CC2016★ 1 cited
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…