| 2026 | SODA | Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs. | Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi |
| 2025 | SODA | (Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow. | Ohad Trabelsi |
| 2025 | STOC | Breaking the O(m | Julia Chuzhoy, Ohad Trabelsi |
| 2023 | FOCS | Bridge Girth: A Unifying Notion in Network Design. | Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi |
| 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 | SODA | Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 2021 | FOCS | APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 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 | SODA | New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. | Amir Abboud, Robert Krauthgamer, Ohad Trabelsi |
| 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 | Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. | Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi |
| 2019 | STACS | The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. | Robert Krauthgamer, Ohad Trabelsi |
| 2017 | ICALP | Conditional Lower Bounds for All-Pairs Max-Flow. | Robert Krauthgamer, Ohad Trabelsi |
| 2015 | WADS | On the Bounded-Hop Range Assignment Problem. | Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi |