@InProceedings{abboud_et_al:LIPIcs.ITCS.2023.1,
author = {Abboud, Amir and Wallheimer, Nathan},
title = {{Worst-Case to Expander-Case Reductions}},
booktitle = {14th Innovations in Theoretical Computer Science Conference (ITCS 2023)},
pages = {1:1--1:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-263-1},
ISSN = {1868-8969},
year = {2023},
volume = {251},
editor = {Tauman Kalai, Yael},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ITCS.2023.1},
URN = {urn:nbn:de:0030-drops-175044},
doi = {10.4230/LIPIcs.ITCS.2023.1},
annote = {Keywords: Fine-Grained Complexity, Expander Decomposition, Reductions, Exact and Parameterized Complexity, Expander Graphs, Triangle, Maximum Matching, Clique, 4-Cycle, Vertex Cover, Dominating Set}
}