Analyzing Worst-Case to Expander-Case Reductions in Graph Problems

The authors present self-reductions transforming worst-case instances to expanders, proving complexity equivalence. Their approach improves core gadgets for various problems, derandomizing and extending results.