Ohad Trabelsi

Publication Activity (10 Years)

Years Active: 2015-2023
Publications (10 Years): 29

Top Topics

Communication Networks

Moment Invariants

Top Venues

Publications

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