1 citations · 1 across the 5 of their papers we have counts for
1 paper · 1 filter
Narek Bojikian, Vera Chekan, Falko Hegerfeld +1
In this work we start the investigation of tight complexity bounds for connectivity problems parameterized by cutwidth assuming the Strong Exponential-Time Hypothesis (SETH). Van G…