5 citations · 5 across the 15 of their papers we have counts for
1 paper · 1 filter
Tatsuya Gima, Tesshu Hanaka, Masashi Kiyomi +2
For intractable problems on graphs of bounded treewidth, two graph parameters treedepth and vertex cover number have been used to obtain fine-grained complexity results. Although t…