4 citations · 7 across the 6 of their papers we have counts for
1 paper · 1 filter
Yinglei Song
In this paper, we study the parameterized complexity and inapproximability of the {\sc Induced Matching} problem in hamiltonian bipartite graphs. We show that, given a hamiltonian…