| 2026 | ESA | Equivalent Dichotomies for Triangle Detection in Subgraph, Induced, and Colored H-Free Graphs. | Amir Abboud, Ron Safier, Nathan Wallheimer |
| 2026 | SODA | A Truly Subcubic Combinatorial Algorithm for Induced 4-Cycle Detection. | Amir Abboud, Shyan Akmal, Nick Fischer |
| 2025 | FOCS | Deterministic Almost-Linear-Time Gomory-Hu Trees. | Amir Abboud, Rasmus Kyng, Jason Li, Debmalya Panigrahi, Maximilian Probst Gutenberg, Thatchaphol Saranurak, Weixuan Yuan, Wuwei Yuan |
| 2025 | SODA | Recognizing Sumsets is NP-Complete. | Amir Abboud, Nick Fischer, Ron Safier, Nathan Wallheimer |
| 2025 | STOC | All-Pairs Shortest Paths with Few Weights per Node. | Amir Abboud, Nick Fischer, Ce Jin, Virginia Vassilevska Williams, Zoe Xi |
| 2024 | ESA | From Donkeys to Kings in Tournaments. | Amir Abboud, Tomer Grossman, Moni Naor, Tomer Solomon |
| 2024 | ESA | Worst-Case to Expander-Case Reductions: Derandomized and Generalized. | Amir Abboud, Nathan Wallheimer |
| 2024 | LATIN | Faster Combinatorial k-Clique Algorithms. | Amir Abboud, Nick Fischer, Yarin Shechter |
| 2024 | SODA | The Time Complexity of Fully Sparse Matrix Multiplication. | Amir Abboud, Karl Bringmann, Nick Fischer, Marvin Knnemann |
| 2024 | STOC | New Graph Decompositions and Combinatorial Boolean Matrix Multiplication Algorithms. | Amir Abboud, Nick Fischer, Zander Kelley, Shachar Lovett, Raghu Meka |
| 2023 | ESA | On Diameter Approximation in Directed Graphs. | Amir Abboud, Mina Dalirrooyfard, Ray Li, Virginia Vassilevska Williams |
| 2023 | ESA | Can You Solve Closest String Faster Than Exhaustive Search? | Amir Abboud, Nick Fischer, Elazar Goldenberg, Karthik C. S., Ron Safier |
| 2023 | ESA | What Else Can Voronoi Diagrams Do for Diameter in Planar Graphs? | Amir Abboud, Shay Mozes, Oren Weimann |
| 2023 | FOCS | All-Pairs Max-Flow is no Harder than Single-Pair Max-Flow: Gomory-Hu Trees in Almost-Linear Time. | Amir Abboud, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak |
| 2023 | STOC | Stronger 3-SUM Lower Bounds for Approximate Distance Oracles via Additive Combinatorics. | Amir Abboud, Karl Bringmann, Nick Fischer |
| 2022 | FOCS | Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. | Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi |
| 2022 | ICALP | Improved Approximation Algorithms and Lower Bounds for Search-Diversification Problems. | Amir Abboud, Vincent Cohen-Addad, Euiwoong Lee, Pasin Manurangsi |
| 2022 | SODA | Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2022 | STOC | Hardness of approximation in p via short cycle removal: cycle detection, distance oracles, and beyond. | Amir Abboud, Karl Bringmann, Seri Khoury, Or Zamir |
| 2021 | FOCS | APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2021 | ICALP | Fine-Grained Hardness for Edit Distance to a Fixed Sequence. | Amir Abboud, Virginia Vassilevska Williams |
| 2021 | STOC | Subcubic algorithms for Gomory-Hu tree in unweighted graphs. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2020 | FOCS | Cut-Equivalent Trees are Optimal for Min-Cut Queries. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2020 | ICALP | Scheduling Lower Bounds via AND Subset Sum. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2020 | ICALP | On the Fine-Grained Complexity of Parity Problems. | Amir Abboud, Shon Feller, Oren Weimann |
| 2020 | SODA | New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2020 | STOC | New hardness results for planar graph problems in p and an algorithm for sparsest cut. | Amir Abboud, Vincent Cohen-Addad, Philip N. Klein |
| 2019 | ICALP | Fine-Grained Reductions and Quantum Speedups for Dynamic Programming. | Amir Abboud |
| 2019 | ICALP | Faster Algorithms for All-Pairs Bounded Min-Cuts. | Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf |
| 2019 | SODA | SETH-Based Lower Bounds for Subset Sum and Bicriteria Path. | Amir Abboud, Karl Bringmann, Danny Hermelin, Dvir Shabtay |
| 2019 | STOC | Dynamic set cover: improved algorithms and lower bounds. | Amir Abboud, Raghavendra Addanki, Fabrizio Grandoni, Debmalya Panigrahi, Barna Saha |
| 2018 | ICALP | Tighter Connections Between Formula-SAT and Shaving Logs. | Amir Abboud, Karl Bringmann |
| 2018 | SODA | Reachability Preservers: New Extremal Bounds and Approximation Algorithms. | Amir Abboud, Greg Bodwin |
| 2018 | SODA | Near-Optimal Compression for the Planar Graph Metric. | Amir Abboud, Pawel Gawrychowski, Shay Mozes, Oren Weimann |
| 2018 | STOC | More consequences of falsifying SETH and the orthogonal vectors conjecture. | Amir Abboud, Karl Bringmann, Holger Dell, Jesper Nederlof |
| 2017 | FOCS | Fine-Grained Complexity of Analyzing Compressed Data: Quantifying Improvements over Decompress-and-Solve. | Amir Abboud, Arturs Backurs, Karl Bringmann, Marvin Knnemann |
| 2017 | FOCS | Distributed PCP Theorems for Hardness of Approximation in P. | Amir Abboud, Aviad Rubinstein, R. Ryan Williams |
| 2017 | SODA | A Hierarchy of Lower Bounds for Sublinear Additive Spanners. | Amir Abboud, Greg Bodwin, Seth Pettie |
| 2016 | FOCS | Popular Conjectures as a Barrier for Dynamic Planar Graph Algorithms. | Amir Abboud, Sren Dahlgaard |
| 2016 | SODA | Error Amplification for Pairwise Spanner Lower Bounds. | Amir Abboud, Greg Bodwin |
| 2016 | SODA | Subtree Isomorphism Revisited. | Amir Abboud, Arturs Backurs, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Or Zamir |
| 2016 | SODA | Approximation and Fixed Parameter Subquadratic Algorithms for Radius and Diameter in Sparse Graphs. | Amir Abboud, Virginia Vassilevska Williams, Joshua R. Wang |
| 2016 | STOC | The 4/3 additive spanner exponent is tight. | Amir Abboud, Greg Bodwin |
| 2016 | STOC | Simulating branching programs with edit distance and friends: or: a polylog shaved is a lower bound made. | Amir Abboud, Thomas Dueholm Hansen, Virginia Vassilevska Williams, Ryan Williams |
| 2015 | FOCS | Tight Hardness Results for LCS and Other Sequence Similarity Measures. | Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams |
| 2015 | FOCS | If the Current Clique Algorithms are Optimal, So is Valiant's Parser. | Amir Abboud, Arturs Backurs, Virginia Vassilevska Williams |
| 2015 | SODA | Subcubic Equivalences Between Graph Centrality Problems, APSP and Diameter. | Amir Abboud, Fabrizio Grandoni, Virginia Vassilevska Williams |
| 2015 | SODA | More Applications of the Polynomial Method to Algorithm Design. | Amir Abboud, Richard Ryan Williams, Huacheng Yu |
| 2015 | STOC | Matching Triangles and Basing Hardness on an Extremely Popular Conjecture. | Amir Abboud, Virginia Vassilevska Williams, Huacheng Yu |
| 2014 | ESA | Losing Weight by Gaining Edges. | Amir Abboud, Kevin Lewi, Ryan Williams |
| 2014 | FOCS | Popular Conjectures Imply Strong Lower Bounds for Dynamic Problems. | Amir Abboud, Virginia Vassilevska Williams |
| 2014 | ICALP | Consequences of Faster Alignment of Sequences. | Amir Abboud, Virginia Vassilevska Williams, Oren Weimann |
| 2013 | ICALP | Exact Weight Subgraphs and the k-Sum Conjecture. | Amir Abboud, Kevin Lewi |
| 2013 | VLDB | Safe-Zones for Monitoring Distributed Streams. | Daniel Keren, Guy Sagy, Amir Abboud, David Ben-David, Izchak Sharfman, Assaf Schuster |