1 citations · 1 across the 7 of their papers we have counts for
1 paper · 1 filter
Malory Marin, Rémi Watrigant
While most classical NP-hard graph problems cannot be solved in time 2o(n) on general graphs under the Exponential Time Hypothesis (ETH), many exhibit the square-root phenomen…