| No. |
Title |
Author |
Year |
| 1 |
Can You Solve Closest String Faster Than Exhaustive Search? |
Abboud, Amir et al. |
2023 |
| 2 |
On Complexity of 1-Center in Various Metrics |
Abboud, Amir et al. |
2023 |
| 3 |
On Diameter Approximation in Directed Graphs |
Abboud, Amir et al. |
2023 |
| 4 |
What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? |
Abboud, Amir et al. |
2023 |
| 5 |
Worst-Case to Expander-Case Reductions |
Abboud, Amir et al. |
2023 |
| 6 |
Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems |
Abboud, Amir et al. |
2022 |
| 7 |
Fine-Grained Hardness for Edit Distance to a Fixed Sequence |
Abboud, Amir et al. |
2021 |
| 8 |
On the Fine-Grained Complexity of Parity Problems |
Abboud, Amir et al. |
2020 |
| 9 |
Scheduling Lower Bounds via AND Subset Sum |
Abboud, Amir et al. |
2020 |
| 10 |
Faster Algorithms for All-Pairs Bounded Min-Cuts |
Abboud, Amir et al. |
2019 |
| 11 |
Fine-Grained Reductions and Quantum Speedups for Dynamic Programming |
Abboud, Amir |
2019 |
| 12 |
Fast and Deterministic Constant Factor Approximation Algorithms for LCS Imply New Circuit Lower Bounds |
Abboud, Amir et al. |
2018 |
| 13 |
Tighter Connections Between Formula-SAT and Shaving Logs |
Abboud, Amir et al. |
2018 |
| 14 |
Towards Hardness of Approximation for Polynomial Time Problems |
Abboud, Amir et al. |
2017 |
