On the Bounded-Hop Range Assignment Problem. - Paz Carmi; Lilach Chaitman-Yerushalmi; Ohad Trabelsi (WADS, 2015)

Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern. - Robert Krauthgamer; Ohad Trabelsi (CoRR, 2017)

Revisiting the Set Cover Conjecture. - Robert Krauthgamer; Ohad Trabelsi (CoRR, 2017)

Bounded-Hop Communication Networks. - Paz Carmi; Lilach Chaitman-Yerushalmi; Ohad Trabelsi (Algorithmica, 2018)

Nearly Optimal Time Bounds for kPath in Hypergraphs. - Lior Kamma; Ohad Trabelsi (CoRR, 2018)

Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (CoRR, 2018)

Conditional Lower Bounds for All-Pairs Max-Flow. - Robert Krauthgamer; Ohad Trabelsi (ACM Trans. Algorithms, 2018)

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 (ICALP, 2019)

Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems. - Arnold Filtser; Robert Krauthgamer; Ohad Trabelsi (SOSA, 2019)

The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern. - Robert Krauthgamer; Ohad Trabelsi (STACS, 2019)

Cut-Equivalent Trees are Optimal for Min-Cut Queries. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (FOCS, 2020)

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (FOCS, 2021)

Subcubic algorithms for Gomory-Hu tree in unweighted graphs. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (STOC, 2021)

Gomory-Hu Tree in Subcubic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (CoRR, 2021)

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (Adv. Math. Commun., 2021)

Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time. - Amir Abboud; Robert Krauthgamer; Jason Li 006; Debmalya Panigrahi; Thatchaphol Saranurak; Ohad Trabelsi (FOCS, 2022)

Friendly Cut Sparsifiers and Faster Gomory-Hu Trees. - Amir Abboud; Robert Krauthgamer; Ohad Trabelsi (SODA, 2022)

Bridge Girth: A Unifying Notion in Network Design. - Greg Bodwin; Gary Hoppenworth; Ohad Trabelsi (FOCS, 2023)

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow. - Ohad Trabelsi (CoRR, 2023)

Breaking the O(m2n)-Time Barrier for Vertex-Weighted Global Minimum Cut. - Julia Chuzhoy; Ohad Trabelsi (STOC, 2025)

Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut. - Julia Chuzhoy; Ohad Trabelsi (CoRR, 2025)