Ohad Trabelsi

34 papers A* 12A 1B 1Journal 19Unranked 1
YearRankTypeTitle / Venue / Authors
2026 A* conf
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs.
SODA
Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi
2025 A* conf
(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow.
SODA
Ohad Trabelsi
2025 A* conf
Breaking the O(m
STOC
Julia Chuzhoy, Ohad Trabelsi
2025 J jnl
Breaking the O(mn)-Time Barrier for Vertex-Weighted Global Minimum Cut.
CoRR
Julia Chuzhoy, Ohad Trabelsi
2025 J jnl
Faster Algorithms for Global Minimum Vertex-Cut in Directed Graphs.
CoRR
Julia Chuzhoy, Ron Mosenzon, Ohad Trabelsi
2023 J jnl
(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow.
CoRR
Ohad Trabelsi
2023 A* conf
Bridge Girth: A Unifying Notion in Network Design.
FOCS
Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2022 A* conf
Breaking the Cubic Barrier for All-Pairs Max-Flow: Gomory-Hu Tree in Nearly Quadratic Time.
FOCS
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2022 J jnl
Bridge Girth: A Unifying Notion in Network Design.
CoRR
Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi
2022 A* conf
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees.
SODA
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2021 A* conf
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time.
FOCS
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2021 J jnl
APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time.
CoRR
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2021 J jnl
Friendly Cut Sparsifiers and Faster Gomory-Hu Trees.
CoRR
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2021 J jnl
Gomory-Hu Tree in Subcubic Time.
CoRR
Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi
2021 J jnl
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.
Theory Comput.
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2021 A* conf
Subcubic algorithms for Gomory-Hu tree in unweighted graphs.
STOC
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020 A* conf
Cut-Equivalent Trees are Optimal for Min-Cut Queries.
FOCS
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020 J jnl
Cut-Equivalent Trees are Optimal for Min-Cut Queries.
CoRR
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020 A* conf
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.
SODA
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2020 J jnl
Subcubic Algorithms for Gomory-Hu Tree in Unweighted Graphs.
CoRR
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2019 A* conf
Faster Algorithms for All-Pairs Bounded Min-Cuts.
ICALP
Amir Abboud, Loukas Georgiadis, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski, Daniel Wolleb-Graf
2019 J jnl
New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.
CoRR
Amir Abboud, Robert Krauthgamer, Ohad Trabelsi
2019 — conf
Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems.
SOSA
Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi
2019 A conf
The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern.
STACS
Robert Krauthgamer, Ohad Trabelsi
2018 J jnl
Bounded-Hop Communication Networks.
Algorithmica
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi
2018 J jnl
Conditional Lower Bounds for All-Pairs Max-Flow.
ACM Trans. Algorithms
Robert Krauthgamer, Ohad Trabelsi
2018 J jnl
Faster Algorithms for All-Pairs Bounded Min-Cuts.
CoRR
Amir Abboud, Loukas Georgiadis, Daniel Graf, Giuseppe F. Italiano, Robert Krauthgamer, Nikos Parotsidis, Ohad Trabelsi, Przemyslaw Uznanski
2018 J jnl
Nearly Optimal Time Bounds for kPath in Hypergraphs.
CoRR
Lior Kamma, Ohad Trabelsi
2018 J jnl
Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems.
CoRR
Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi
2017 J jnl
Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern.
CoRR
Robert Krauthgamer, Ohad Trabelsi
2017 A* conf
Conditional Lower Bounds for All-Pairs Max-Flow.
ICALP
Robert Krauthgamer, Ohad Trabelsi
2017 J jnl
Conditional Lower Bounds for All-Pairs Max-Flow.
CoRR
Robert Krauthgamer, Ohad Trabelsi
2017 J jnl
Revisiting the Set Cover Conjecture.
CoRR
Robert Krauthgamer, Ohad Trabelsi
2015 B conf
On the Bounded-Hop Range Assignment Problem.
WADS
Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi