Ohad Trabelsi

According to our database, Ohad Trabelsi authored at least 19 papers between 2015 and 2023.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2023

(Almost) Ruling Out SETH Lower Bounds for All-Pairs Max-Flow.

Ohad Trabelsi

CoRR, 2023

Bridge Girth: A Unifying Notion in Network Design.

Greg Bodwin, Gary Hoppenworth, Ohad Trabelsi

Proceedings of the 64th IEEE Annual Symposium on Foundations of Computer Science, 2023

2022

Friendly Cut Sparsifiers and Faster Gomory-Hu Trees.

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

Proceedings of the 2022 ACM-SIAM Symposium on Discrete Algorithms, 2022

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

Proceedings of the 63rd IEEE Annual Symposium on Foundations of Computer Science, 2022

2021

New Algorithms and Lower Bounds for All-Pairs Max-Flow in Undirected Graphs.

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

Adv. Math. Commun., 2021

Gomory-Hu Tree in Subcubic Time.

Amir Abboud, Robert Krauthgamer, Jason Li, Debmalya Panigrahi, Thatchaphol Saranurak, Ohad Trabelsi

CoRR, 2021

Subcubic algorithms for Gomory-Hu tree in unweighted graphs.

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

Proceedings of the STOC '21: 53rd Annual ACM SIGACT Symposium on Theory of Computing, 2021

APMF < APSP? Gomory-Hu Tree for Unweighted Graphs in Almost-Quadratic Time.

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

Proceedings of the 62nd IEEE Annual Symposium on Foundations of Computer Science, 2021

2020

Cut-Equivalent Trees are Optimal for Min-Cut Queries.

Amir Abboud, Robert Krauthgamer, Ohad Trabelsi

Proceedings of the 61st IEEE Annual Symposium on Foundations of Computer Science, 2020

2019

The Set Cover Conjecture and Subgraph Isomorphism with a Tree Pattern.

Robert Krauthgamer, Ohad Trabelsi

Proceedings of the 36th International Symposium on Theoretical Aspects of Computer Science, 2019

Relaxed Voronoi: A Simple Framework for Terminal-Clustering Problems.

Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi

Proceedings of the 2nd Symposium on Simplicity in Algorithms, 2019

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

Proceedings of the 46th International Colloquium on Automata, Languages, and Programming, 2019

2018

Conditional Lower Bounds for All-Pairs Max-Flow.

Robert Krauthgamer, Ohad Trabelsi

ACM Trans. Algorithms, 2018

Noisy Voronoi: a Simple Framework for Terminal-Clustering Problems.

Arnold Filtser, Robert Krauthgamer, Ohad Trabelsi

CoRR, 2018

Nearly Optimal Time Bounds for kPath in Hypergraphs.

Lior Kamma, Ohad Trabelsi

CoRR, 2018

Bounded-Hop Communication Networks.

Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi

Algorithmica, 2018

2017

Revisiting the Set Cover Conjecture.

Robert Krauthgamer, Ohad Trabelsi

CoRR, 2017

Conditional Lower Bound for Subgraph Isomorphism with a Tree Pattern.

Robert Krauthgamer, Ohad Trabelsi

CoRR, 2017

2015

On the Bounded-Hop Range Assignment Problem.

Paz Carmi, Lilach Chaitman-Yerushalmi, Ohad Trabelsi

Proceedings of the Algorithms and Data Structures - 14th International Symposium, 2015