Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity

Mitali Bafna, Karthik C. S., and Dor Minzer. 2025. Near Optimal Constant Inapproximability under ETH for Fundamental Problems in Parameterized Complexity. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing (STOC '25). Association for Computing Machinery, New York, NY, USA, 2118–2129.