4 citations · 7 across the 6 of their papers we have counts for
1 paper · 1 filter
Yoichi Iwata, Keigo Oka, Yuichi Yoshida
In the area of parameterized complexity, to cope with NP-Hard problems, we introduce a parameter k besides the input size n, and we aim to design algorithms (called FPT algorithms)…