375 citations · 494 across the 29 of their papers we have counts for
Showing 2012Show all
2 papers · 1 filter
cs.DS2012★ 5 cited
Fixed-parameter tractability of satisfying beyond the number of variables
R. Crowston, G. Gutin, M. Jones +3
We consider a CNF formula as a multiset of clauses: . The set of variables of will be denoted by . Let denote the bipartite graph with parti…
cs.DS2012★ 19 cited
Faster Parameterized Algorithms using Linear Programming
Daniel Lokshtanov, N. S. Narayanaswamy, Venkatesh Raman +2
We investigate the parameterized complexity of Vertex Cover parameterized by the difference between the size of the optimal solution and the value of the linear programming (LP) re…