In this paper, we prove that assuming the exponential time hypothesis (E...
In this paper, we prove that it is W[2]-hard to approximate k-SetCover
w...
Given a simple graph G and an integer k, the goal of k-Clique problem
is...
For every graph G, let ω(G) be the largest size of complete subgraph
in ...
The k-Even Set problem is a parameterized variant of the Minimum Distanc...
Given an n-vertex bipartite graph I=(S,U,E), the goal of set cover
probl...