1 citations · 1 across the 4 of their papers we have counts for
1 paper · 2 filters
Hans L. Bodlaender, Tom C. van der Zanden
In this paper, we give new, tight subexponential lower bounds for a number of graph embedding problems. We introduce two related combinatorial problems, which we call String Crafti…