A lattice reduction is an algorithm that transforms the given basis of t...
In the DELETION TO INDUCED MATCHING problem, we are given a graph G on n...
A lattice reduction is an algorithm that transforms the given basis of t...
We show that 2-CLUB is NP-hard for distance to 2-club cluster graphs....